./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:14:39,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:14:39,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-04 07:14:39,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:14:39,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:14:39,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:14:39,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:14:39,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:14:39,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:14:39,207 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:14:39,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:14:39,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:14:39,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:14:39,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:14:39,209 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:14:39,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:14:39,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:14:39,209 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:14:39,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:14:39,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:14:39,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:14:39,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:14:39,210 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:14:39,210 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:14:39,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:14:39,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:14:39,210 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:14:39,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:14:39,210 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:14:39,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:14:39,211 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:14:39,211 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:14:39,211 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:14:39,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:14:39,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:14:39,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:14:39,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:14:39,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:14:39,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:14:39,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:14:39,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:14:39,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:14:39,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:14:39,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:14:39,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:14:39,212 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-03-04 07:14:39,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:14:39,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:14:39,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:14:39,444 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:14:39,445 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:14:39,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2025-03-04 07:14:40,555 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4bc60292/cbdc170b75c44dbab3502282a1f97e36/FLAG13a00de29 [2025-03-04 07:14:40,847 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:14:40,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2025-03-04 07:14:40,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4bc60292/cbdc170b75c44dbab3502282a1f97e36/FLAG13a00de29 [2025-03-04 07:14:40,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4bc60292/cbdc170b75c44dbab3502282a1f97e36 [2025-03-04 07:14:40,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:14:40,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:14:40,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:14:40,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:14:40,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:14:40,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:14:40" (1/1) ... [2025-03-04 07:14:40,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2308a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:40, skipping insertion in model container [2025-03-04 07:14:40,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:14:40" (1/1) ... [2025-03-04 07:14:40,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:14:41,170 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-04 07:14:41,202 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:14:41,207 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-04 07:14:41,212 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-04 07:14:41,217 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-04 07:14:41,237 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-04 07:14:41,237 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-04 07:14:41,239 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-04 07:14:41,239 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-04 07:14:41,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:14:41,251 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:14:41,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:14:41,363 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:14:41,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41 WrapperNode [2025-03-04 07:14:41,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:14:41,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:14:41,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:14:41,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:14:41,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (1/1) ... [2025-03-04 07:14:41,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (1/1) ... [2025-03-04 07:14:41,459 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1241 [2025-03-04 07:14:41,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:14:41,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:14:41,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:14:41,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:14:41,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (1/1) ... [2025-03-04 07:14:41,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (1/1) ... [2025-03-04 07:14:41,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (1/1) ... [2025-03-04 07:14:41,527 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-03-04 07:14:41,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (1/1) ... [2025-03-04 07:14:41,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (1/1) ... [2025-03-04 07:14:41,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (1/1) ... [2025-03-04 07:14:41,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (1/1) ... [2025-03-04 07:14:41,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (1/1) ... [2025-03-04 07:14:41,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (1/1) ... [2025-03-04 07:14:41,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:14:41,583 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:14:41,583 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:14:41,583 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:14:41,583 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (1/1) ... [2025-03-04 07:14:41,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:14:41,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:14:41,613 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-04 07:14:41,617 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-04 07:14:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 07:14:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 07:14:41,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 07:14:41,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 07:14:41,633 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:14:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:14:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:14:41,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:14:41,779 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:14:41,781 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:14:42,687 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: 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-04 07:14:42,753 INFO L? ?]: Removed 296 outVars from TransFormulas that were not future-live. [2025-03-04 07:14:42,753 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:14:42,793 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:14:42,793 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 07:14:42,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:14:42 BoogieIcfgContainer [2025-03-04 07:14:42,793 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:14:42,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:14:42,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:14:42,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:14:42,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:14:40" (1/3) ... [2025-03-04 07:14:42,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ecd41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:14:42, skipping insertion in model container [2025-03-04 07:14:42,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:41" (2/3) ... [2025-03-04 07:14:42,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ecd41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:14:42, skipping insertion in model container [2025-03-04 07:14:42,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:14:42" (3/3) ... [2025-03-04 07:14:42,801 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test2-1.i [2025-03-04 07:14:42,811 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:14:42,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test2-1.i that has 4 procedures, 371 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2025-03-04 07:14:42,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:14:42,860 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;@12a76b90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:14:42,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 07:14:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 363 states, 356 states have (on average 1.6207865168539326) internal successors, (577), 358 states have internal predecessors, (577), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:42,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:14:42,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:42,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:14:42,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:42,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:42,872 INFO L85 PathProgramCache]: Analyzing trace with hash 20500437, now seen corresponding path program 1 times [2025-03-04 07:14:42,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:42,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675878823] [2025-03-04 07:14:42,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:42,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:42,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:14:42,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:14:42,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:42,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:43,072 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-04 07:14:43,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:43,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675878823] [2025-03-04 07:14:43,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675878823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:43,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:43,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:14:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301091565] [2025-03-04 07:14:43,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:43,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:14:43,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:43,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:14:43,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:14:43,095 INFO L87 Difference]: Start difference. First operand has 363 states, 356 states have (on average 1.6207865168539326) internal successors, (577), 358 states have internal predecessors, (577), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-04 07:14:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:43,396 INFO L93 Difference]: Finished difference Result 524 states and 765 transitions. [2025-03-04 07:14:43,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:14:43,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2025-03-04 07:14:43,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:43,404 INFO L225 Difference]: With dead ends: 524 [2025-03-04 07:14:43,404 INFO L226 Difference]: Without dead ends: 520 [2025-03-04 07:14:43,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:14:43,407 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 237 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:43,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1409 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:14:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-04 07:14:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 517. [2025-03-04 07:14:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 511 states have (on average 1.4696673189823874) internal successors, (751), 512 states have internal predecessors, (751), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 757 transitions. [2025-03-04 07:14:43,453 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 757 transitions. Word has length 4 [2025-03-04 07:14:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:43,453 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 757 transitions. [2025-03-04 07:14:43,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-04 07:14:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 757 transitions. [2025-03-04 07:14:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 07:14:43,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:43,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:43,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:14:43,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:43,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:43,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1027857270, now seen corresponding path program 1 times [2025-03-04 07:14:43,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:43,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960598975] [2025-03-04 07:14:43,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:43,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 07:14:43,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 07:14:43,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:43,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:43,696 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-04 07:14:43,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:43,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960598975] [2025-03-04 07:14:43,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960598975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:43,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:43,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:14:43,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354784289] [2025-03-04 07:14:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:43,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:14:43,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:43,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:14:43,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:14:43,698 INFO L87 Difference]: Start difference. First operand 517 states and 757 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:14:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:43,830 INFO L93 Difference]: Finished difference Result 523 states and 749 transitions. [2025-03-04 07:14:43,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:14:43,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-04 07:14:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:43,832 INFO L225 Difference]: With dead ends: 523 [2025-03-04 07:14:43,832 INFO L226 Difference]: Without dead ends: 523 [2025-03-04 07:14:43,832 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-04 07:14:43,833 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 105 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:43,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1281 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:14:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-04 07:14:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 517. [2025-03-04 07:14:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 511 states have (on average 1.442270058708415) internal successors, (737), 512 states have internal predecessors, (737), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 743 transitions. [2025-03-04 07:14:43,863 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 743 transitions. Word has length 65 [2025-03-04 07:14:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:43,863 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 743 transitions. [2025-03-04 07:14:43,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:14:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 743 transitions. [2025-03-04 07:14:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 07:14:43,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:43,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:43,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:14:43,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:43,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:43,866 INFO L85 PathProgramCache]: Analyzing trace with hash 880109711, now seen corresponding path program 1 times [2025-03-04 07:14:43,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:43,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232743663] [2025-03-04 07:14:43,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:43,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:43,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 07:14:43,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 07:14:43,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:43,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:44,338 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-04 07:14:44,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:44,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232743663] [2025-03-04 07:14:44,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232743663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:44,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:44,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:14:44,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799982986] [2025-03-04 07:14:44,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:44,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:14:44,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:44,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:14:44,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:14:44,340 INFO L87 Difference]: Start difference. First operand 517 states and 743 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:14:44,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:44,574 INFO L93 Difference]: Finished difference Result 713 states and 1025 transitions. [2025-03-04 07:14:44,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:14:44,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-04 07:14:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:44,577 INFO L225 Difference]: With dead ends: 713 [2025-03-04 07:14:44,577 INFO L226 Difference]: Without dead ends: 710 [2025-03-04 07:14:44,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:14:44,578 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 500 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:44,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1950 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:14:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-03-04 07:14:44,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 362. [2025-03-04 07:14:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 356 states have (on average 1.4382022471910112) internal successors, (512), 357 states have internal predecessors, (512), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 518 transitions. [2025-03-04 07:14:44,593 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 518 transitions. Word has length 65 [2025-03-04 07:14:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:44,594 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 518 transitions. [2025-03-04 07:14:44,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:14:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 518 transitions. [2025-03-04 07:14:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 07:14:44,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:44,599 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, 1] [2025-03-04 07:14:44,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:14:44,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:44,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash -980671067, now seen corresponding path program 1 times [2025-03-04 07:14:44,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:44,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091238490] [2025-03-04 07:14:44,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:44,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:44,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 07:14:44,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 07:14:44,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:44,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:44,800 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-04 07:14:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:44,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091238490] [2025-03-04 07:14:44,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091238490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:44,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:44,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:14:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714335436] [2025-03-04 07:14:44,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:44,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:14:44,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:44,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:14:44,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:14:44,801 INFO L87 Difference]: Start difference. First operand 362 states and 518 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-04 07:14:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:44,930 INFO L93 Difference]: Finished difference Result 365 states and 514 transitions. [2025-03-04 07:14:44,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:14:44,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2025-03-04 07:14:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:44,932 INFO L225 Difference]: With dead ends: 365 [2025-03-04 07:14:44,932 INFO L226 Difference]: Without dead ends: 365 [2025-03-04 07:14:44,932 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-04 07:14:44,932 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 105 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:44,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1260 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:14:44,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-04 07:14:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2025-03-04 07:14:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 356 states have (on average 1.4185393258426966) internal successors, (505), 357 states have internal predecessors, (505), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 511 transitions. [2025-03-04 07:14:44,962 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 511 transitions. Word has length 84 [2025-03-04 07:14:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:44,962 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 511 transitions. [2025-03-04 07:14:44,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-04 07:14:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 511 transitions. [2025-03-04 07:14:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 07:14:44,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:44,963 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, 1] [2025-03-04 07:14:44,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:14:44,964 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:44,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash 906242143, now seen corresponding path program 1 times [2025-03-04 07:14:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:44,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618610005] [2025-03-04 07:14:44,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:44,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:45,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 07:14:45,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 07:14:45,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:45,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:45,116 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-04 07:14:45,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:45,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618610005] [2025-03-04 07:14:45,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618610005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:45,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:45,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:14:45,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987659953] [2025-03-04 07:14:45,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:45,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:14:45,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:45,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:14:45,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:14:45,119 INFO L87 Difference]: Start difference. First operand 362 states and 511 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-04 07:14:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:45,246 INFO L93 Difference]: Finished difference Result 628 states and 895 transitions. [2025-03-04 07:14:45,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:14:45,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2025-03-04 07:14:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:45,249 INFO L225 Difference]: With dead ends: 628 [2025-03-04 07:14:45,250 INFO L226 Difference]: Without dead ends: 628 [2025-03-04 07:14:45,251 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-04 07:14:45,253 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 331 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:45,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1090 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:14:45,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-04 07:14:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 622. [2025-03-04 07:14:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 616 states have (on average 1.4366883116883118) internal successors, (885), 617 states have internal predecessors, (885), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 891 transitions. [2025-03-04 07:14:45,268 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 891 transitions. Word has length 84 [2025-03-04 07:14:45,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:45,268 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 891 transitions. [2025-03-04 07:14:45,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-04 07:14:45,268 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 891 transitions. [2025-03-04 07:14:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 07:14:45,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:45,270 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] [2025-03-04 07:14:45,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:14:45,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:45,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1403427332, now seen corresponding path program 1 times [2025-03-04 07:14:45,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:45,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883141795] [2025-03-04 07:14:45,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:45,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 07:14:45,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 07:14:45,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:45,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:14:45,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:45,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883141795] [2025-03-04 07:14:45,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883141795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:14:45,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009281681] [2025-03-04 07:14:45,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:45,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:14:45,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:14:45,670 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-04 07:14:45,672 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-04 07:14:45,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 07:14:45,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 07:14:45,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:45,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:45,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:14:45,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:14:45,922 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-04 07:14:45,945 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 16 treesize of output 17 [2025-03-04 07:14:46,646 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-04 07:14:46,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:14:46,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009281681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:46,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:14:46,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 07:14:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403386788] [2025-03-04 07:14:46,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:46,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:14:46,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:46,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:14:46,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:14:46,648 INFO L87 Difference]: Start difference. First operand 622 states and 891 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-04 07:14:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:48,248 INFO L93 Difference]: Finished difference Result 895 states and 1267 transitions. [2025-03-04 07:14:48,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:14:48,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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 99 [2025-03-04 07:14:48,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:48,251 INFO L225 Difference]: With dead ends: 895 [2025-03-04 07:14:48,251 INFO L226 Difference]: Without dead ends: 895 [2025-03-04 07:14:48,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:14:48,251 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 763 mSDsluCounter, 2284 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 2779 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:48,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 2779 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 07:14:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-04 07:14:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 647. [2025-03-04 07:14:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 641 states have (on average 1.4274570982839314) internal successors, (915), 642 states have internal predecessors, (915), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 921 transitions. [2025-03-04 07:14:48,263 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 921 transitions. Word has length 99 [2025-03-04 07:14:48,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:48,263 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 921 transitions. [2025-03-04 07:14:48,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-04 07:14:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 921 transitions. [2025-03-04 07:14:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 07:14:48,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:48,264 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] [2025-03-04 07:14:48,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:14:48,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 07:14:48,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:48,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2007076447, now seen corresponding path program 1 times [2025-03-04 07:14:48,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:48,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358939948] [2025-03-04 07:14:48,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:48,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:48,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 07:14:48,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 07:14:48,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:48,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:14:48,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:48,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358939948] [2025-03-04 07:14:48,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358939948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:14:48,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223201769] [2025-03-04 07:14:48,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:48,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:14:48,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:14:48,718 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-04 07:14:48,719 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-04 07:14:48,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 07:14:48,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 07:14:48,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:48,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:48,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:14:48,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:14:49,063 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-04 07:14:49,083 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-04 07:14:49,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:14:49,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223201769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:49,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:14:49,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-04 07:14:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656452023] [2025-03-04 07:14:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:49,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:14:49,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:49,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:14:49,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:14:49,085 INFO L87 Difference]: Start difference. First operand 647 states and 921 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-04 07:14:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:49,240 INFO L93 Difference]: Finished difference Result 810 states and 1153 transitions. [2025-03-04 07:14:49,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:14:49,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 100 [2025-03-04 07:14:49,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:49,243 INFO L225 Difference]: With dead ends: 810 [2025-03-04 07:14:49,243 INFO L226 Difference]: Without dead ends: 810 [2025-03-04 07:14:49,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:14:49,244 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 859 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:49,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1358 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:14:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-03-04 07:14:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 649. [2025-03-04 07:14:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 643 states have (on average 1.4261275272161742) internal successors, (917), 644 states have internal predecessors, (917), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 923 transitions. [2025-03-04 07:14:49,255 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 923 transitions. Word has length 100 [2025-03-04 07:14:49,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:49,256 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 923 transitions. [2025-03-04 07:14:49,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-04 07:14:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 923 transitions. [2025-03-04 07:14:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 07:14:49,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:49,258 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] [2025-03-04 07:14:49,266 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-04 07:14:49,458 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,SelfDestructingSolverStorable6 [2025-03-04 07:14:49,459 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:49,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:49,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1797042616, now seen corresponding path program 1 times [2025-03-04 07:14:49,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:49,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167611039] [2025-03-04 07:14:49,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:49,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:49,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 07:14:49,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 07:14:49,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:49,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:49,635 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-04 07:14:49,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:49,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167611039] [2025-03-04 07:14:49,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167611039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:49,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:49,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:14:49,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210721326] [2025-03-04 07:14:49,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:49,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:14:49,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:49,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:14:49,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:14:49,636 INFO L87 Difference]: Start difference. First operand 649 states and 923 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-04 07:14:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:49,968 INFO L93 Difference]: Finished difference Result 733 states and 1030 transitions. [2025-03-04 07:14:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:14:49,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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 155 [2025-03-04 07:14:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:49,971 INFO L225 Difference]: With dead ends: 733 [2025-03-04 07:14:49,971 INFO L226 Difference]: Without dead ends: 733 [2025-03-04 07:14:49,972 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-04 07:14:49,972 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 1149 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:49,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 1372 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:14:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-04 07:14:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 516. [2025-03-04 07:14:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 510 states have (on average 1.4137254901960785) internal successors, (721), 511 states have internal predecessors, (721), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 727 transitions. [2025-03-04 07:14:49,981 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 727 transitions. Word has length 155 [2025-03-04 07:14:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:49,981 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 727 transitions. [2025-03-04 07:14:49,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-04 07:14:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 727 transitions. [2025-03-04 07:14:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 07:14:49,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:49,986 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, 1, 1] [2025-03-04 07:14:49,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:14:49,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:49,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1419585878, now seen corresponding path program 1 times [2025-03-04 07:14:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:49,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179147211] [2025-03-04 07:14:49,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:49,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:50,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 07:14:50,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 07:14:50,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:50,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:14:50,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:50,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179147211] [2025-03-04 07:14:50,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179147211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:14:50,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003866948] [2025-03-04 07:14:50,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:50,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:14:50,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:14:50,388 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-04 07:14:50,389 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-04 07:14:50,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 07:14:50,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 07:14:50,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:50,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:50,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:14:50,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:14:50,715 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-04 07:14:50,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:14:50,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003866948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:50,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:14:50,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 07:14:50,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183674733] [2025-03-04 07:14:50,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:50,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:14:50,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:50,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:14:50,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:14:50,718 INFO L87 Difference]: Start difference. First operand 516 states and 727 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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-04 07:14:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:50,918 INFO L93 Difference]: Finished difference Result 559 states and 784 transitions. [2025-03-04 07:14:50,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:14:50,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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 165 [2025-03-04 07:14:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:50,920 INFO L225 Difference]: With dead ends: 559 [2025-03-04 07:14:50,920 INFO L226 Difference]: Without dead ends: 559 [2025-03-04 07:14:50,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:14:50,920 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 17 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:50,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1211 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:14:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-04 07:14:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 543. [2025-03-04 07:14:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 537 states have (on average 1.404096834264432) internal successors, (754), 538 states have internal predecessors, (754), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 760 transitions. [2025-03-04 07:14:50,929 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 760 transitions. Word has length 165 [2025-03-04 07:14:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:50,929 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 760 transitions. [2025-03-04 07:14:50,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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-04 07:14:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 760 transitions. [2025-03-04 07:14:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 07:14:50,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:50,931 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, 1, 1, 1] [2025-03-04 07:14:50,939 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-04 07:14:51,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:14:51,131 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:51,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash -994455534, now seen corresponding path program 1 times [2025-03-04 07:14:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390033683] [2025-03-04 07:14:51,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:51,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 07:14:51,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 07:14:51,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:51,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:51,414 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-04 07:14:51,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:51,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390033683] [2025-03-04 07:14:51,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390033683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:51,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:51,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:14:51,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893268662] [2025-03-04 07:14:51,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:51,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:14:51,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:51,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:14:51,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:14:51,415 INFO L87 Difference]: Start difference. First operand 543 states and 760 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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-04 07:14:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:51,804 INFO L93 Difference]: Finished difference Result 555 states and 774 transitions. [2025-03-04 07:14:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:14:51,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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 166 [2025-03-04 07:14:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:51,806 INFO L225 Difference]: With dead ends: 555 [2025-03-04 07:14:51,806 INFO L226 Difference]: Without dead ends: 555 [2025-03-04 07:14:51,806 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-04 07:14:51,807 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 8 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:51,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1818 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:14:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-04 07:14:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 551. [2025-03-04 07:14:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 545 states have (on average 1.4018348623853212) internal successors, (764), 546 states have internal predecessors, (764), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 770 transitions. [2025-03-04 07:14:51,815 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 770 transitions. Word has length 166 [2025-03-04 07:14:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:51,815 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 770 transitions. [2025-03-04 07:14:51,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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-04 07:14:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 770 transitions. [2025-03-04 07:14:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 07:14:51,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:51,817 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, 1, 1, 1, 1] [2025-03-04 07:14:51,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:14:51,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:51,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:51,818 INFO L85 PathProgramCache]: Analyzing trace with hash 730821230, now seen corresponding path program 1 times [2025-03-04 07:14:51,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:51,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310916309] [2025-03-04 07:14:51,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:51,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:51,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 07:14:51,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 07:14:51,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:51,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:52,077 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-04 07:14:52,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:52,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310916309] [2025-03-04 07:14:52,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310916309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:52,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:52,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:14:52,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955143143] [2025-03-04 07:14:52,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:52,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:14:52,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:52,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:14:52,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:14:52,081 INFO L87 Difference]: Start difference. First operand 551 states and 770 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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-04 07:14:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:52,577 INFO L93 Difference]: Finished difference Result 573 states and 800 transitions. [2025-03-04 07:14:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:14:52,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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 167 [2025-03-04 07:14:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:52,579 INFO L225 Difference]: With dead ends: 573 [2025-03-04 07:14:52,579 INFO L226 Difference]: Without dead ends: 573 [2025-03-04 07:14:52,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:14:52,580 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 12 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:52,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2153 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:14:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-04 07:14:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 567. [2025-03-04 07:14:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 561 states have (on average 1.4010695187165776) internal successors, (786), 562 states have internal predecessors, (786), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 792 transitions. [2025-03-04 07:14:52,590 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 792 transitions. Word has length 167 [2025-03-04 07:14:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:52,590 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 792 transitions. [2025-03-04 07:14:52,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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-04 07:14:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 792 transitions. [2025-03-04 07:14:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 07:14:52,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:52,592 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, 1, 1, 1, 1] [2025-03-04 07:14:52,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:14:52,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:52,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2029731987, now seen corresponding path program 1 times [2025-03-04 07:14:52,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:52,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62594003] [2025-03-04 07:14:52,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:52,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 07:14:52,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 07:14:52,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:52,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:14:52,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:52,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62594003] [2025-03-04 07:14:52,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62594003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:14:52,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930873381] [2025-03-04 07:14:52,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:52,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:14:52,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:14:52,857 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:14:52,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:14:53,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 07:14:53,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 07:14:53,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:53,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:53,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:14:53,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:14:53,168 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-04 07:14:53,601 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-04 07:14:53,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:14:53,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930873381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:53,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:14:53,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-03-04 07:14:53,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659901763] [2025-03-04 07:14:53,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:53,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:14:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:53,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:14:53,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:14:53,606 INFO L87 Difference]: Start difference. First operand 567 states and 792 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 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-04 07:14:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:54,559 INFO L93 Difference]: Finished difference Result 822 states and 1145 transitions. [2025-03-04 07:14:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:14:54,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 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 167 [2025-03-04 07:14:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:54,562 INFO L225 Difference]: With dead ends: 822 [2025-03-04 07:14:54,562 INFO L226 Difference]: Without dead ends: 822 [2025-03-04 07:14:54,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:14:54,563 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 544 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:54,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2270 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:14:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-03-04 07:14:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 594. [2025-03-04 07:14:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 588 states have (on average 1.3911564625850341) internal successors, (818), 589 states have internal predecessors, (818), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 824 transitions. [2025-03-04 07:14:54,572 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 824 transitions. Word has length 167 [2025-03-04 07:14:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:54,572 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 824 transitions. [2025-03-04 07:14:54,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 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-04 07:14:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 824 transitions. [2025-03-04 07:14:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 07:14:54,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:54,574 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, 1, 1, 1, 1, 1] [2025-03-04 07:14:54,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:14:54,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:14:54,775 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:54,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash 222825797, now seen corresponding path program 1 times [2025-03-04 07:14:54,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:54,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153642922] [2025-03-04 07:14:54,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:54,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:54,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 07:14:54,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 07:14:54,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:54,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:14:55,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153642922] [2025-03-04 07:14:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153642922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:14:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501243318] [2025-03-04 07:14:55,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:55,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:14:55,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:14:55,093 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:14:55,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:14:55,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 07:14:55,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 07:14:55,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:55,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:55,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:14:55,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:14:55,455 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-04 07:14:55,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:14:55,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501243318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:55,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:14:55,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-03-04 07:14:55,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753222882] [2025-03-04 07:14:55,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:55,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:14:55,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:55,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:14:55,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:14:55,458 INFO L87 Difference]: Start difference. First operand 594 states and 824 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-04 07:14:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:55,770 INFO L93 Difference]: Finished difference Result 634 states and 876 transitions. [2025-03-04 07:14:55,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:14:55,771 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), 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 168 [2025-03-04 07:14:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:55,773 INFO L225 Difference]: With dead ends: 634 [2025-03-04 07:14:55,773 INFO L226 Difference]: Without dead ends: 634 [2025-03-04 07:14:55,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:14:55,773 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 34 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:55,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1923 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:14:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-04 07:14:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 620. [2025-03-04 07:14:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 614 states have (on average 1.3843648208469055) internal successors, (850), 615 states have internal predecessors, (850), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 856 transitions. [2025-03-04 07:14:55,783 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 856 transitions. Word has length 168 [2025-03-04 07:14:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:55,783 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 856 transitions. [2025-03-04 07:14:55,783 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), 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-04 07:14:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 856 transitions. [2025-03-04 07:14:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 07:14:55,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:55,785 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, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:55,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:14:55,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 07:14:55,985 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:55,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:55,986 INFO L85 PathProgramCache]: Analyzing trace with hash -851166416, now seen corresponding path program 1 times [2025-03-04 07:14:55,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:55,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401772425] [2025-03-04 07:14:55,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:55,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:56,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 07:14:56,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 07:14:56,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:56,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:56,246 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-04 07:14:56,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:56,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401772425] [2025-03-04 07:14:56,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401772425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:56,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:56,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:14:56,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622609828] [2025-03-04 07:14:56,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:56,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:14:56,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:56,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:14:56,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:14:56,248 INFO L87 Difference]: Start difference. First operand 620 states and 856 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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-04 07:14:56,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:56,624 INFO L93 Difference]: Finished difference Result 626 states and 863 transitions. [2025-03-04 07:14:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:14:56,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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 169 [2025-03-04 07:14:56,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:56,627 INFO L225 Difference]: With dead ends: 626 [2025-03-04 07:14:56,627 INFO L226 Difference]: Without dead ends: 626 [2025-03-04 07:14:56,627 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-04 07:14:56,628 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 8 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:56,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1818 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:14:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-04 07:14:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2025-03-04 07:14:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 618 states have (on average 1.383495145631068) internal successors, (855), 619 states have internal predecessors, (855), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 861 transitions. [2025-03-04 07:14:56,638 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 861 transitions. Word has length 169 [2025-03-04 07:14:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:56,638 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 861 transitions. [2025-03-04 07:14:56,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 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-04 07:14:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 861 transitions. [2025-03-04 07:14:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 07:14:56,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:56,640 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:56,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:14:56,640 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:56,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:56,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1277802903, now seen corresponding path program 1 times [2025-03-04 07:14:56,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:56,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927403056] [2025-03-04 07:14:56,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:56,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:56,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 07:14:56,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 07:14:56,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:56,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:56,852 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-04 07:14:56,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:56,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927403056] [2025-03-04 07:14:56,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927403056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:56,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:56,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:14:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230422711] [2025-03-04 07:14:56,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:56,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:14:56,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:56,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:14:56,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:14:56,854 INFO L87 Difference]: Start difference. First operand 624 states and 861 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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-04 07:14:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:57,320 INFO L93 Difference]: Finished difference Result 635 states and 876 transitions. [2025-03-04 07:14:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:14:57,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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 170 [2025-03-04 07:14:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:57,322 INFO L225 Difference]: With dead ends: 635 [2025-03-04 07:14:57,322 INFO L226 Difference]: Without dead ends: 635 [2025-03-04 07:14:57,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:14:57,323 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 12 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:57,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2153 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:14:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-04 07:14:57,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2025-03-04 07:14:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 626 states have (on average 1.3833865814696487) internal successors, (866), 627 states have internal predecessors, (866), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 872 transitions. [2025-03-04 07:14:57,330 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 872 transitions. Word has length 170 [2025-03-04 07:14:57,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:57,330 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 872 transitions. [2025-03-04 07:14:57,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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-04 07:14:57,330 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 872 transitions. [2025-03-04 07:14:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 07:14:57,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:57,332 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:57,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:14:57,332 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:57,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:57,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1951838807, now seen corresponding path program 1 times [2025-03-04 07:14:57,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:57,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771437141] [2025-03-04 07:14:57,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:57,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:57,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 07:14:57,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 07:14:57,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:57,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:14:57,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771437141] [2025-03-04 07:14:57,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771437141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:14:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079474830] [2025-03-04 07:14:57,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:57,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:14:57,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:14:57,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:14:57,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:14:57,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 07:14:57,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 07:14:57,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:57,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:57,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:14:57,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:14:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:14:57,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:14:57,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079474830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:57,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:14:57,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 07:14:57,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823510944] [2025-03-04 07:14:57,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:57,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:14:57,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:57,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:14:57,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:14:57,866 INFO L87 Difference]: Start difference. First operand 632 states and 872 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:14:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:57,948 INFO L93 Difference]: Finished difference Result 635 states and 876 transitions. [2025-03-04 07:14:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:14:57,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 170 [2025-03-04 07:14:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:57,951 INFO L225 Difference]: With dead ends: 635 [2025-03-04 07:14:57,951 INFO L226 Difference]: Without dead ends: 635 [2025-03-04 07:14:57,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:14:57,952 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 0 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:57,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1388 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:14:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-04 07:14:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2025-03-04 07:14:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 628 states have (on average 1.3837579617834395) internal successors, (869), 630 states have internal predecessors, (869), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:14:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 876 transitions. [2025-03-04 07:14:57,960 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 876 transitions. Word has length 170 [2025-03-04 07:14:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:57,960 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 876 transitions. [2025-03-04 07:14:57,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:14:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 876 transitions. [2025-03-04 07:14:57,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 07:14:57,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:57,962 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:57,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:14:58,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 07:14:58,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:58,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1840142821, now seen corresponding path program 1 times [2025-03-04 07:14:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:58,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014990171] [2025-03-04 07:14:58,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:58,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 07:14:58,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 07:14:58,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:58,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:14:58,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:58,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014990171] [2025-03-04 07:14:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014990171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:14:58,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750081655] [2025-03-04 07:14:58,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:58,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:14:58,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:14:58,423 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:14:58,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:14:58,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 07:14:58,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 07:14:58,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:58,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:58,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:14:58,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:15:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:15:03,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:15:03,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750081655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:15:03,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:15:03,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 07:15:03,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032801280] [2025-03-04 07:15:03,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:15:03,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:15:03,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:03,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:15:03,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:15:03,646 INFO L87 Difference]: Start difference. First operand 635 states and 876 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-04 07:15:08,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:15:09,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:15:10,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:10,370 INFO L93 Difference]: Finished difference Result 642 states and 885 transitions. [2025-03-04 07:15:10,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:15:10,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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 172 [2025-03-04 07:15:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:10,375 INFO L225 Difference]: With dead ends: 642 [2025-03-04 07:15:10,375 INFO L226 Difference]: Without dead ends: 642 [2025-03-04 07:15:10,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:15:10,376 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 12 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:10,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2159 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 924 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2025-03-04 07:15:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-04 07:15:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 635. [2025-03-04 07:15:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 628 states have (on average 1.3837579617834395) internal successors, (869), 630 states have internal predecessors, (869), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:15:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 876 transitions. [2025-03-04 07:15:10,387 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 876 transitions. Word has length 172 [2025-03-04 07:15:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:10,387 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 876 transitions. [2025-03-04 07:15:10,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-04 07:15:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 876 transitions. [2025-03-04 07:15:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 07:15:10,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:10,389 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:10,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:15:10,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:15:10,590 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:10,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:10,591 INFO L85 PathProgramCache]: Analyzing trace with hash -9774765, now seen corresponding path program 1 times [2025-03-04 07:15:10,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:10,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295842231] [2025-03-04 07:15:10,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:10,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:10,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 07:15:10,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 07:15:10,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:10,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:15:10,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:10,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295842231] [2025-03-04 07:15:10,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295842231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:15:10,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:15:10,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:15:10,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674648900] [2025-03-04 07:15:10,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:15:10,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:15:10,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:10,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:15:10,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:15:10,863 INFO L87 Difference]: Start difference. First operand 635 states and 876 transitions. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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-04 07:15:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:11,453 INFO L93 Difference]: Finished difference Result 648 states and 892 transitions. [2025-03-04 07:15:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:15:11,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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 173 [2025-03-04 07:15:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:11,455 INFO L225 Difference]: With dead ends: 648 [2025-03-04 07:15:11,455 INFO L226 Difference]: Without dead ends: 648 [2025-03-04 07:15:11,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:15:11,456 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 20 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:11,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2944 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:15:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-04 07:15:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 642. [2025-03-04 07:15:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 635 states have (on average 1.3826771653543306) internal successors, (878), 637 states have internal predecessors, (878), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:15:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 885 transitions. [2025-03-04 07:15:11,463 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 885 transitions. Word has length 173 [2025-03-04 07:15:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:11,463 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 885 transitions. [2025-03-04 07:15:11,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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-04 07:15:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 885 transitions. [2025-03-04 07:15:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 07:15:11,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:11,465 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:11,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:15:11,465 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:11,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:11,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1324870437, now seen corresponding path program 1 times [2025-03-04 07:15:11,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:11,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838045703] [2025-03-04 07:15:11,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:11,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:11,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 07:15:11,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 07:15:11,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:11,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:15:11,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:11,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838045703] [2025-03-04 07:15:11,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838045703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:15:11,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701939604] [2025-03-04 07:15:11,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:11,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:15:11,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:15:11,717 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:15:11,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:15:11,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 07:15:12,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 07:15:12,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:12,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:12,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:15:12,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:15:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:15:12,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:15:12,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701939604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:15:12,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:15:12,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-03-04 07:15:12,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216975603] [2025-03-04 07:15:12,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:15:12,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:15:12,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:12,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:15:12,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:15:12,154 INFO L87 Difference]: Start difference. First operand 642 states and 885 transitions. Second operand has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 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-04 07:15:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:12,617 INFO L93 Difference]: Finished difference Result 659 states and 906 transitions. [2025-03-04 07:15:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:15:12,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 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 173 [2025-03-04 07:15:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:12,619 INFO L225 Difference]: With dead ends: 659 [2025-03-04 07:15:12,619 INFO L226 Difference]: Without dead ends: 659 [2025-03-04 07:15:12,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:15:12,620 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 40 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:12,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2278 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:15:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-04 07:15:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 647. [2025-03-04 07:15:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 640 states have (on average 1.38125) internal successors, (884), 642 states have internal predecessors, (884), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:15:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 891 transitions. [2025-03-04 07:15:12,627 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 891 transitions. Word has length 173 [2025-03-04 07:15:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:12,628 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 891 transitions. [2025-03-04 07:15:12,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 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-04 07:15:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 891 transitions. [2025-03-04 07:15:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 07:15:12,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:12,631 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:12,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:15:12,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:15:12,832 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:12,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1492338956, now seen corresponding path program 1 times [2025-03-04 07:15:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:12,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719192708] [2025-03-04 07:15:12,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:12,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:12,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 07:15:12,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 07:15:12,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:12,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:15:13,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:13,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719192708] [2025-03-04 07:15:13,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719192708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:15:13,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:15:13,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:15:13,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176857663] [2025-03-04 07:15:13,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:15:13,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:15:13,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:13,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:15:13,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:15:13,147 INFO L87 Difference]: Start difference. First operand 647 states and 891 transitions. Second operand has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 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-04 07:15:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:13,732 INFO L93 Difference]: Finished difference Result 656 states and 903 transitions. [2025-03-04 07:15:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:15:13,732 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 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 174 [2025-03-04 07:15:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:13,734 INFO L225 Difference]: With dead ends: 656 [2025-03-04 07:15:13,734 INFO L226 Difference]: Without dead ends: 656 [2025-03-04 07:15:13,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:15:13,735 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 26 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:13,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2896 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:15:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-04 07:15:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 650. [2025-03-04 07:15:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 643 states have (on average 1.3794712286158632) internal successors, (887), 645 states have internal predecessors, (887), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:15:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 894 transitions. [2025-03-04 07:15:13,742 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 894 transitions. Word has length 174 [2025-03-04 07:15:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:13,742 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 894 transitions. [2025-03-04 07:15:13,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 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-04 07:15:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 894 transitions. [2025-03-04 07:15:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 07:15:13,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:13,743 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:13,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:15:13,744 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:13,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1226956642, now seen corresponding path program 1 times [2025-03-04 07:15:13,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:13,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62942919] [2025-03-04 07:15:13,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:13,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:13,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 07:15:13,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 07:15:13,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:13,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:15:14,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:14,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62942919] [2025-03-04 07:15:14,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62942919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:15:14,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359435116] [2025-03-04 07:15:14,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:14,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:15:14,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:15:14,034 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:15:14,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:15:14,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 07:15:14,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 07:15:14,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:14,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:14,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:15:14,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:15:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:15:14,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:15:14,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359435116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:15:14,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:15:14,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 07:15:14,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121644202] [2025-03-04 07:15:14,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:15:14,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:15:14,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:14,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:15:14,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:15:14,589 INFO L87 Difference]: Start difference. First operand 650 states and 894 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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-04 07:15:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:15,189 INFO L93 Difference]: Finished difference Result 664 states and 912 transitions. [2025-03-04 07:15:15,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:15:15,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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 174 [2025-03-04 07:15:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:15,191 INFO L225 Difference]: With dead ends: 664 [2025-03-04 07:15:15,191 INFO L226 Difference]: Without dead ends: 664 [2025-03-04 07:15:15,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:15:15,192 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 12 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:15,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2159 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:15:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-04 07:15:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 650. [2025-03-04 07:15:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 643 states have (on average 1.3794712286158632) internal successors, (887), 645 states have internal predecessors, (887), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:15:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 894 transitions. [2025-03-04 07:15:15,198 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 894 transitions. Word has length 174 [2025-03-04 07:15:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:15,198 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 894 transitions. [2025-03-04 07:15:15,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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-04 07:15:15,199 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 894 transitions. [2025-03-04 07:15:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 07:15:15,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:15,200 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:15,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:15:15,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:15:15,400 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:15,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash 116337206, now seen corresponding path program 1 times [2025-03-04 07:15:15,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:15,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225685501] [2025-03-04 07:15:15,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:15,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:15,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 07:15:15,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 07:15:15,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:15,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:15:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225685501] [2025-03-04 07:15:15,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225685501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:15:15,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:15:15,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:15:15,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234530904] [2025-03-04 07:15:15,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:15:15,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:15:15,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:15,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:15:15,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:15:15,647 INFO L87 Difference]: Start difference. First operand 650 states and 894 transitions. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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-04 07:15:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:16,154 INFO L93 Difference]: Finished difference Result 676 states and 926 transitions. [2025-03-04 07:15:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:15:16,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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 175 [2025-03-04 07:15:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:16,156 INFO L225 Difference]: With dead ends: 676 [2025-03-04 07:15:16,156 INFO L226 Difference]: Without dead ends: 676 [2025-03-04 07:15:16,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:15:16,157 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 20 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:16,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2944 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:15:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-04 07:15:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 664. [2025-03-04 07:15:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 657 states have (on average 1.3774733637747336) internal successors, (905), 659 states have internal predecessors, (905), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:15:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 912 transitions. [2025-03-04 07:15:16,164 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 912 transitions. Word has length 175 [2025-03-04 07:15:16,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:16,164 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 912 transitions. [2025-03-04 07:15:16,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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-04 07:15:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 912 transitions. [2025-03-04 07:15:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 07:15:16,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:16,166 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:16,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 07:15:16,166 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:16,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:16,166 INFO L85 PathProgramCache]: Analyzing trace with hash 511903797, now seen corresponding path program 1 times [2025-03-04 07:15:16,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:16,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823002204] [2025-03-04 07:15:16,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:16,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 07:15:16,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 07:15:16,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:16,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:15:16,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:16,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823002204] [2025-03-04 07:15:16,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823002204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:15:16,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780912333] [2025-03-04 07:15:16,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:16,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:15:16,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:15:16,454 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:15:16,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:15:16,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 07:15:16,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 07:15:16,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:16,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:16,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:15:16,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:15:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:15:16,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:15:16,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780912333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:15:16,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:15:16,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 07:15:16,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474507980] [2025-03-04 07:15:16,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:15:16,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:15:16,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:16,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:15:16,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:15:16,861 INFO L87 Difference]: Start difference. First operand 664 states and 912 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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-04 07:15:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:17,259 INFO L93 Difference]: Finished difference Result 688 states and 948 transitions. [2025-03-04 07:15:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:15:17,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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 175 [2025-03-04 07:15:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:17,261 INFO L225 Difference]: With dead ends: 688 [2025-03-04 07:15:17,261 INFO L226 Difference]: Without dead ends: 688 [2025-03-04 07:15:17,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:15:17,261 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 17 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:17,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2182 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:15:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-04 07:15:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 678. [2025-03-04 07:15:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 671 states have (on average 1.3785394932935917) internal successors, (925), 673 states have internal predecessors, (925), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:15:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 932 transitions. [2025-03-04 07:15:17,270 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 932 transitions. Word has length 175 [2025-03-04 07:15:17,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:17,270 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 932 transitions. [2025-03-04 07:15:17,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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-04 07:15:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 932 transitions. [2025-03-04 07:15:17,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 07:15:17,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:17,271 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:17,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:15:17,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 07:15:17,476 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:17,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash -726297414, now seen corresponding path program 1 times [2025-03-04 07:15:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:17,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736497298] [2025-03-04 07:15:17,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:17,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:15:17,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:15:17,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:17,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:15:17,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:17,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736497298] [2025-03-04 07:15:17,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736497298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:15:17,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:15:17,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:15:17,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194482841] [2025-03-04 07:15:17,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:15:17,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:15:17,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:17,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:15:17,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:15:17,789 INFO L87 Difference]: Start difference. First operand 678 states and 932 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 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-04 07:15:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:18,292 INFO L93 Difference]: Finished difference Result 696 states and 956 transitions. [2025-03-04 07:15:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:15:18,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 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 176 [2025-03-04 07:15:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:18,294 INFO L225 Difference]: With dead ends: 696 [2025-03-04 07:15:18,294 INFO L226 Difference]: Without dead ends: 696 [2025-03-04 07:15:18,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:15:18,295 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 26 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:18,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2583 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:15:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-04 07:15:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 684. [2025-03-04 07:15:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 677 states have (on average 1.3751846381093058) internal successors, (931), 679 states have internal predecessors, (931), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:15:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 938 transitions. [2025-03-04 07:15:18,301 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 938 transitions. Word has length 176 [2025-03-04 07:15:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:18,301 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 938 transitions. [2025-03-04 07:15:18,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 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-04 07:15:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 938 transitions. [2025-03-04 07:15:18,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 07:15:18,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:18,303 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:18,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 07:15:18,303 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:18,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:18,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1472256641, now seen corresponding path program 1 times [2025-03-04 07:15:18,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:18,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601938876] [2025-03-04 07:15:18,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:18,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:18,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:15:18,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:15:18,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:18,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:15:18,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:18,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601938876] [2025-03-04 07:15:18,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601938876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:15:18,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296161886] [2025-03-04 07:15:18,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:18,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:15:18,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:15:18,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:15:18,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:15:18,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:15:18,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:15:18,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:18,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:18,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 07:15:18,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:15:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:15:19,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:15:19,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296161886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:15:19,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:15:19,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-03-04 07:15:19,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676278454] [2025-03-04 07:15:19,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:15:19,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:15:19,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:19,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:15:19,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:15:19,152 INFO L87 Difference]: Start difference. First operand 684 states and 938 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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-04 07:15:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:20,074 INFO L93 Difference]: Finished difference Result 696 states and 954 transitions. [2025-03-04 07:15:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:15:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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 176 [2025-03-04 07:15:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:20,081 INFO L225 Difference]: With dead ends: 696 [2025-03-04 07:15:20,081 INFO L226 Difference]: Without dead ends: 696 [2025-03-04 07:15:20,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:15:20,082 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 17 mSDsluCounter, 2787 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3243 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:20,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3243 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 07:15:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-04 07:15:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 691. [2025-03-04 07:15:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 684 states have (on average 1.3742690058479532) internal successors, (940), 686 states have internal predecessors, (940), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:15:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 947 transitions. [2025-03-04 07:15:20,087 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 947 transitions. Word has length 176 [2025-03-04 07:15:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:20,088 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 947 transitions. [2025-03-04 07:15:20,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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-04 07:15:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 947 transitions. [2025-03-04 07:15:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 07:15:20,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:20,089 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:20,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 07:15:20,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 07:15:20,290 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:20,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:20,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1954739935, now seen corresponding path program 1 times [2025-03-04 07:15:20,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:20,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878649402] [2025-03-04 07:15:20,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:20,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:20,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:15:20,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:15:20,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:20,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:15:20,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:20,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878649402] [2025-03-04 07:15:20,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878649402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:15:20,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145572579] [2025-03-04 07:15:20,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:20,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:15:20,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:15:20,619 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:15:20,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:15:20,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:15:21,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:15:21,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:21,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:21,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:15:21,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:15:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:15:21,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:15:21,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145572579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:15:21,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:15:21,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 07:15:21,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778700113] [2025-03-04 07:15:21,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:15:21,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:15:21,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:21,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:15:21,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:15:21,076 INFO L87 Difference]: Start difference. First operand 691 states and 947 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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-04 07:15:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:21,470 INFO L93 Difference]: Finished difference Result 707 states and 969 transitions. [2025-03-04 07:15:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:15:21,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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 176 [2025-03-04 07:15:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:21,472 INFO L225 Difference]: With dead ends: 707 [2025-03-04 07:15:21,472 INFO L226 Difference]: Without dead ends: 707 [2025-03-04 07:15:21,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:15:21,472 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 39 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:21,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2231 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:15:21,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-04 07:15:21,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 698. [2025-03-04 07:15:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 691 states have (on average 1.3748191027496381) internal successors, (950), 693 states have internal predecessors, (950), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:15:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 957 transitions. [2025-03-04 07:15:21,478 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 957 transitions. Word has length 176 [2025-03-04 07:15:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:21,478 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 957 transitions. [2025-03-04 07:15:21,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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-04 07:15:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 957 transitions. [2025-03-04 07:15:21,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 07:15:21,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:21,479 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:21,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:15:21,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 07:15:21,680 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:21,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash -792307173, now seen corresponding path program 1 times [2025-03-04 07:15:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:21,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710807986] [2025-03-04 07:15:21,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:21,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:15:21,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:15:21,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:21,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:15:21,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:21,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710807986] [2025-03-04 07:15:21,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710807986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:15:21,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829661392] [2025-03-04 07:15:21,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:21,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:15:21,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:15:21,922 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:15:21,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:15:22,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:15:22,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:15:22,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:22,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:22,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:15:22,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:15:22,371 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-04 07:15:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:15:22,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:15:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:15:22,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829661392] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:15:22,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:15:22,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 12 [2025-03-04 07:15:22,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741401740] [2025-03-04 07:15:22,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:15:22,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:15:22,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:22,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:15:22,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:15:22,548 INFO L87 Difference]: Start difference. First operand 698 states and 957 transitions. Second operand has 12 states, 12 states have (on average 20.416666666666668) internal successors, (245), 11 states have internal predecessors, (245), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:15:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:22,867 INFO L93 Difference]: Finished difference Result 963 states and 1325 transitions. [2025-03-04 07:15:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:15:22,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.416666666666668) internal successors, (245), 11 states have internal predecessors, (245), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) Word has length 176 [2025-03-04 07:15:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:22,870 INFO L225 Difference]: With dead ends: 963 [2025-03-04 07:15:22,870 INFO L226 Difference]: Without dead ends: 963 [2025-03-04 07:15:22,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:15:22,871 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 868 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:22,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 2396 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:15:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-04 07:15:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 726. [2025-03-04 07:15:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 716 states have (on average 1.3784916201117319) internal successors, (987), 719 states have internal predecessors, (987), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:15:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 996 transitions. [2025-03-04 07:15:22,883 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 996 transitions. Word has length 176 [2025-03-04 07:15:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:22,883 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 996 transitions. [2025-03-04 07:15:22,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.416666666666668) internal successors, (245), 11 states have internal predecessors, (245), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:15:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 996 transitions. [2025-03-04 07:15:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 07:15:22,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:22,884 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:22,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:15:23,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 07:15:23,085 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:23,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash -794500969, now seen corresponding path program 2 times [2025-03-04 07:15:23,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:23,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588981163] [2025-03-04 07:15:23,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:15:23,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:23,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-04 07:15:23,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 180 statements. [2025-03-04 07:15:23,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:15:23,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 07:15:23,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:23,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588981163] [2025-03-04 07:15:23,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588981163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:15:23,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:15:23,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:15:23,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431736347] [2025-03-04 07:15:23,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:15:23,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:15:23,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:23,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:15:23,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:15:23,240 INFO L87 Difference]: Start difference. First operand 726 states and 996 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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-04 07:15:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:23,626 INFO L93 Difference]: Finished difference Result 729 states and 999 transitions. [2025-03-04 07:15:23,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:15:23,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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 180 [2025-03-04 07:15:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:23,629 INFO L225 Difference]: With dead ends: 729 [2025-03-04 07:15:23,629 INFO L226 Difference]: Without dead ends: 729 [2025-03-04 07:15:23,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:15:23,629 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 8 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:23,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1838 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:15:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-04 07:15:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2025-03-04 07:15:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 719 states have (on average 1.376912378303199) internal successors, (990), 722 states have internal predecessors, (990), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:15:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 999 transitions. [2025-03-04 07:15:23,635 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 999 transitions. Word has length 180 [2025-03-04 07:15:23,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:23,636 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 999 transitions. [2025-03-04 07:15:23,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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-04 07:15:23,636 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 999 transitions. [2025-03-04 07:15:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 07:15:23,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:23,637 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:23,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 07:15:23,637 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:23,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:23,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1187594950, now seen corresponding path program 1 times [2025-03-04 07:15:23,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:23,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069691366] [2025-03-04 07:15:23,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:23,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:23,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 07:15:23,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 07:15:23,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:23,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:15:24,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:24,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069691366] [2025-03-04 07:15:24,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069691366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:15:24,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207515208] [2025-03-04 07:15:24,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:24,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:15:24,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:15:24,049 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:15:24,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:15:24,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 07:15:24,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 07:15:24,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:24,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:24,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:15:24,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:15:24,529 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-04 07:15:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:15:24,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:15:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:15:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207515208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:15:25,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:15:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 9] total 26 [2025-03-04 07:15:25,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498729936] [2025-03-04 07:15:25,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:15:25,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:15:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:25,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:15:25,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:15:25,211 INFO L87 Difference]: Start difference. First operand 729 states and 999 transitions. Second operand has 26 states, 26 states have (on average 10.76923076923077) internal successors, (280), 26 states have internal predecessors, (280), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:15:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:26,187 INFO L93 Difference]: Finished difference Result 909 states and 1242 transitions. [2025-03-04 07:15:26,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 07:15:26,188 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.76923076923077) internal successors, (280), 26 states have internal predecessors, (280), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 181 [2025-03-04 07:15:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:26,190 INFO L225 Difference]: With dead ends: 909 [2025-03-04 07:15:26,190 INFO L226 Difference]: Without dead ends: 905 [2025-03-04 07:15:26,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 342 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:15:26,191 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 1074 mSDsluCounter, 6216 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 6696 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:26,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 6696 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:15:26,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-03-04 07:15:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 652. [2025-03-04 07:15:26,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 642 states have (on average 1.3644859813084111) internal successors, (876), 645 states have internal predecessors, (876), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:15:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 885 transitions. [2025-03-04 07:15:26,197 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 885 transitions. Word has length 181 [2025-03-04 07:15:26,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:26,197 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 885 transitions. [2025-03-04 07:15:26,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.76923076923077) internal successors, (280), 26 states have internal predecessors, (280), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:15:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 885 transitions. [2025-03-04 07:15:26,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 07:15:26,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:26,198 INFO L218 NwaCegarLoop]: trace histogram [13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:26,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 07:15:26,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:15:26,399 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:26,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:26,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1511739094, now seen corresponding path program 2 times [2025-03-04 07:15:26,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078504610] [2025-03-04 07:15:26,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:15:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:26,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-04 07:15:26,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 81 of 188 statements. [2025-03-04 07:15:26,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:15:26,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-04 07:15:26,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:26,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078504610] [2025-03-04 07:15:26,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078504610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:15:26,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:15:26,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 07:15:26,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857823502] [2025-03-04 07:15:26,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:15:26,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:15:26,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:15:26,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:15:26,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:15:26,655 INFO L87 Difference]: Start difference. First operand 652 states and 885 transitions. Second operand has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 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-04 07:15:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:15:27,702 INFO L93 Difference]: Finished difference Result 709 states and 969 transitions. [2025-03-04 07:15:27,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:15:27,703 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 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 188 [2025-03-04 07:15:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:15:27,704 INFO L225 Difference]: With dead ends: 709 [2025-03-04 07:15:27,704 INFO L226 Difference]: Without dead ends: 709 [2025-03-04 07:15:27,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:15:27,705 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 89 mSDsluCounter, 3126 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 3588 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:15:27,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 3588 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 07:15:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-04 07:15:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 656. [2025-03-04 07:15:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 646 states have (on average 1.3637770897832817) internal successors, (881), 649 states have internal predecessors, (881), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:15:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 890 transitions. [2025-03-04 07:15:27,711 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 890 transitions. Word has length 188 [2025-03-04 07:15:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:15:27,711 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 890 transitions. [2025-03-04 07:15:27,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 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-04 07:15:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 890 transitions. [2025-03-04 07:15:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 07:15:27,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:15:27,712 INFO L218 NwaCegarLoop]: trace histogram [13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:15:27,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 07:15:27,712 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:15:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:15:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash -89443288, now seen corresponding path program 1 times [2025-03-04 07:15:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:15:27,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732759478] [2025-03-04 07:15:27,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:27,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:15:27,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 07:15:27,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 07:15:27,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:27,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 07:15:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:15:28,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732759478] [2025-03-04 07:15:28,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732759478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:15:28,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630733459] [2025-03-04 07:15:28,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:15:28,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:15:28,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:15:28,183 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:15:28,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:15:28,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 07:15:29,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 07:15:29,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:15:29,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:15:29,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 158 conjuncts are in the unsatisfiable core [2025-03-04 07:15:29,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:15:29,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:15:29,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:15:29,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:15:29,325 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 07:15:29,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-04 07:15:29,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 07:15:29,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:15:29,570 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:15:29,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 07:15:29,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11