./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c00e63dc 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_JEN_test2-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 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:50:07,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:50:07,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-06 09:50:07,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:50:07,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:50:07,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:50:07,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:50:07,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:50:07,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 09:50:07,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 09:50:07,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:50:07,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:50:07,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:50:07,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:50:07,254 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:50:07,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:50:07,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:50:07,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:50:07,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:50:07,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:50:07,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:50:07,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:50:07,256 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 09:50:07,256 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 09:50:07,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:50:07,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:50:07,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 09:50:07,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:50:07,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:50:07,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:50:07,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:50:07,257 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 -> 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 [2025-02-06 09:50:07,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:50:07,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:50:07,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:50:07,521 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:50:07,521 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:50:07,522 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_JEN_test2-1.i [2025-02-06 09:50:08,723 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/947dbcccb/13fbafec2fcc4b309d26a305955b45b3/FLAG930c02c7e [2025-02-06 09:50:09,056 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:50:09,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2025-02-06 09:50:09,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/947dbcccb/13fbafec2fcc4b309d26a305955b45b3/FLAG930c02c7e [2025-02-06 09:50:09,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/947dbcccb/13fbafec2fcc4b309d26a305955b45b3 [2025-02-06 09:50:09,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:50:09,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:50:09,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:50:09,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:50:09,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:50:09,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:09,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac32cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09, skipping insertion in model container [2025-02-06 09:50:09,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:09,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:50:09,617 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-06 09:50:09,646 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-06 09:50:09,648 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-06 09:50:09,650 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-06 09:50:09,656 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-06 09:50:09,685 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-06 09:50:09,685 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-06 09:50:09,688 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-06 09:50:09,688 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-06 09:50:09,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:50:09,708 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:50:09,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:50:09,831 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:50:09,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09 WrapperNode [2025-02-06 09:50:09,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:50:09,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:50:09,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:50:09,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:50:09,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:09,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:09,906 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1264 [2025-02-06 09:50:09,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:50:09,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:50:09,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:50:09,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:50:09,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:09,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:09,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:09,972 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-06 09:50:09,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:09,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:09,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:09,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:09,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:10,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:10,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:50:10,011 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:50:10,011 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:50:10,011 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:50:10,012 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (1/1) ... [2025-02-06 09:50:10,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:50:10,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:50:10,045 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-06 09:50:10,048 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-06 09:50:10,066 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 09:50:10,066 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 09:50:10,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 09:50:10,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 09:50:10,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 09:50:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 09:50:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 09:50:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 09:50:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 09:50:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 09:50:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 09:50:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 09:50:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:50:10,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:50:10,226 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:50:10,228 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:50:11,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 09:50:11,220 INFO L? ?]: Removed 304 outVars from TransFormulas that were not future-live. [2025-02-06 09:50:11,220 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:50:11,259 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:50:11,259 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 09:50:11,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:50:11 BoogieIcfgContainer [2025-02-06 09:50:11,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:50:11,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:50:11,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:50:11,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:50:11,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:50:09" (1/3) ... [2025-02-06 09:50:11,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6928d982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:50:11, skipping insertion in model container [2025-02-06 09:50:11,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:09" (2/3) ... [2025-02-06 09:50:11,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6928d982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:50:11, skipping insertion in model container [2025-02-06 09:50:11,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:50:11" (3/3) ... [2025-02-06 09:50:11,269 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test2-1.i [2025-02-06 09:50:11,281 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:50:11,284 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test2-1.i that has 6 procedures, 390 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-02-06 09:50:11,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:50:11,328 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;@7139a065, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:50:11,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 09:50:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 382 states, 366 states have (on average 1.6174863387978142) internal successors, (592), 375 states have internal predecessors, (592), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 09:50:11,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 09:50:11,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:11,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:11,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:11,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash -154665743, now seen corresponding path program 1 times [2025-02-06 09:50:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:11,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419658481] [2025-02-06 09:50:11,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:11,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 09:50:11,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 09:50:11,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:11,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:11,468 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-06 09:50:11,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:11,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419658481] [2025-02-06 09:50:11,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419658481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:11,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:11,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:50:11,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262205027] [2025-02-06 09:50:11,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:11,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:50:11,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:11,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:50:11,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:50:11,501 INFO L87 Difference]: Start difference. First operand has 382 states, 366 states have (on average 1.6174863387978142) internal successors, (592), 375 states have internal predecessors, (592), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:11,595 INFO L93 Difference]: Finished difference Result 380 states and 553 transitions. [2025-02-06 09:50:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:50:11,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 09:50:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:11,605 INFO L225 Difference]: With dead ends: 380 [2025-02-06 09:50:11,606 INFO L226 Difference]: Without dead ends: 378 [2025-02-06 09:50:11,608 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-06 09:50:11,611 INFO L435 NwaCegarLoop]: 512 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, 512 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-06 09:50:11,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 512 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:50:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-06 09:50:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-02-06 09:50:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 364 states have (on average 1.4642857142857142) internal successors, (533), 371 states have internal predecessors, (533), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 09:50:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 551 transitions. [2025-02-06 09:50:11,657 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 551 transitions. Word has length 7 [2025-02-06 09:50:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:11,657 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 551 transitions. [2025-02-06 09:50:11,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 551 transitions. [2025-02-06 09:50:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 09:50:11,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:11,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:11,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:50:11,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:11,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:11,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1756358563, now seen corresponding path program 1 times [2025-02-06 09:50:11,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:11,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410707892] [2025-02-06 09:50:11,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:11,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:11,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 09:50:11,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 09:50:11,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:11,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:11,774 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-06 09:50:11,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:11,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410707892] [2025-02-06 09:50:11,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410707892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:11,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:11,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:50:11,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659551662] [2025-02-06 09:50:11,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:11,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:50:11,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:11,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:50:11,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:50:11,776 INFO L87 Difference]: Start difference. First operand 378 states and 551 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:12,007 INFO L93 Difference]: Finished difference Result 739 states and 1086 transitions. [2025-02-06 09:50:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:50:12,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 09:50:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:12,010 INFO L225 Difference]: With dead ends: 739 [2025-02-06 09:50:12,010 INFO L226 Difference]: Without dead ends: 739 [2025-02-06 09:50:12,011 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-06 09:50:12,011 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 515 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:12,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1540 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:50:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-02-06 09:50:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 380. [2025-02-06 09:50:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 366 states have (on average 1.4617486338797814) internal successors, (535), 373 states have internal predecessors, (535), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 09:50:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 553 transitions. [2025-02-06 09:50:12,030 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 553 transitions. Word has length 9 [2025-02-06 09:50:12,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:12,031 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 553 transitions. [2025-02-06 09:50:12,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 553 transitions. [2025-02-06 09:50:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 09:50:12,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:12,032 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:12,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:50:12,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:12,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:12,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1211138795, now seen corresponding path program 1 times [2025-02-06 09:50:12,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:12,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960777505] [2025-02-06 09:50:12,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:12,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:12,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 09:50:12,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 09:50:12,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:12,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:12,364 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-06 09:50:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:12,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960777505] [2025-02-06 09:50:12,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960777505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:12,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:12,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:50:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876795650] [2025-02-06 09:50:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:12,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:50:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:12,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:50:12,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:50:12,367 INFO L87 Difference]: Start difference. First operand 380 states and 553 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:12,497 INFO L93 Difference]: Finished difference Result 338 states and 476 transitions. [2025-02-06 09:50:12,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:50:12,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-06 09:50:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:12,500 INFO L225 Difference]: With dead ends: 338 [2025-02-06 09:50:12,500 INFO L226 Difference]: Without dead ends: 338 [2025-02-06 09:50:12,500 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-06 09:50:12,501 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 30 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:12,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1235 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:50:12,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-06 09:50:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-02-06 09:50:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 324 states have (on average 1.4135802469135803) internal successors, (458), 331 states have internal predecessors, (458), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 09:50:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 476 transitions. [2025-02-06 09:50:12,513 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 476 transitions. Word has length 84 [2025-02-06 09:50:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:12,513 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 476 transitions. [2025-02-06 09:50:12,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 476 transitions. [2025-02-06 09:50:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 09:50:12,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:12,515 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:12,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:50:12,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:12,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash 923371908, now seen corresponding path program 1 times [2025-02-06 09:50:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:12,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510175881] [2025-02-06 09:50:12,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:12,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 09:50:12,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 09:50:12,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:12,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:12,707 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-06 09:50:12,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:12,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510175881] [2025-02-06 09:50:12,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510175881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:12,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:12,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:50:12,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188675233] [2025-02-06 09:50:12,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:12,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:50:12,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:12,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:50:12,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:50:12,710 INFO L87 Difference]: Start difference. First operand 338 states and 476 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:12,786 INFO L93 Difference]: Finished difference Result 338 states and 473 transitions. [2025-02-06 09:50:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:50:12,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-06 09:50:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:12,788 INFO L225 Difference]: With dead ends: 338 [2025-02-06 09:50:12,788 INFO L226 Difference]: Without dead ends: 338 [2025-02-06 09:50:12,788 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-06 09:50:12,788 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 1 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:12,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 838 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:50:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-06 09:50:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-02-06 09:50:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 324 states have (on average 1.404320987654321) internal successors, (455), 331 states have internal predecessors, (455), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 09:50:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 473 transitions. [2025-02-06 09:50:12,802 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 473 transitions. Word has length 84 [2025-02-06 09:50:12,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:12,804 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 473 transitions. [2025-02-06 09:50:12,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 473 transitions. [2025-02-06 09:50:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 09:50:12,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:12,806 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:12,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:50:12,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:12,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:12,807 INFO L85 PathProgramCache]: Analyzing trace with hash 485362405, now seen corresponding path program 1 times [2025-02-06 09:50:12,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:12,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561290424] [2025-02-06 09:50:12,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:12,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:12,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 09:50:12,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 09:50:12,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:12,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:12,938 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-06 09:50:12,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:12,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561290424] [2025-02-06 09:50:12,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561290424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:12,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:12,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:50:12,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826327179] [2025-02-06 09:50:12,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:12,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:50:12,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:12,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:50:12,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:50:12,939 INFO L87 Difference]: Start difference. First operand 338 states and 473 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:13,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:13,068 INFO L93 Difference]: Finished difference Result 573 states and 813 transitions. [2025-02-06 09:50:13,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:50:13,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-06 09:50:13,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:13,071 INFO L225 Difference]: With dead ends: 573 [2025-02-06 09:50:13,071 INFO L226 Difference]: Without dead ends: 573 [2025-02-06 09:50:13,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:50:13,072 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 272 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1036 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-06 09:50:13,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1036 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:50:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-02-06 09:50:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 569. [2025-02-06 09:50:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 550 states have (on average 1.4218181818181819) internal successors, (782), 562 states have internal predecessors, (782), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 09:50:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 810 transitions. [2025-02-06 09:50:13,090 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 810 transitions. Word has length 84 [2025-02-06 09:50:13,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:13,090 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 810 transitions. [2025-02-06 09:50:13,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:13,090 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 810 transitions. [2025-02-06 09:50:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 09:50:13,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:13,095 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:13,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:50:13,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:13,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1244323027, now seen corresponding path program 1 times [2025-02-06 09:50:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:13,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208942587] [2025-02-06 09:50:13,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:13,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:13,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 09:50:13,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 09:50:13,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:13,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:13,457 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-06 09:50:13,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:13,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208942587] [2025-02-06 09:50:13,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208942587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:13,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:13,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:50:13,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694647080] [2025-02-06 09:50:13,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:13,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:50:13,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:13,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:50:13,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:50:13,459 INFO L87 Difference]: Start difference. First operand 569 states and 810 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-06 09:50:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:13,625 INFO L93 Difference]: Finished difference Result 814 states and 1172 transitions. [2025-02-06 09:50:13,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:50:13,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-02-06 09:50:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:13,628 INFO L225 Difference]: With dead ends: 814 [2025-02-06 09:50:13,628 INFO L226 Difference]: Without dead ends: 814 [2025-02-06 09:50:13,628 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-06 09:50:13,629 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 428 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:13,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1238 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:50:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-02-06 09:50:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 571. [2025-02-06 09:50:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 552 states have (on average 1.4202898550724639) internal successors, (784), 564 states have internal predecessors, (784), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 09:50:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 812 transitions. [2025-02-06 09:50:13,645 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 812 transitions. Word has length 99 [2025-02-06 09:50:13,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:13,645 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 812 transitions. [2025-02-06 09:50:13,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-06 09:50:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 812 transitions. [2025-02-06 09:50:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 09:50:13,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:13,647 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:13,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:50:13,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:13,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2134202937, now seen corresponding path program 1 times [2025-02-06 09:50:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:13,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866812959] [2025-02-06 09:50:13,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:13,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 09:50:13,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 09:50:13,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:13,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:13,853 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-06 09:50:13,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:13,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866812959] [2025-02-06 09:50:13,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866812959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:13,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:13,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:50:13,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579532180] [2025-02-06 09:50:13,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:13,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:50:13,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:13,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:50:13,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:50:13,856 INFO L87 Difference]: Start difference. First operand 571 states and 812 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 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-06 09:50:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:13,947 INFO L93 Difference]: Finished difference Result 611 states and 852 transitions. [2025-02-06 09:50:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:50:13,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 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 155 [2025-02-06 09:50:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:13,950 INFO L225 Difference]: With dead ends: 611 [2025-02-06 09:50:13,951 INFO L226 Difference]: Without dead ends: 611 [2025-02-06 09:50:13,952 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-06 09:50:13,952 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 8 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 817 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-06 09:50:13,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 817 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:50:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-02-06 09:50:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2025-02-06 09:50:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 592 states have (on average 1.3918918918918919) internal successors, (824), 604 states have internal predecessors, (824), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 09:50:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 852 transitions. [2025-02-06 09:50:13,963 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 852 transitions. Word has length 155 [2025-02-06 09:50:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:13,963 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 852 transitions. [2025-02-06 09:50:13,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 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-06 09:50:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 852 transitions. [2025-02-06 09:50:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 09:50:13,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:13,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:13,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:50:13,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:13,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:13,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2036691112, now seen corresponding path program 1 times [2025-02-06 09:50:13,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:13,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011549383] [2025-02-06 09:50:13,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:13,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:14,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 09:50:14,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 09:50:14,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:14,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:14,166 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-06 09:50:14,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:14,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011549383] [2025-02-06 09:50:14,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011549383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:14,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:14,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:50:14,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558515034] [2025-02-06 09:50:14,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:14,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:50:14,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:14,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:50:14,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:50:14,168 INFO L87 Difference]: Start difference. First operand 611 states and 852 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 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-06 09:50:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:14,253 INFO L93 Difference]: Finished difference Result 487 states and 652 transitions. [2025-02-06 09:50:14,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:50:14,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 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 155 [2025-02-06 09:50:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:14,255 INFO L225 Difference]: With dead ends: 487 [2025-02-06 09:50:14,255 INFO L226 Difference]: Without dead ends: 487 [2025-02-06 09:50:14,255 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-06 09:50:14,256 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 32 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:14,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1009 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:50:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-02-06 09:50:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2025-02-06 09:50:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 468 states have (on average 1.3333333333333333) internal successors, (624), 480 states have internal predecessors, (624), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 09:50:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 652 transitions. [2025-02-06 09:50:14,265 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 652 transitions. Word has length 155 [2025-02-06 09:50:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:14,266 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 652 transitions. [2025-02-06 09:50:14,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 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-06 09:50:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 652 transitions. [2025-02-06 09:50:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 09:50:14,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:14,267 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:14,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:50:14,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:14,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1888943553, now seen corresponding path program 1 times [2025-02-06 09:50:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:14,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520047747] [2025-02-06 09:50:14,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:14,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:14,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 09:50:14,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 09:50:14,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:14,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:14,485 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-06 09:50:14,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:14,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520047747] [2025-02-06 09:50:14,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520047747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:14,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:14,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:50:14,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993186193] [2025-02-06 09:50:14,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:14,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:50:14,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:14,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:50:14,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:50:14,486 INFO L87 Difference]: Start difference. First operand 487 states and 652 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-06 09:50:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:15,010 INFO L93 Difference]: Finished difference Result 569 states and 758 transitions. [2025-02-06 09:50:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:50:15,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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 155 [2025-02-06 09:50:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:15,012 INFO L225 Difference]: With dead ends: 569 [2025-02-06 09:50:15,013 INFO L226 Difference]: Without dead ends: 569 [2025-02-06 09:50:15,013 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-06 09:50:15,013 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 1024 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:15,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 962 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 09:50:15,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-02-06 09:50:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 384. [2025-02-06 09:50:15,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 370 states have (on average 1.3216216216216217) internal successors, (489), 377 states have internal predecessors, (489), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 09:50:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 507 transitions. [2025-02-06 09:50:15,022 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 507 transitions. Word has length 155 [2025-02-06 09:50:15,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:15,022 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 507 transitions. [2025-02-06 09:50:15,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-06 09:50:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 507 transitions. [2025-02-06 09:50:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 09:50:15,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:15,026 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:15,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:50:15,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:15,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash 608451059, now seen corresponding path program 1 times [2025-02-06 09:50:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:15,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929803789] [2025-02-06 09:50:15,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:15,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 09:50:15,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 09:50:15,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:15,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:15,621 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-06 09:50:15,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:15,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929803789] [2025-02-06 09:50:15,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929803789] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:50:15,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216326180] [2025-02-06 09:50:15,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:15,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:50:15,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:50:15,623 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-06 09:50:15,625 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-06 09:50:15,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 09:50:15,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 09:50:15,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:15,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:15,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 09:50:15,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:50:15,905 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-06 09:50:16,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-06 09:50:16,082 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-06 09:50:16,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:50:16,247 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-06 09:50:16,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216326180] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:50:16,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:50:16,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-02-06 09:50:16,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385800216] [2025-02-06 09:50:16,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:50:16,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 09:50:16,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:16,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 09:50:16,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 09:50:16,251 INFO L87 Difference]: Start difference. First operand 384 states and 507 transitions. Second operand has 12 states, 12 states have (on average 27.0) internal successors, (324), 12 states have internal predecessors, (324), 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-06 09:50:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:16,610 INFO L93 Difference]: Finished difference Result 1123 states and 1496 transitions. [2025-02-06 09:50:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:50:16,611 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 12 states have internal predecessors, (324), 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 165 [2025-02-06 09:50:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:16,614 INFO L225 Difference]: With dead ends: 1123 [2025-02-06 09:50:16,614 INFO L226 Difference]: Without dead ends: 1123 [2025-02-06 09:50:16,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 322 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-06 09:50:16,615 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1733 mSDsluCounter, 2265 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:16,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 2771 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 09:50:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2025-02-06 09:50:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 726. [2025-02-06 09:50:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 708 states have (on average 1.3206214689265536) internal successors, (935), 715 states have internal predecessors, (935), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 09:50:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 959 transitions. [2025-02-06 09:50:16,628 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 959 transitions. Word has length 165 [2025-02-06 09:50:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:16,628 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 959 transitions. [2025-02-06 09:50:16,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 12 states have internal predecessors, (324), 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-06 09:50:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 959 transitions. [2025-02-06 09:50:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-02-06 09:50:16,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:16,631 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, 1] [2025-02-06 09:50:16,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 09:50:16,832 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-06 09:50:16,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:16,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash -153961067, now seen corresponding path program 1 times [2025-02-06 09:50:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633830882] [2025-02-06 09:50:16,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:16,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-06 09:50:17,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-06 09:50:17,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:17,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:19,215 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-06 09:50:19,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:19,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633830882] [2025-02-06 09:50:19,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633830882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:50:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461453728] [2025-02-06 09:50:19,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:19,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:50:19,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:50:19,219 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-06 09:50:19,219 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-06 09:50:19,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-06 09:50:19,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-06 09:50:19,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:19,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:19,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 09:50:19,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:50:19,736 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-06 09:50:19,884 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-06 09:50:19,970 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-06 09:50:20,058 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-06 09:50:20,148 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-06 09:50:20,161 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-06 09:50:20,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:50:20,548 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-06 09:50:20,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461453728] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:50:20,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:50:20,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 23 [2025-02-06 09:50:20,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883625026] [2025-02-06 09:50:20,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:50:20,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:50:20,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:20,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:50:20,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:50:20,553 INFO L87 Difference]: Start difference. First operand 726 states and 959 transitions. Second operand has 23 states, 23 states have (on average 43.43478260869565) internal successors, (999), 23 states have internal predecessors, (999), 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-06 09:50:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:21,535 INFO L93 Difference]: Finished difference Result 2353 states and 3146 transitions. [2025-02-06 09:50:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 09:50:21,535 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 43.43478260869565) internal successors, (999), 23 states have internal predecessors, (999), 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 390 [2025-02-06 09:50:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:21,543 INFO L225 Difference]: With dead ends: 2353 [2025-02-06 09:50:21,543 INFO L226 Difference]: Without dead ends: 2353 [2025-02-06 09:50:21,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 768 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-02-06 09:50:21,545 INFO L435 NwaCegarLoop]: 1315 mSDtfsCounter, 5037 mSDsluCounter, 9540 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5072 SdHoareTripleChecker+Valid, 10855 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:21,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5072 Valid, 10855 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 09:50:21,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2025-02-06 09:50:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1578. [2025-02-06 09:50:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1554 states have (on average 1.3198198198198199) internal successors, (2051), 1561 states have internal predecessors, (2051), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 09:50:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2087 transitions. [2025-02-06 09:50:21,572 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2087 transitions. Word has length 390 [2025-02-06 09:50:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:21,573 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2087 transitions. [2025-02-06 09:50:21,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 43.43478260869565) internal successors, (999), 23 states have internal predecessors, (999), 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-06 09:50:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2087 transitions. [2025-02-06 09:50:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2025-02-06 09:50:21,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:21,585 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-06 09:50:21,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:50:21,785 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-06 09:50:21,786 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:21,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:21,787 INFO L85 PathProgramCache]: Analyzing trace with hash 915708245, now seen corresponding path program 2 times [2025-02-06 09:50:21,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:21,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635262182] [2025-02-06 09:50:21,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:50:21,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:21,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 840 statements into 2 equivalence classes. [2025-02-06 09:50:22,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 840 statements. [2025-02-06 09:50:22,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:50:22,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:22,145 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-06 09:50:22,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:22,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635262182] [2025-02-06 09:50:22,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635262182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:22,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:22,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:50:22,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018516687] [2025-02-06 09:50:22,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:22,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:50:22,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:22,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:50:22,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:50:22,147 INFO L87 Difference]: Start difference. First operand 1578 states and 2087 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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-06 09:50:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:22,419 INFO L93 Difference]: Finished difference Result 1583 states and 2094 transitions. [2025-02-06 09:50:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:50:22,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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-06 09:50:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:22,424 INFO L225 Difference]: With dead ends: 1583 [2025-02-06 09:50:22,424 INFO L226 Difference]: Without dead ends: 1583 [2025-02-06 09:50:22,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:50:22,425 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 14 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1476 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-06 09:50:22,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1476 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 09:50:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-02-06 09:50:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1580. [2025-02-06 09:50:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1556 states have (on average 1.319408740359897) internal successors, (2053), 1563 states have internal predecessors, (2053), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 09:50:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2089 transitions. [2025-02-06 09:50:22,444 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2089 transitions. Word has length 840 [2025-02-06 09:50:22,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:22,444 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2089 transitions. [2025-02-06 09:50:22,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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-06 09:50:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2089 transitions. [2025-02-06 09:50:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2025-02-06 09:50:22,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:22,458 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, 1] [2025-02-06 09:50:22,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:50:22,458 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:22,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1937674696, now seen corresponding path program 1 times [2025-02-06 09:50:22,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:22,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268991723] [2025-02-06 09:50:22,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:22,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes. [2025-02-06 09:50:22,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements. [2025-02-06 09:50:22,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:22,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:23,856 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-06 09:50:23,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:23,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268991723] [2025-02-06 09:50:23,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268991723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:23,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:23,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:50:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852150226] [2025-02-06 09:50:23,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:23,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:50:23,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:23,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:50:23,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:50:23,858 INFO L87 Difference]: Start difference. First operand 1580 states and 2089 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 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-06 09:50:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:24,114 INFO L93 Difference]: Finished difference Result 1585 states and 2095 transitions. [2025-02-06 09:50:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:50:24,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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 841 [2025-02-06 09:50:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:24,122 INFO L225 Difference]: With dead ends: 1585 [2025-02-06 09:50:24,122 INFO L226 Difference]: Without dead ends: 1585 [2025-02-06 09:50:24,123 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-06 09:50:24,123 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 15 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1772 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-06 09:50:24,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1772 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:50:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-02-06 09:50:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1584. [2025-02-06 09:50:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1560 states have (on average 1.3192307692307692) internal successors, (2058), 1567 states have internal predecessors, (2058), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 09:50:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2094 transitions. [2025-02-06 09:50:24,145 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2094 transitions. Word has length 841 [2025-02-06 09:50:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:24,146 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2094 transitions. [2025-02-06 09:50:24,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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-06 09:50:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2094 transitions. [2025-02-06 09:50:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2025-02-06 09:50:24,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:24,152 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, 1] [2025-02-06 09:50:24,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:50:24,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:24,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:24,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1319130433, now seen corresponding path program 1 times [2025-02-06 09:50:24,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:24,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869746222] [2025-02-06 09:50:24,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:24,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:24,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes. [2025-02-06 09:51:17,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements. [2025-02-06 09:51:17,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:51:17,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:51:17,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 497 proven. 3 refuted. 0 times theorem prover too weak. 2881 trivial. 0 not checked. [2025-02-06 09:51:17,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:51:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869746222] [2025-02-06 09:51:17,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869746222] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:51:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617171470] [2025-02-06 09:51:17,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:51:17,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:51:17,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:51:17,768 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-06 09:51:17,769 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-06 09:51:18,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes. [2025-02-06 09:51:25,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements. [2025-02-06 09:51:25,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:51:25,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:51:25,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 4166 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 09:51:25,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:51:25,207 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-06 09:51:25,342 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-06 09:51:25,427 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-06 09:51:25,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-06 09:51:25,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:51:25,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 58 [2025-02-06 09:51:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 1350 proven. 137 refuted. 0 times theorem prover too weak. 1894 trivial. 0 not checked. [2025-02-06 09:51:25,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:51:26,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2025-02-06 09:51:28,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617171470] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:51:28,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 09:51:28,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 16] total 18 [2025-02-06 09:51:28,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876579864] [2025-02-06 09:51:28,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 09:51:28,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 09:51:28,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:51:28,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 09:51:28,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2025-02-06 09:51:28,931 INFO L87 Difference]: Start difference. First operand 1584 states and 2094 transitions. Second operand has 18 states, 18 states have (on average 22.666666666666668) internal successors, (408), 18 states have internal predecessors, (408), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 09:51:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:51:32,454 INFO L93 Difference]: Finished difference Result 1866 states and 2477 transitions. [2025-02-06 09:51:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 09:51:32,455 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 22.666666666666668) internal successors, (408), 18 states have internal predecessors, (408), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 841 [2025-02-06 09:51:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:51:32,460 INFO L225 Difference]: With dead ends: 1866 [2025-02-06 09:51:32,460 INFO L226 Difference]: Without dead ends: 1866 [2025-02-06 09:51:32,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1631 GetRequests, 1589 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=257, Invalid=1383, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 09:51:32,460 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 1128 mSDsluCounter, 7498 mSDsCounter, 0 mSdLazyCounter, 3296 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 8268 SdHoareTripleChecker+Invalid, 3313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:51:32,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 8268 Invalid, 3313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3296 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 09:51:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2025-02-06 09:51:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1592. [2025-02-06 09:51:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1567 states have (on average 1.3190810465858327) internal successors, (2067), 1574 states have internal predecessors, (2067), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 09:51:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2103 transitions. [2025-02-06 09:51:32,480 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2103 transitions. Word has length 841 [2025-02-06 09:51:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:51:32,480 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2103 transitions. [2025-02-06 09:51:32,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 22.666666666666668) internal successors, (408), 18 states have internal predecessors, (408), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 09:51:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2103 transitions. [2025-02-06 09:51:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2025-02-06 09:51:32,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:51:32,486 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, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:51:32,542 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-06 09:51:32,686 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-06 09:51:32,687 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:51:32,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:51:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash -554698494, now seen corresponding path program 1 times [2025-02-06 09:51:32,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:51:32,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069254082] [2025-02-06 09:51:32,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:51:32,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:51:32,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 842 statements into 1 equivalence classes. [2025-02-06 09:51:32,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 842 of 842 statements. [2025-02-06 09:51:32,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:51:32,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:51:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3383 backedges. 1337 proven. 0 refuted. 0 times theorem prover too weak. 2046 trivial. 0 not checked. [2025-02-06 09:51:33,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:51:33,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069254082] [2025-02-06 09:51:33,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069254082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:51:33,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:51:33,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:51:33,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564491372] [2025-02-06 09:51:33,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:51:33,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:51:33,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:51:33,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:51:33,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:51:33,341 INFO L87 Difference]: Start difference. First operand 1592 states and 2103 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-06 09:51:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:51:33,405 INFO L93 Difference]: Finished difference Result 1529 states and 2029 transitions. [2025-02-06 09:51:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:51:33,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 842 [2025-02-06 09:51:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:51:33,410 INFO L225 Difference]: With dead ends: 1529 [2025-02-06 09:51:33,410 INFO L226 Difference]: Without dead ends: 1529 [2025-02-06 09:51:33,411 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-06 09:51:33,411 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 9 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:51:33,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1007 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:51:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2025-02-06 09:51:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1529. [2025-02-06 09:51:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1504 states have (on average 1.3251329787234043) internal successors, (1993), 1511 states have internal predecessors, (1993), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 09:51:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2029 transitions. [2025-02-06 09:51:33,430 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2029 transitions. Word has length 842 [2025-02-06 09:51:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:51:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2029 transitions. [2025-02-06 09:51:33,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-06 09:51:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2029 transitions. [2025-02-06 09:51:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2025-02-06 09:51:33,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:51:33,436 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:51:33,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:51:33,436 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:51:33,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:51:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash 371066668, now seen corresponding path program 1 times [2025-02-06 09:51:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:51:33,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040712166] [2025-02-06 09:51:33,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:51:33,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:51:33,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 843 statements into 1 equivalence classes.