./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:06:27,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:06:27,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 06:06:27,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:06:27,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:06:27,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:06:27,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:06:27,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:06:27,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:06:27,148 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:06:27,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:06:27,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:06:27,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:06:27,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:06:27,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 06:06:27,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:06:27,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:06:27,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:06:27,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:06:27,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:06:27,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:06:27,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:06:27,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:06:27,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:06:27,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:06:27,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:06:27,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:06:27,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:06:27,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:06:27,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:06:27,153 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-jdk21/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 -> e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 [2025-02-08 06:06:27,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:06:27,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:06:27,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:06:27,405 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:06:27,406 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:06:27,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2025-02-08 06:06:28,608 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a6f1f2c7/f4461804cc9e431997bdd91a26ef77cb/FLAG2d848bf02 [2025-02-08 06:06:29,114 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:06:29,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2025-02-08 06:06:29,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a6f1f2c7/f4461804cc9e431997bdd91a26ef77cb/FLAG2d848bf02 [2025-02-08 06:06:29,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a6f1f2c7/f4461804cc9e431997bdd91a26ef77cb [2025-02-08 06:06:29,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:06:29,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:06:29,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:06:29,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:06:29,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:06:29,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:06:29" (1/1) ... [2025-02-08 06:06:29,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff09b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:29, skipping insertion in model container [2025-02-08 06:06:29,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:06:29" (1/1) ... [2025-02-08 06:06:29,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:06:29,875 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:06:29,901 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:06:29,906 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:06:29,910 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:06:29,914 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:06:29,947 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:06:29,947 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:06:29,949 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:06:29,949 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:06:29,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:06:29,968 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:06:30,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:06:30,121 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:06:30,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30 WrapperNode [2025-02-08 06:06:30,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:06:30,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:06:30,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:06:30,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:06:30,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (1/1) ... [2025-02-08 06:06:30,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (1/1) ... [2025-02-08 06:06:30,275 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3244 [2025-02-08 06:06:30,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:06:30,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:06:30,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:06:30,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:06:30,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (1/1) ... [2025-02-08 06:06:30,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (1/1) ... [2025-02-08 06:06:30,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (1/1) ... [2025-02-08 06:06:30,355 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-02-08 06:06:30,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (1/1) ... [2025-02-08 06:06:30,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (1/1) ... [2025-02-08 06:06:30,421 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (1/1) ... [2025-02-08 06:06:30,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (1/1) ... [2025-02-08 06:06:30,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (1/1) ... [2025-02-08 06:06:30,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (1/1) ... [2025-02-08 06:06:30,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:06:30,476 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:06:30,476 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:06:30,477 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:06:30,477 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (1/1) ... [2025-02-08 06:06:30,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:06:30,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:06:30,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:06:30,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:06:30,542 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 06:06:30,543 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 06:06:30,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:06:30,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:06:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:06:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 06:06:30,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 06:06:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:06:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:06:30,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:06:30,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 06:06:30,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 06:06:30,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 06:06:30,545 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 06:06:30,545 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 06:06:30,545 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 06:06:30,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:06:30,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:06:30,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:06:30,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:06:30,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:06:30,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:06:30,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:06:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:06:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:06:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:06:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:06:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:06:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:06:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:06:30,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:06:30,741 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:06:30,743 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:06:32,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 06:06:33,066 INFO L? ?]: Removed 798 outVars from TransFormulas that were not future-live. [2025-02-08 06:06:33,066 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:06:33,155 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:06:33,155 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 06:06:33,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:06:33 BoogieIcfgContainer [2025-02-08 06:06:33,156 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:06:33,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:06:33,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:06:33,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:06:33,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:06:29" (1/3) ... [2025-02-08 06:06:33,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c528c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:06:33, skipping insertion in model container [2025-02-08 06:06:33,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:06:30" (2/3) ... [2025-02-08 06:06:33,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c528c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:06:33, skipping insertion in model container [2025-02-08 06:06:33,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:06:33" (3/3) ... [2025-02-08 06:06:33,173 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-1.i [2025-02-08 06:06:33,190 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:06:33,191 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test9-1.i that has 6 procedures, 1378 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-02-08 06:06:33,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:06:33,282 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;@5e431014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:06:33,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 06:06:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 1370 states, 858 states have (on average 1.8403263403263403) internal successors, (1579), 1362 states have internal predecessors, (1579), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-02-08 06:06:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:06:33,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:33,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:06:33,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:33,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash 949030012, now seen corresponding path program 1 times [2025-02-08 06:06:33,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:33,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977877026] [2025-02-08 06:06:33,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:33,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:06:33,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:06:33,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:33,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:06:33,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:33,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977877026] [2025-02-08 06:06:33,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977877026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:06:33,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:06:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:06:33,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637389338] [2025-02-08 06:06:33,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:06:33,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 06:06:33,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:33,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 06:06:33,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 06:06:33,511 INFO L87 Difference]: Start difference. First operand has 1370 states, 858 states have (on average 1.8403263403263403) internal successors, (1579), 1362 states have internal predecessors, (1579), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:06:33,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:33,681 INFO L93 Difference]: Finished difference Result 1368 states and 2530 transitions. [2025-02-08 06:06:33,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 06:06:33,684 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 06:06:33,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:33,700 INFO L225 Difference]: With dead ends: 1368 [2025-02-08 06:06:33,700 INFO L226 Difference]: Without dead ends: 1363 [2025-02-08 06:06:33,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 06:06:33,703 INFO L435 NwaCegarLoop]: 2489 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:33,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2489 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:06:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-02-08 06:06:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2025-02-08 06:06:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 855 states have (on average 1.775438596491228) internal successors, (1518), 1356 states have internal predecessors, (1518), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:06:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2026 transitions. [2025-02-08 06:06:33,775 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2026 transitions. Word has length 6 [2025-02-08 06:06:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:33,775 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 2026 transitions. [2025-02-08 06:06:33,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:06:33,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2026 transitions. [2025-02-08 06:06:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:06:33,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:33,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:06:33,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:06:33,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:33,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:33,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1642390446, now seen corresponding path program 1 times [2025-02-08 06:06:33,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:33,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382447262] [2025-02-08 06:06:33,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:33,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:33,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:06:33,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:06:33,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:33,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:06:33,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:33,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382447262] [2025-02-08 06:06:33,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382447262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:06:33,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:06:33,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:06:33,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645476705] [2025-02-08 06:06:33,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:06:33,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:06:33,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:33,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:06:33,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:06:33,968 INFO L87 Difference]: Start difference. First operand 1363 states and 2026 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:06:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:34,740 INFO L93 Difference]: Finished difference Result 2712 states and 4039 transitions. [2025-02-08 06:06:34,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:06:34,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 06:06:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:34,754 INFO L225 Difference]: With dead ends: 2712 [2025-02-08 06:06:34,756 INFO L226 Difference]: Without dead ends: 2712 [2025-02-08 06:06:34,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:06:34,758 INFO L435 NwaCegarLoop]: 2004 mSDtfsCounter, 1503 mSDsluCounter, 3462 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 5466 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:34,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 5466 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 06:06:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2025-02-08 06:06:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 1365. [2025-02-08 06:06:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 857 states have (on average 1.7736289381563595) internal successors, (1520), 1358 states have internal predecessors, (1520), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:06:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2028 transitions. [2025-02-08 06:06:34,827 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2028 transitions. Word has length 8 [2025-02-08 06:06:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:34,827 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2028 transitions. [2025-02-08 06:06:34,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:06:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2028 transitions. [2025-02-08 06:06:34,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 06:06:34,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:34,830 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:06:34,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:06:34,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:34,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1401442470, now seen corresponding path program 1 times [2025-02-08 06:06:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363623755] [2025-02-08 06:06:34,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:34,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 06:06:34,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 06:06:34,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:34,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:06:35,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:35,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363623755] [2025-02-08 06:06:35,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363623755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:06:35,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:06:35,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:06:35,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061216555] [2025-02-08 06:06:35,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:06:35,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:06:35,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:35,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:06:35,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:06:35,267 INFO L87 Difference]: Start difference. First operand 1365 states and 2028 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:06:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:35,424 INFO L93 Difference]: Finished difference Result 1323 states and 1951 transitions. [2025-02-08 06:06:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:06:35,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 06:06:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:35,429 INFO L225 Difference]: With dead ends: 1323 [2025-02-08 06:06:35,429 INFO L226 Difference]: Without dead ends: 1323 [2025-02-08 06:06:35,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:06:35,430 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 33 mSDsluCounter, 3766 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 5657 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:35,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 5657 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:06:35,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-02-08 06:06:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1323. [2025-02-08 06:06:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 815 states have (on average 1.7705521472392638) internal successors, (1443), 1316 states have internal predecessors, (1443), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:06:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1951 transitions. [2025-02-08 06:06:35,461 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1951 transitions. Word has length 83 [2025-02-08 06:06:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:35,461 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 1951 transitions. [2025-02-08 06:06:35,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:06:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1951 transitions. [2025-02-08 06:06:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 06:06:35,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:35,464 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:06:35,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:06:35,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:35,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:35,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1230862479, now seen corresponding path program 1 times [2025-02-08 06:06:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:35,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241293465] [2025-02-08 06:06:35,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:35,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:35,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 06:06:35,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 06:06:35,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:35,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:06:35,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:35,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241293465] [2025-02-08 06:06:35,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241293465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:06:35,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:06:35,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:06:35,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139483440] [2025-02-08 06:06:35,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:06:35,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:06:35,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:35,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:06:35,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:06:35,614 INFO L87 Difference]: Start difference. First operand 1323 states and 1951 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:06:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:35,728 INFO L93 Difference]: Finished difference Result 1323 states and 1948 transitions. [2025-02-08 06:06:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:06:35,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 06:06:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:35,735 INFO L225 Difference]: With dead ends: 1323 [2025-02-08 06:06:35,735 INFO L226 Difference]: Without dead ends: 1323 [2025-02-08 06:06:35,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:06:35,738 INFO L435 NwaCegarLoop]: 1905 mSDtfsCounter, 2 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:35,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3788 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:06:35,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-02-08 06:06:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1323. [2025-02-08 06:06:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 815 states have (on average 1.7668711656441718) internal successors, (1440), 1316 states have internal predecessors, (1440), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:06:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1948 transitions. [2025-02-08 06:06:35,777 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1948 transitions. Word has length 83 [2025-02-08 06:06:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:35,778 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 1948 transitions. [2025-02-08 06:06:35,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:06:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1948 transitions. [2025-02-08 06:06:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 06:06:35,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:35,782 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:06:35,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:06:35,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:35,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:35,783 INFO L85 PathProgramCache]: Analyzing trace with hash 241409748, now seen corresponding path program 1 times [2025-02-08 06:06:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:35,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910460069] [2025-02-08 06:06:35,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:35,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:35,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 06:06:35,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 06:06:35,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:35,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:06:35,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:35,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910460069] [2025-02-08 06:06:35,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910460069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:06:35,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:06:35,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:06:35,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102664710] [2025-02-08 06:06:35,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:06:35,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:06:35,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:35,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:06:35,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:06:35,937 INFO L87 Difference]: Start difference. First operand 1323 states and 1948 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:06:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:36,099 INFO L93 Difference]: Finished difference Result 2546 states and 3766 transitions. [2025-02-08 06:06:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:06:36,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 06:06:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:36,113 INFO L225 Difference]: With dead ends: 2546 [2025-02-08 06:06:36,113 INFO L226 Difference]: Without dead ends: 2546 [2025-02-08 06:06:36,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:06:36,114 INFO L435 NwaCegarLoop]: 2088 mSDtfsCounter, 1260 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 3985 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:36,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 3985 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:06:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2025-02-08 06:06:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2042. [2025-02-08 06:06:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1534 states have (on average 1.7959582790091264) internal successors, (2755), 2035 states have internal predecessors, (2755), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:06:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 3263 transitions. [2025-02-08 06:06:36,161 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 3263 transitions. Word has length 83 [2025-02-08 06:06:36,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:36,162 INFO L471 AbstractCegarLoop]: Abstraction has 2042 states and 3263 transitions. [2025-02-08 06:06:36,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:06:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 3263 transitions. [2025-02-08 06:06:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 06:06:36,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:36,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:06:36,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:06:36,164 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:36,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash -356596514, now seen corresponding path program 1 times [2025-02-08 06:06:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:36,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955197533] [2025-02-08 06:06:36,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:36,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 06:06:36,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 06:06:36,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:36,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 06:06:36,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:36,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955197533] [2025-02-08 06:06:36,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955197533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:06:36,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:06:36,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:06:36,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353442604] [2025-02-08 06:06:36,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:06:36,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:06:36,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:36,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:06:36,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:06:36,505 INFO L87 Difference]: Start difference. First operand 2042 states and 3263 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:06:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:37,241 INFO L93 Difference]: Finished difference Result 3763 states and 6081 transitions. [2025-02-08 06:06:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:06:37,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2025-02-08 06:06:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:37,259 INFO L225 Difference]: With dead ends: 3763 [2025-02-08 06:06:37,260 INFO L226 Difference]: Without dead ends: 3763 [2025-02-08 06:06:37,260 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-02-08 06:06:37,261 INFO L435 NwaCegarLoop]: 1931 mSDtfsCounter, 1416 mSDsluCounter, 3315 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 5246 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:37,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 5246 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 06:06:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2025-02-08 06:06:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 2044. [2025-02-08 06:06:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1536 states have (on average 1.794921875) internal successors, (2757), 2037 states have internal predecessors, (2757), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:06:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3265 transitions. [2025-02-08 06:06:37,327 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3265 transitions. Word has length 98 [2025-02-08 06:06:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:37,328 INFO L471 AbstractCegarLoop]: Abstraction has 2044 states and 3265 transitions. [2025-02-08 06:06:37,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:06:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3265 transitions. [2025-02-08 06:06:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-08 06:06:37,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:37,330 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] [2025-02-08 06:06:37,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:06:37,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:37,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash 978355439, now seen corresponding path program 1 times [2025-02-08 06:06:37,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:37,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816401345] [2025-02-08 06:06:37,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:37,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:37,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 06:06:37,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 06:06:37,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:37,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 06:06:37,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:37,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816401345] [2025-02-08 06:06:37,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816401345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:06:37,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:06:37,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:06:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544368479] [2025-02-08 06:06:37,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:06:37,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:06:37,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:37,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:06:37,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:06:37,550 INFO L87 Difference]: Start difference. First operand 2044 states and 3265 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:06:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:37,662 INFO L93 Difference]: Finished difference Result 2084 states and 3305 transitions. [2025-02-08 06:06:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:06:37,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-02-08 06:06:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:37,669 INFO L225 Difference]: With dead ends: 2084 [2025-02-08 06:06:37,669 INFO L226 Difference]: Without dead ends: 2084 [2025-02-08 06:06:37,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:06:37,670 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 8 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3767 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:37,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3767 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:06:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2025-02-08 06:06:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2084. [2025-02-08 06:06:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1576 states have (on average 1.774746192893401) internal successors, (2797), 2077 states have internal predecessors, (2797), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:06:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3305 transitions. [2025-02-08 06:06:37,706 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3305 transitions. Word has length 154 [2025-02-08 06:06:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:37,707 INFO L471 AbstractCegarLoop]: Abstraction has 2084 states and 3305 transitions. [2025-02-08 06:06:37,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:06:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3305 transitions. [2025-02-08 06:06:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-08 06:06:37,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:37,708 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] [2025-02-08 06:06:37,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:06:37,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:37,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2133264560, now seen corresponding path program 1 times [2025-02-08 06:06:37,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:37,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470277105] [2025-02-08 06:06:37,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:37,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:37,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 06:06:37,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 06:06:37,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:37,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 06:06:37,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:37,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470277105] [2025-02-08 06:06:37,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470277105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:06:37,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:06:37,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:06:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446199301] [2025-02-08 06:06:37,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:06:37,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:06:37,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:37,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:06:37,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:06:37,966 INFO L87 Difference]: Start difference. First operand 2084 states and 3305 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:06:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:38,199 INFO L93 Difference]: Finished difference Result 1960 states and 3105 transitions. [2025-02-08 06:06:38,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:06:38,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-02-08 06:06:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:38,204 INFO L225 Difference]: With dead ends: 1960 [2025-02-08 06:06:38,204 INFO L226 Difference]: Without dead ends: 1960 [2025-02-08 06:06:38,205 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-02-08 06:06:38,205 INFO L435 NwaCegarLoop]: 1816 mSDtfsCounter, 32 mSDsluCounter, 3618 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 5434 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:38,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 5434 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:06:38,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2025-02-08 06:06:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1960. [2025-02-08 06:06:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1452 states have (on average 1.7885674931129476) internal successors, (2597), 1953 states have internal predecessors, (2597), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:06:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 3105 transitions. [2025-02-08 06:06:38,230 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 3105 transitions. Word has length 154 [2025-02-08 06:06:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:38,230 INFO L471 AbstractCegarLoop]: Abstraction has 1960 states and 3105 transitions. [2025-02-08 06:06:38,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:06:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 3105 transitions. [2025-02-08 06:06:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-08 06:06:38,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:38,232 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] [2025-02-08 06:06:38,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:06:38,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:38,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2013955177, now seen corresponding path program 1 times [2025-02-08 06:06:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:38,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504535649] [2025-02-08 06:06:38,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:38,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:38,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 06:06:38,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 06:06:38,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:38,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:06:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504535649] [2025-02-08 06:06:38,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504535649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:06:38,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:06:38,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:06:38,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361842638] [2025-02-08 06:06:38,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:06:38,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:06:38,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:38,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:06:38,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:06:38,429 INFO L87 Difference]: Start difference. First operand 1960 states and 3105 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:06:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:38,716 INFO L93 Difference]: Finished difference Result 2542 states and 3711 transitions. [2025-02-08 06:06:38,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:06:38,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-02-08 06:06:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:38,723 INFO L225 Difference]: With dead ends: 2542 [2025-02-08 06:06:38,724 INFO L226 Difference]: Without dead ends: 2542 [2025-02-08 06:06:38,724 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-02-08 06:06:38,724 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 4976 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4977 SdHoareTripleChecker+Valid, 4406 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:38,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4977 Valid, 4406 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:06:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2025-02-08 06:06:38,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 1369. [2025-02-08 06:06:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 861 states have (on average 1.7119628339140534) internal successors, (1474), 1362 states have internal predecessors, (1474), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:06:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1982 transitions. [2025-02-08 06:06:38,779 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1982 transitions. Word has length 154 [2025-02-08 06:06:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:38,780 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1982 transitions. [2025-02-08 06:06:38,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:06:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1982 transitions. [2025-02-08 06:06:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 06:06:38,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:38,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] [2025-02-08 06:06:38,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:06:38,785 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:38,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash -265945317, now seen corresponding path program 1 times [2025-02-08 06:06:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:38,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458249242] [2025-02-08 06:06:38,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:38,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:38,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 06:06:38,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 06:06:38,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:38,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:06:39,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:39,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458249242] [2025-02-08 06:06:39,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458249242] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:06:39,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770101104] [2025-02-08 06:06:39,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:39,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:06:39,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:06:39,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:06:39,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:06:39,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 06:06:39,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 06:06:39,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:39,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:39,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 06:06:39,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:06:39,631 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-02-08 06:06:39,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:06:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:06:39,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:06:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:06:39,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770101104] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:06:39,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:06:39,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-02-08 06:06:39,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360296720] [2025-02-08 06:06:39,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:06:39,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:06:39,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:39,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:06:39,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:06:39,923 INFO L87 Difference]: Start difference. First operand 1369 states and 1982 transitions. Second operand has 12 states, 12 states have (on average 26.916666666666668) internal successors, (323), 12 states have internal predecessors, (323), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:06:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:42,279 INFO L93 Difference]: Finished difference Result 4082 states and 5925 transitions. [2025-02-08 06:06:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:06:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.916666666666668) internal successors, (323), 12 states have internal predecessors, (323), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 164 [2025-02-08 06:06:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:42,290 INFO L225 Difference]: With dead ends: 4082 [2025-02-08 06:06:42,290 INFO L226 Difference]: Without dead ends: 4082 [2025-02-08 06:06:42,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:06:42,291 INFO L435 NwaCegarLoop]: 1986 mSDtfsCounter, 5390 mSDsluCounter, 8691 mSDsCounter, 0 mSdLazyCounter, 2840 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5394 SdHoareTripleChecker+Valid, 10677 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 2840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:42,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5394 Valid, 10677 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 2840 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 06:06:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4082 states. [2025-02-08 06:06:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4082 to 1711. [2025-02-08 06:06:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1199 states have (on average 1.6013344453711427) internal successors, (1920), 1700 states have internal predecessors, (1920), 508 states have call successors, (508), 4 states have call predecessors, (508), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:06:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2434 transitions. [2025-02-08 06:06:42,323 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2434 transitions. Word has length 164 [2025-02-08 06:06:42,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:42,324 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2434 transitions. [2025-02-08 06:06:42,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.916666666666668) internal successors, (323), 12 states have internal predecessors, (323), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:06:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2434 transitions. [2025-02-08 06:06:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-02-08 06:06:42,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:42,327 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:06:42,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:06:42,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 06:06:42,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:42,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash -313090015, now seen corresponding path program 1 times [2025-02-08 06:06:42,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:42,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284414166] [2025-02-08 06:06:42,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:42,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:42,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-08 06:06:42,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-08 06:06:42,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:42,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:06:44,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:44,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284414166] [2025-02-08 06:06:44,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284414166] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:06:44,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348576397] [2025-02-08 06:06:44,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:44,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:06:44,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:06:44,930 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:06:44,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:06:45,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-08 06:06:45,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-08 06:06:45,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:45,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:45,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 06:06:45,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:06:45,515 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-02-08 06:06:45,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:06:45,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:06:45,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:06:46,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:06:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:06:46,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:06:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:06:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348576397] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:06:46,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:06:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2025-02-08 06:06:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142157169] [2025-02-08 06:06:46,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:06:46,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 06:06:46,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:46,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 06:06:46,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:06:46,533 INFO L87 Difference]: Start difference. First operand 1711 states and 2434 transitions. Second operand has 23 states, 23 states have (on average 43.391304347826086) internal successors, (998), 23 states have internal predecessors, (998), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:06:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:51,078 INFO L93 Difference]: Finished difference Result 9390 states and 13661 transitions. [2025-02-08 06:06:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 06:06:51,079 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 43.391304347826086) internal successors, (998), 23 states have internal predecessors, (998), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 389 [2025-02-08 06:06:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:51,110 INFO L225 Difference]: With dead ends: 9390 [2025-02-08 06:06:51,111 INFO L226 Difference]: Without dead ends: 9390 [2025-02-08 06:06:51,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 766 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-02-08 06:06:51,112 INFO L435 NwaCegarLoop]: 5751 mSDtfsCounter, 21169 mSDsluCounter, 37982 mSDsCounter, 0 mSdLazyCounter, 6905 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21179 SdHoareTripleChecker+Valid, 43733 SdHoareTripleChecker+Invalid, 7435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 6905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:51,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21179 Valid, 43733 Invalid, 7435 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [530 Valid, 6905 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-08 06:06:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9390 states. [2025-02-08 06:06:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9390 to 2563. [2025-02-08 06:06:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 2045 states have (on average 1.484596577017115) internal successors, (3036), 2546 states have internal predecessors, (3036), 514 states have call successors, (514), 4 states have call predecessors, (514), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 06:06:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3562 transitions. [2025-02-08 06:06:51,172 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3562 transitions. Word has length 389 [2025-02-08 06:06:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:51,173 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 3562 transitions. [2025-02-08 06:06:51,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 43.391304347826086) internal successors, (998), 23 states have internal predecessors, (998), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:06:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3562 transitions. [2025-02-08 06:06:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-02-08 06:06:51,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:51,191 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:06:51,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:06:51,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:06:51,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:51,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:51,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1518440607, now seen corresponding path program 2 times [2025-02-08 06:06:51,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:51,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441523809] [2025-02-08 06:06:51,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:06:51,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:51,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 839 statements into 2 equivalence classes. [2025-02-08 06:06:51,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 74 of 839 statements. [2025-02-08 06:06:51,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 06:06:51,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-08 06:06:51,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:51,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441523809] [2025-02-08 06:06:51,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441523809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:06:51,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:06:51,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:06:51,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743988686] [2025-02-08 06:06:51,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:06:51,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:06:51,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:51,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:06:51,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:06:51,844 INFO L87 Difference]: Start difference. First operand 2563 states and 3562 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:06:52,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:52,226 INFO L93 Difference]: Finished difference Result 2568 states and 3569 transitions. [2025-02-08 06:06:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:06:52,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 839 [2025-02-08 06:06:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:52,234 INFO L225 Difference]: With dead ends: 2568 [2025-02-08 06:06:52,234 INFO L226 Difference]: Without dead ends: 2568 [2025-02-08 06:06:52,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:06:52,235 INFO L435 NwaCegarLoop]: 1823 mSDtfsCounter, 14 mSDsluCounter, 7028 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8851 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:52,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8851 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:06:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2025-02-08 06:06:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2565. [2025-02-08 06:06:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2047 states have (on average 1.484123106985833) internal successors, (3038), 2548 states have internal predecessors, (3038), 514 states have call successors, (514), 4 states have call predecessors, (514), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 06:06:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3564 transitions. [2025-02-08 06:06:52,273 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3564 transitions. Word has length 839 [2025-02-08 06:06:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:52,274 INFO L471 AbstractCegarLoop]: Abstraction has 2565 states and 3564 transitions. [2025-02-08 06:06:52,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:06:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3564 transitions. [2025-02-08 06:06:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2025-02-08 06:06:52,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:52,330 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:06:52,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:06:52,330 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:52,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:52,332 INFO L85 PathProgramCache]: Analyzing trace with hash -532154384, now seen corresponding path program 1 times [2025-02-08 06:06:52,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:52,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797114342] [2025-02-08 06:06:52,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:52,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:52,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes. [2025-02-08 06:06:52,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements. [2025-02-08 06:06:52,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:52,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:06:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-08 06:06:54,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:06:54,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797114342] [2025-02-08 06:06:54,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797114342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:06:54,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:06:54,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:06:54,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883126785] [2025-02-08 06:06:54,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:06:54,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:06:54,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:06:54,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:06:54,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:06:54,595 INFO L87 Difference]: Start difference. First operand 2565 states and 3564 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:06:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:06:54,842 INFO L93 Difference]: Finished difference Result 2570 states and 3570 transitions. [2025-02-08 06:06:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:06:54,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 840 [2025-02-08 06:06:54,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:06:54,846 INFO L225 Difference]: With dead ends: 2570 [2025-02-08 06:06:54,846 INFO L226 Difference]: Without dead ends: 2570 [2025-02-08 06:06:54,846 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-02-08 06:06:54,847 INFO L435 NwaCegarLoop]: 1818 mSDtfsCounter, 15 mSDsluCounter, 8804 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 10622 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:06:54,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 10622 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:06:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2025-02-08 06:06:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2569. [2025-02-08 06:06:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2051 states have (on average 1.4836665041443198) internal successors, (3043), 2552 states have internal predecessors, (3043), 514 states have call successors, (514), 4 states have call predecessors, (514), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 06:06:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3569 transitions. [2025-02-08 06:06:54,866 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3569 transitions. Word has length 840 [2025-02-08 06:06:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:06:54,867 INFO L471 AbstractCegarLoop]: Abstraction has 2569 states and 3569 transitions. [2025-02-08 06:06:54,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:06:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3569 transitions. [2025-02-08 06:06:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2025-02-08 06:06:54,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:06:54,873 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:06:54,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:06:54,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:06:54,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:06:54,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1150698647, now seen corresponding path program 1 times [2025-02-08 06:06:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:06:54,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669958851] [2025-02-08 06:06:54,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:06:54,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:06:55,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes. [2025-02-08 06:06:55,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements. [2025-02-08 06:06:55,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:06:55,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:07:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:07:05,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:07:05,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669958851] [2025-02-08 06:07:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669958851] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:07:05,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714742334] [2025-02-08 06:07:05,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:07:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:07:05,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:07:05,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:07:05,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:07:06,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes. [2025-02-08 06:07:06,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements. [2025-02-08 06:07:06,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:07:06,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:07:06,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 4166 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 06:07:06,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:07:06,858 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-02-08 06:07:07,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:07:07,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:07:07,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:07:07,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:07:07,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:07:07,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:07:07,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:07:07,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:07:08,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:07:08,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:07:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:07:08,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:07:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:07:09,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714742334] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:07:09,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:07:09,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 42 [2025-02-08 06:07:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859008432] [2025-02-08 06:07:09,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:07:09,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 06:07:09,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:07:09,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 06:07:09,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1127, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 06:07:09,507 INFO L87 Difference]: Start difference. First operand 2569 states and 3569 transitions. Second operand has 42 states, 42 states have (on average 55.92857142857143) internal successors, (2349), 42 states have internal predecessors, (2349), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:07:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:07:24,089 INFO L93 Difference]: Finished difference Result 17856 states and 25920 transitions. [2025-02-08 06:07:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-08 06:07:24,090 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 55.92857142857143) internal successors, (2349), 42 states have internal predecessors, (2349), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 840 [2025-02-08 06:07:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:07:24,224 INFO L225 Difference]: With dead ends: 17856 [2025-02-08 06:07:24,225 INFO L226 Difference]: Without dead ends: 17856 [2025-02-08 06:07:24,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1721 GetRequests, 1657 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=2778, Unknown=0, NotChecked=0, Total=3906 [2025-02-08 06:07:24,228 INFO L435 NwaCegarLoop]: 11652 mSDtfsCounter, 45196 mSDsluCounter, 109477 mSDsCounter, 0 mSdLazyCounter, 21545 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45218 SdHoareTripleChecker+Valid, 121129 SdHoareTripleChecker+Invalid, 22106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 21545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:07:24,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45218 Valid, 121129 Invalid, 22106 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [561 Valid, 21545 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2025-02-08 06:07:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17856 states. [2025-02-08 06:07:24,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17856 to 4273. [2025-02-08 06:07:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4273 states, 3743 states have (on average 1.4092973550627839) internal successors, (5275), 4244 states have internal predecessors, (5275), 526 states have call successors, (526), 4 states have call predecessors, (526), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 06:07:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 5825 transitions. [2025-02-08 06:07:24,649 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 5825 transitions. Word has length 840 [2025-02-08 06:07:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:07:24,652 INFO L471 AbstractCegarLoop]: Abstraction has 4273 states and 5825 transitions. [2025-02-08 06:07:24,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 55.92857142857143) internal successors, (2349), 42 states have internal predecessors, (2349), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:07:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 5825 transitions. [2025-02-08 06:07:24,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2025-02-08 06:07:24,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:07:24,723 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:07:24,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:07:24,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:07:24,928 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:07:24,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:07:24,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1122870039, now seen corresponding path program 2 times [2025-02-08 06:07:24,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:07:24,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707683344] [2025-02-08 06:07:24,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:07:24,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:07:25,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1740 statements into 2 equivalence classes. [2025-02-08 06:07:25,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 1740 statements. [2025-02-08 06:07:25,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 06:07:25,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:07:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-08 06:07:25,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:07:25,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707683344] [2025-02-08 06:07:25,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707683344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:07:25,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:07:25,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:07:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29337684] [2025-02-08 06:07:25,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:07:25,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:07:25,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:07:25,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:07:25,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:07:25,820 INFO L87 Difference]: Start difference. First operand 4273 states and 5825 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:07:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:07:26,014 INFO L93 Difference]: Finished difference Result 4273 states and 5824 transitions. [2025-02-08 06:07:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:07:26,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1740 [2025-02-08 06:07:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:07:26,027 INFO L225 Difference]: With dead ends: 4273 [2025-02-08 06:07:26,028 INFO L226 Difference]: Without dead ends: 4273 [2025-02-08 06:07:26,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-02-08 06:07:26,033 INFO L435 NwaCegarLoop]: 1827 mSDtfsCounter, 17 mSDsluCounter, 3539 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5366 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:07:26,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5366 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:07:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states. [2025-02-08 06:07:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 4273. [2025-02-08 06:07:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4273 states, 3743 states have (on average 1.4090301896874164) internal successors, (5274), 4244 states have internal predecessors, (5274), 526 states have call successors, (526), 4 states have call predecessors, (526), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 06:07:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 5824 transitions. [2025-02-08 06:07:26,092 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 5824 transitions. Word has length 1740 [2025-02-08 06:07:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:07:26,094 INFO L471 AbstractCegarLoop]: Abstraction has 4273 states and 5824 transitions. [2025-02-08 06:07:26,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:07:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 5824 transitions. [2025-02-08 06:07:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1742 [2025-02-08 06:07:26,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:07:26,118 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:07:26,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:07:26,118 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:07:26,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:07:26,121 INFO L85 PathProgramCache]: Analyzing trace with hash -258162168, now seen corresponding path program 1 times [2025-02-08 06:07:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:07:26,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546728540] [2025-02-08 06:07:26,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:07:26,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:07:26,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1741 statements into 1 equivalence classes. [2025-02-08 06:07:27,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1741 of 1741 statements. [2025-02-08 06:07:27,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:07:27,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:07:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-08 06:07:32,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:07:32,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546728540] [2025-02-08 06:07:32,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546728540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:07:32,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:07:32,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:07:32,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008888751] [2025-02-08 06:07:32,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:07:32,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:07:32,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:07:32,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:07:32,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:07:32,170 INFO L87 Difference]: Start difference. First operand 4273 states and 5824 transitions. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:07:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:07:32,760 INFO L93 Difference]: Finished difference Result 4286 states and 5842 transitions. [2025-02-08 06:07:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:07:32,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1741 [2025-02-08 06:07:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:07:32,770 INFO L225 Difference]: With dead ends: 4286 [2025-02-08 06:07:32,770 INFO L226 Difference]: Without dead ends: 4286 [2025-02-08 06:07:32,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:07:32,771 INFO L435 NwaCegarLoop]: 1819 mSDtfsCounter, 33 mSDsluCounter, 12387 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 14206 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:07:32,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 14206 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:07:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2025-02-08 06:07:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 4283. [2025-02-08 06:07:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4283 states, 3753 states have (on average 1.4090061284305888) internal successors, (5288), 4254 states have internal predecessors, (5288), 526 states have call successors, (526), 4 states have call predecessors, (526), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 06:07:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 5838 transitions. [2025-02-08 06:07:32,815 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 5838 transitions. Word has length 1741 [2025-02-08 06:07:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:07:32,817 INFO L471 AbstractCegarLoop]: Abstraction has 4283 states and 5838 transitions. [2025-02-08 06:07:32,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:07:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 5838 transitions. [2025-02-08 06:07:32,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1742 [2025-02-08 06:07:32,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:07:32,839 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:07:32,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:07:32,839 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:07:32,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:07:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1289758020, now seen corresponding path program 1 times [2025-02-08 06:07:32,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:07:32,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844614027] [2025-02-08 06:07:32,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:07:32,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:07:33,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1741 statements into 1 equivalence classes. [2025-02-08 06:07:34,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1741 of 1741 statements. [2025-02-08 06:07:34,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:07:34,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat