./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-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_test10-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 b06fba6fbf61d996c1af57497d908c6dba492febf0212a36ee7b28f5806d365e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:50:05,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:50:05,442 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:05,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:50:05,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:50:05,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:50:05,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:50:05,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:50:05,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 09:50:05,478 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 09:50:05,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:50:05,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:50:05,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:50:05,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:50:05,479 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:50:05,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:50:05,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:50:05,479 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:50:05,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:50:05,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:50:05,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:50:05,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:50:05,480 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 09:50:05,480 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 09:50:05,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:50:05,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:50:05,480 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 09:50:05,480 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:50:05,480 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:50:05,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:50:05,480 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:50:05,481 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:50:05,481 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:50:05,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:50:05,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 09:50:05,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:50:05,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:50:05,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:50:05,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:50:05,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:50:05,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:50:05,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:50:05,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:50:05,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:50:05,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:50:05,482 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 -> b06fba6fbf61d996c1af57497d908c6dba492febf0212a36ee7b28f5806d365e [2025-02-06 09:50:05,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:50:05,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:50:05,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:50:05,741 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:50:05,742 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:50:05,743 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_test10-1.i [2025-02-06 09:50:06,928 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da9c7c8c8/b0e395696c6640aca330d7b3a78325fd/FLAG54e566d49 [2025-02-06 09:50:07,307 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:50:07,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i [2025-02-06 09:50:07,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da9c7c8c8/b0e395696c6640aca330d7b3a78325fd/FLAG54e566d49 [2025-02-06 09:50:07,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da9c7c8c8/b0e395696c6640aca330d7b3a78325fd [2025-02-06 09:50:07,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:50:07,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:50:07,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:50:07,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:50:07,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:50:07,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:50:07" (1/1) ... [2025-02-06 09:50:07,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eedadb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:07, skipping insertion in model container [2025-02-06 09:50:07,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:50:07" (1/1) ... [2025-02-06 09:50:07,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:50:07,803 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:07,826 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:07,828 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:07,830 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:07,834 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:07,852 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:07,854 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:07,855 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:07,858 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:07,877 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:07,877 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:07,878 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:07,879 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:07,892 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:07,892 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:07,897 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:07,898 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:07,919 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:07,919 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:07,925 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:07,925 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:07,938 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:07,938 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:07,939 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:07,940 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:07,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:50:07,972 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:50:08,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:50:08,130 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:50:08,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:08 WrapperNode [2025-02-06 09:50:08,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:50:08,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:50:08,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:50:08,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:50:08,136 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:08" (1/1) ... [2025-02-06 09:50:08,158 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:08" (1/1) ... [2025-02-06 09:50:08,232 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3310 [2025-02-06 09:50:08,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:50:08,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:50:08,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:50:08,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:50:08,240 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:08" (1/1) ... [2025-02-06 09:50:08,241 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:08" (1/1) ... [2025-02-06 09:50:08,288 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:08" (1/1) ... [2025-02-06 09:50:08,383 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2025-02-06 09:50:08,383 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:08" (1/1) ... [2025-02-06 09:50:08,383 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:08" (1/1) ... [2025-02-06 09:50:08,428 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:08" (1/1) ... [2025-02-06 09:50:08,436 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:08" (1/1) ... [2025-02-06 09:50:08,442 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:08" (1/1) ... [2025-02-06 09:50:08,452 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:08" (1/1) ... [2025-02-06 09:50:08,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:50:08,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:50:08,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:50:08,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:50:08,474 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:08" (1/1) ... [2025-02-06 09:50:08,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:50:08,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:50:08,505 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:08,508 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:08,525 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-02-06 09:50:08,526 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-02-06 09:50:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 09:50:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 09:50:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 09:50:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 09:50:08,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 09:50:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 09:50:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 09:50:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 09:50:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 09:50:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 09:50:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 09:50:08,527 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 09:50:08,527 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 09:50:08,527 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 09:50:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 09:50:08,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:50:08,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:50:08,757 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:50:08,758 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:50:10,469 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: 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:10,642 INFO L? ?]: Removed 782 outVars from TransFormulas that were not future-live. [2025-02-06 09:50:10,642 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:50:10,710 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:50:10,710 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 09:50:10,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:50:10 BoogieIcfgContainer [2025-02-06 09:50:10,710 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:50:10,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:50:10,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:50:10,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:50:10,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:50:07" (1/3) ... [2025-02-06 09:50:10,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f294168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:50:10, skipping insertion in model container [2025-02-06 09:50:10,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:50:08" (2/3) ... [2025-02-06 09:50:10,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f294168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:50:10, skipping insertion in model container [2025-02-06 09:50:10,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:50:10" (3/3) ... [2025-02-06 09:50:10,717 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-1.i [2025-02-06 09:50:10,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:50:10,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test10-1.i that has 6 procedures, 1033 locations, 1 initial locations, 84 loop locations, and 2 error locations. [2025-02-06 09:50:10,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:50:10,767 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;@1dfaf09e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:50:10,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 09:50:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 1025 states, 1005 states have (on average 1.6218905472636815) internal successors, (1630), 1011 states have internal predecessors, (1630), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 09:50:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 09:50:10,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:10,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:10,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:10,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash 934581622, now seen corresponding path program 1 times [2025-02-06 09:50:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:10,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796247526] [2025-02-06 09:50:10,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:10,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:10,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 09:50:10,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 09:50:10,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:10,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:10,890 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:10,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:10,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796247526] [2025-02-06 09:50:10,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796247526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:10,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:10,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:50:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079542076] [2025-02-06 09:50:10,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:10,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:50:10,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:10,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:50:10,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:50:10,917 INFO L87 Difference]: Start difference. First operand has 1025 states, 1005 states have (on average 1.6218905472636815) internal successors, (1630), 1011 states have internal predecessors, (1630), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:11,103 INFO L93 Difference]: Finished difference Result 1024 states and 1509 transitions. [2025-02-06 09:50:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:50:11,104 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 09:50:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:11,113 INFO L225 Difference]: With dead ends: 1024 [2025-02-06 09:50:11,113 INFO L226 Difference]: Without dead ends: 1022 [2025-02-06 09:50:11,114 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,116 INFO L435 NwaCegarLoop]: 1389 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:11,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1389 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:50:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-02-06 09:50:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2025-02-06 09:50:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1003 states have (on average 1.4745762711864407) internal successors, (1479), 1008 states have internal predecessors, (1479), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 09:50:11,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1507 transitions. [2025-02-06 09:50:11,203 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1507 transitions. Word has length 14 [2025-02-06 09:50:11,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:11,206 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1507 transitions. [2025-02-06 09:50:11,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1507 transitions. [2025-02-06 09:50:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 09:50:11,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:11,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:11,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:50:11,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:11,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash -436062841, now seen corresponding path program 1 times [2025-02-06 09:50:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:11,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488302005] [2025-02-06 09:50:11,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:11,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 09:50:11,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 09:50:11,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:11,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:11,617 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,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:11,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488302005] [2025-02-06 09:50:11,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488302005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:11,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:11,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:50:11,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601191362] [2025-02-06 09:50:11,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:11,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:50:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:11,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:50:11,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:50:11,622 INFO L87 Difference]: Start difference. First operand 1022 states and 1507 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:12,031 INFO L93 Difference]: Finished difference Result 1404 states and 2064 transitions. [2025-02-06 09:50:12,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:50:12,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-06 09:50:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:12,040 INFO L225 Difference]: With dead ends: 1404 [2025-02-06 09:50:12,040 INFO L226 Difference]: Without dead ends: 1404 [2025-02-06 09:50:12,041 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,042 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 544 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4082 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:12,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4082 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 09:50:12,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-02-06 09:50:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1024. [2025-02-06 09:50:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1005 states have (on average 1.4736318407960198) internal successors, (1481), 1010 states have internal predecessors, (1481), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 09:50:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1509 transitions. [2025-02-06 09:50:12,063 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1509 transitions. Word has length 68 [2025-02-06 09:50:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:12,063 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1509 transitions. [2025-02-06 09:50:12,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1509 transitions. [2025-02-06 09:50:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 09:50:12,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:12,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:50:12,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:12,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:12,068 INFO L85 PathProgramCache]: Analyzing trace with hash -774105372, now seen corresponding path program 1 times [2025-02-06 09:50:12,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:12,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084582114] [2025-02-06 09:50:12,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:12,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:12,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 09:50:12,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 09:50:12,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:12,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:12,638 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,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:12,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084582114] [2025-02-06 09:50:12,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084582114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:12,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:12,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:50:12,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026186686] [2025-02-06 09:50:12,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:12,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:50:12,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:12,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:50:12,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:50:12,640 INFO L87 Difference]: Start difference. First operand 1024 states and 1509 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:13,028 INFO L93 Difference]: Finished difference Result 1404 states and 2063 transitions. [2025-02-06 09:50:13,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:50:13,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-02-06 09:50:13,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:13,033 INFO L225 Difference]: With dead ends: 1404 [2025-02-06 09:50:13,033 INFO L226 Difference]: Without dead ends: 1404 [2025-02-06 09:50:13,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:50:13,034 INFO L435 NwaCegarLoop]: 1429 mSDtfsCounter, 1082 mSDsluCounter, 3241 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 4670 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:13,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 4670 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 09:50:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-02-06 09:50:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1027. [2025-02-06 09:50:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1008 states have (on average 1.4722222222222223) internal successors, (1484), 1013 states have internal predecessors, (1484), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 09:50:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1512 transitions. [2025-02-06 09:50:13,083 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1512 transitions. Word has length 144 [2025-02-06 09:50:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:13,084 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1512 transitions. [2025-02-06 09:50:13,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1512 transitions. [2025-02-06 09:50:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-06 09:50:13,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:13,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:50:13,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:13,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1739613428, now seen corresponding path program 1 times [2025-02-06 09:50:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:13,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215625326] [2025-02-06 09:50:13,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:13,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-06 09:50:13,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-06 09:50:13,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:13,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:13,392 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:13,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:13,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215625326] [2025-02-06 09:50:13,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215625326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:13,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:13,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:50:13,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810464022] [2025-02-06 09:50:13,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:13,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:50:13,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:13,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:50:13,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:50:13,394 INFO L87 Difference]: Start difference. First operand 1027 states and 1512 transitions. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:13,638 INFO L93 Difference]: Finished difference Result 985 states and 1435 transitions. [2025-02-06 09:50:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:50:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2025-02-06 09:50:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:13,642 INFO L225 Difference]: With dead ends: 985 [2025-02-06 09:50:13,642 INFO L226 Difference]: Without dead ends: 985 [2025-02-06 09:50:13,642 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:13,643 INFO L435 NwaCegarLoop]: 1293 mSDtfsCounter, 33 mSDsluCounter, 2570 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:13,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3863 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:50:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-02-06 09:50:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2025-02-06 09:50:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 966 states have (on average 1.4565217391304348) internal successors, (1407), 971 states have internal predecessors, (1407), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 09:50:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1435 transitions. [2025-02-06 09:50:13,683 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1435 transitions. Word has length 214 [2025-02-06 09:50:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:13,683 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1435 transitions. [2025-02-06 09:50:13,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1435 transitions. [2025-02-06 09:50:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-06 09:50:13,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:13,685 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:50:13,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:13,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash -953483331, now seen corresponding path program 1 times [2025-02-06 09:50:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:13,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034409679] [2025-02-06 09:50:13,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:13,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-06 09:50:13,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-06 09:50:13,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:13,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:13,934 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:13,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:13,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034409679] [2025-02-06 09:50:13,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034409679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:13,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:13,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:50:13,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661575318] [2025-02-06 09:50:13,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:13,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:50:13,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:13,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:50:13,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:50:13,936 INFO L87 Difference]: Start difference. First operand 985 states and 1435 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:14,102 INFO L93 Difference]: Finished difference Result 985 states and 1432 transitions. [2025-02-06 09:50:14,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:50:14,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2025-02-06 09:50:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:14,106 INFO L225 Difference]: With dead ends: 985 [2025-02-06 09:50:14,106 INFO L226 Difference]: Without dead ends: 985 [2025-02-06 09:50:14,106 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:14,106 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 2 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:14,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2592 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:50:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-02-06 09:50:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2025-02-06 09:50:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 966 states have (on average 1.453416149068323) internal successors, (1404), 971 states have internal predecessors, (1404), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 09:50:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1432 transitions. [2025-02-06 09:50:14,121 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1432 transitions. Word has length 214 [2025-02-06 09:50:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:14,121 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1432 transitions. [2025-02-06 09:50:14,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1432 transitions. [2025-02-06 09:50:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-06 09:50:14,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:14,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:50:14,124 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:14,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1979710278, now seen corresponding path program 1 times [2025-02-06 09:50:14,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:14,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041942853] [2025-02-06 09:50:14,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:14,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:14,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-06 09:50:14,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-06 09:50:14,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:14,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:14,324 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:14,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:14,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041942853] [2025-02-06 09:50:14,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041942853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:14,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:14,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:50:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74713916] [2025-02-06 09:50:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:14,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:50:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:14,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:50:14,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:50:14,326 INFO L87 Difference]: Start difference. First operand 985 states and 1432 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:14,560 INFO L93 Difference]: Finished difference Result 1515 states and 2209 transitions. [2025-02-06 09:50:14,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:50:14,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2025-02-06 09:50:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:14,565 INFO L225 Difference]: With dead ends: 1515 [2025-02-06 09:50:14,565 INFO L226 Difference]: Without dead ends: 1515 [2025-02-06 09:50:14,565 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:14,566 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 715 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:14,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 2604 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:50:14,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2025-02-06 09:50:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1354. [2025-02-06 09:50:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1333 states have (on average 1.45536384096024) internal successors, (1940), 1338 states have internal predecessors, (1940), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 09:50:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1972 transitions. [2025-02-06 09:50:14,588 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1972 transitions. Word has length 214 [2025-02-06 09:50:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:14,588 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1972 transitions. [2025-02-06 09:50:14,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:50:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1972 transitions. [2025-02-06 09:50:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-06 09:50:14,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:14,591 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:50:14,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:14,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:14,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1605573484, now seen corresponding path program 1 times [2025-02-06 09:50:14,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:14,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306161560] [2025-02-06 09:50:14,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:14,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:14,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-06 09:50:14,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-06 09:50:14,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:14,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:14,883 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,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:14,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306161560] [2025-02-06 09:50:14,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306161560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:14,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:14,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:50:14,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405380219] [2025-02-06 09:50:14,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:14,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:50:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:14,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:50:14,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:50:14,885 INFO L87 Difference]: Start difference. First operand 1354 states and 1972 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:50:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:15,187 INFO L93 Difference]: Finished difference Result 1312 states and 1895 transitions. [2025-02-06 09:50:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:50:15,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 229 [2025-02-06 09:50:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:15,193 INFO L225 Difference]: With dead ends: 1312 [2025-02-06 09:50:15,193 INFO L226 Difference]: Without dead ends: 1312 [2025-02-06 09:50:15,193 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:15,194 INFO L435 NwaCegarLoop]: 1221 mSDtfsCounter, 30 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3644 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:15,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3644 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 09:50:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-02-06 09:50:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2025-02-06 09:50:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1291 states have (on average 1.4430673896204493) internal successors, (1863), 1296 states have internal predecessors, (1863), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 09:50:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1895 transitions. [2025-02-06 09:50:15,218 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1895 transitions. Word has length 229 [2025-02-06 09:50:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:15,219 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1895 transitions. [2025-02-06 09:50:15,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:50:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1895 transitions. [2025-02-06 09:50:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-06 09:50:15,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:15,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:50:15,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:15,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:15,225 INFO L85 PathProgramCache]: Analyzing trace with hash 901210162, now seen corresponding path program 1 times [2025-02-06 09:50:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:15,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813723759] [2025-02-06 09:50:15,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:15,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:15,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-06 09:50:15,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-06 09:50:15,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:15,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:15,489 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:15,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:15,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813723759] [2025-02-06 09:50:15,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813723759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:15,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:15,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:50:15,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466975139] [2025-02-06 09:50:15,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:15,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:50:15,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:15,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:50:15,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:50:15,491 INFO L87 Difference]: Start difference. First operand 1312 states and 1895 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:50:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:15,698 INFO L93 Difference]: Finished difference Result 1881 states and 2725 transitions. [2025-02-06 09:50:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:50:15,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 229 [2025-02-06 09:50:15,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:15,705 INFO L225 Difference]: With dead ends: 1881 [2025-02-06 09:50:15,705 INFO L226 Difference]: Without dead ends: 1881 [2025-02-06 09:50:15,706 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:15,706 INFO L435 NwaCegarLoop]: 1418 mSDtfsCounter, 596 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:15,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 2638 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:50:15,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2025-02-06 09:50:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1873. [2025-02-06 09:50:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1846 states have (on average 1.4479956663055256) internal successors, (2673), 1851 states have internal predecessors, (2673), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 09:50:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2717 transitions. [2025-02-06 09:50:15,743 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2717 transitions. Word has length 229 [2025-02-06 09:50:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:15,744 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 2717 transitions. [2025-02-06 09:50:15,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:50:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2717 transitions. [2025-02-06 09:50:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-02-06 09:50:15,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:15,746 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:50:15,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:15,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:15,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1126107324, now seen corresponding path program 1 times [2025-02-06 09:50:15,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:15,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729970120] [2025-02-06 09:50:15,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:15,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:15,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-06 09:50:15,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-06 09:50:15,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:15,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:50:16,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:16,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729970120] [2025-02-06 09:50:16,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729970120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:16,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:16,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:50:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938865391] [2025-02-06 09:50:16,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:16,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:50:16,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:16,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:50:16,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:50:16,081 INFO L87 Difference]: Start difference. First operand 1873 states and 2717 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 09:50:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:16,481 INFO L93 Difference]: Finished difference Result 1447 states and 2075 transitions. [2025-02-06 09:50:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:50:16,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 244 [2025-02-06 09:50:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:16,487 INFO L225 Difference]: With dead ends: 1447 [2025-02-06 09:50:16,487 INFO L226 Difference]: Without dead ends: 1447 [2025-02-06 09:50:16,488 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:16,488 INFO L435 NwaCegarLoop]: 1267 mSDtfsCounter, 2361 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:16,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 1452 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 09:50:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-02-06 09:50:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2025-02-06 09:50:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1425 states have (on average 1.432280701754386) internal successors, (2041), 1430 states have internal predecessors, (2041), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 09:50:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2075 transitions. [2025-02-06 09:50:16,515 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2075 transitions. Word has length 244 [2025-02-06 09:50:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:16,517 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 2075 transitions. [2025-02-06 09:50:16,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 09:50:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2075 transitions. [2025-02-06 09:50:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-06 09:50:16,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:16,519 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:50:16,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:16,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash -767698230, now seen corresponding path program 1 times [2025-02-06 09:50:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:16,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562350680] [2025-02-06 09:50:16,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:16,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:16,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-06 09:50:16,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-06 09:50:16,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:16,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 09:50:16,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:16,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562350680] [2025-02-06 09:50:16,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562350680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:16,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:16,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:50:16,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149921130] [2025-02-06 09:50:16,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:16,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:50:16,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:16,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:50:16,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:50:16,954 INFO L87 Difference]: Start difference. First operand 1447 states and 2075 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:50:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:17,227 INFO L93 Difference]: Finished difference Result 1405 states and 1998 transitions. [2025-02-06 09:50:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:50:17,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 254 [2025-02-06 09:50:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:17,235 INFO L225 Difference]: With dead ends: 1405 [2025-02-06 09:50:17,235 INFO L226 Difference]: Without dead ends: 1405 [2025-02-06 09:50:17,236 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:17,236 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 30 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3416 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:17,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3416 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:50:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2025-02-06 09:50:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2025-02-06 09:50:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1383 states have (on average 1.4201012292118582) internal successors, (1964), 1388 states have internal predecessors, (1964), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 09:50:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1998 transitions. [2025-02-06 09:50:17,266 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1998 transitions. Word has length 254 [2025-02-06 09:50:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:17,267 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1998 transitions. [2025-02-06 09:50:17,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:50:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1998 transitions. [2025-02-06 09:50:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-06 09:50:17,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:17,270 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:50:17,270 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:17,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:17,271 INFO L85 PathProgramCache]: Analyzing trace with hash -782280559, now seen corresponding path program 1 times [2025-02-06 09:50:17,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:17,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678559582] [2025-02-06 09:50:17,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:17,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:17,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-06 09:50:17,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-06 09:50:17,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:17,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:50:18,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:18,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678559582] [2025-02-06 09:50:18,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678559582] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:50:18,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211308432] [2025-02-06 09:50:18,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:18,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:50:18,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:50:18,081 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:18,082 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:18,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-06 09:50:18,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-06 09:50:18,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:18,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:18,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 09:50:18,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:50:19,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:19,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 09:50:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:50:19,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:50:19,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211308432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:19,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:50:19,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-02-06 09:50:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769147994] [2025-02-06 09:50:19,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:19,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:50:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:19,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:50:19,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 09:50:19,065 INFO L87 Difference]: Start difference. First operand 1405 states and 1998 transitions. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:50:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:19,580 INFO L93 Difference]: Finished difference Result 1727 states and 2431 transitions. [2025-02-06 09:50:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:50:19,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 254 [2025-02-06 09:50:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:19,586 INFO L225 Difference]: With dead ends: 1727 [2025-02-06 09:50:19,586 INFO L226 Difference]: Without dead ends: 1727 [2025-02-06 09:50:19,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 243 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 09:50:19,587 INFO L435 NwaCegarLoop]: 1103 mSDtfsCounter, 1263 mSDsluCounter, 3568 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 4671 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:19,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 4671 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 09:50:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2025-02-06 09:50:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1574. [2025-02-06 09:50:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1542 states have (on average 1.4124513618677044) internal successors, (2178), 1551 states have internal predecessors, (2178), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 09:50:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2226 transitions. [2025-02-06 09:50:19,611 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2226 transitions. Word has length 254 [2025-02-06 09:50:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:19,611 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2226 transitions. [2025-02-06 09:50:19,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:50:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2226 transitions. [2025-02-06 09:50:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-02-06 09:50:19,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:19,614 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:50:19,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:50:19,819 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,SelfDestructingSolverStorable10 [2025-02-06 09:50:19,819 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:19,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:19,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1544257396, now seen corresponding path program 1 times [2025-02-06 09:50:19,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:19,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852975699] [2025-02-06 09:50:19,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:19,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:19,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-02-06 09:50:20,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-02-06 09:50:20,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:20,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:50:20,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:20,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852975699] [2025-02-06 09:50:20,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852975699] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:50:20,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745251977] [2025-02-06 09:50:20,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:20,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:50:20,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:50:20,823 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:20,824 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:21,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-02-06 09:50:21,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-02-06 09:50:21,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:21,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:21,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1631 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:50:21,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:50:21,389 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 15 treesize of output 1 [2025-02-06 09:50:21,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:21,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 09:50:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:50:21,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:50:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:50:22,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745251977] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:50:22,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:50:22,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2025-02-06 09:50:22,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325302864] [2025-02-06 09:50:22,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:50:22,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 09:50:22,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:22,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 09:50:22,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 09:50:22,032 INFO L87 Difference]: Start difference. First operand 1574 states and 2226 transitions. Second operand has 12 states, 12 states have (on average 40.083333333333336) internal successors, (481), 12 states have internal predecessors, (481), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 09:50:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:22,943 INFO L93 Difference]: Finished difference Result 2506 states and 3472 transitions. [2025-02-06 09:50:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 09:50:22,943 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 40.083333333333336) internal successors, (481), 12 states have internal predecessors, (481), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 330 [2025-02-06 09:50:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:22,951 INFO L225 Difference]: With dead ends: 2506 [2025-02-06 09:50:22,951 INFO L226 Difference]: Without dead ends: 2506 [2025-02-06 09:50:22,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 650 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-02-06 09:50:22,952 INFO L435 NwaCegarLoop]: 1131 mSDtfsCounter, 2132 mSDsluCounter, 8898 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 10029 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:22,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 10029 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 09:50:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2025-02-06 09:50:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2222. [2025-02-06 09:50:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 2178 states have (on average 1.386593204775023) internal successors, (3020), 2187 states have internal predecessors, (3020), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 29 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 09:50:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 3090 transitions. [2025-02-06 09:50:22,993 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 3090 transitions. Word has length 330 [2025-02-06 09:50:22,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:22,994 INFO L471 AbstractCegarLoop]: Abstraction has 2222 states and 3090 transitions. [2025-02-06 09:50:22,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 40.083333333333336) internal successors, (481), 12 states have internal predecessors, (481), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 09:50:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 3090 transitions. [2025-02-06 09:50:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 769 [2025-02-06 09:50:23,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:23,005 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,016 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:23,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:50:23,209 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:23,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:23,210 INFO L85 PathProgramCache]: Analyzing trace with hash -210861409, now seen corresponding path program 1 times [2025-02-06 09:50:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:23,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102302011] [2025-02-06 09:50:23,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:23,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:23,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 768 statements into 1 equivalence classes. [2025-02-06 09:50:23,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 768 of 768 statements. [2025-02-06 09:50:23,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:23,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:50:27,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102302011] [2025-02-06 09:50:27,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102302011] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:50:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141893757] [2025-02-06 09:50:27,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:27,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:50:27,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:50:27,688 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:50:27,695 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:50:28,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 768 statements into 1 equivalence classes. [2025-02-06 09:50:28,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 768 of 768 statements. [2025-02-06 09:50:28,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:28,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:28,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 3731 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 09:50:28,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:50:28,711 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 15 treesize of output 1 [2025-02-06 09:50:29,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:29,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:29,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:29,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:29,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 09:50:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:50:29,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:50:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:50:30,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141893757] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:50:30,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:50:30,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2025-02-06 09:50:30,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695623647] [2025-02-06 09:50:30,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:50:30,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 09:50:30,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:30,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 09:50:30,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-02-06 09:50:30,140 INFO L87 Difference]: Start difference. First operand 2222 states and 3090 transitions. Second operand has 21 states, 21 states have (on average 64.9047619047619) internal successors, (1363), 21 states have internal predecessors, (1363), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 09:50:31,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:31,271 INFO L93 Difference]: Finished difference Result 4240 states and 5794 transitions. [2025-02-06 09:50:31,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 09:50:31,272 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 64.9047619047619) internal successors, (1363), 21 states have internal predecessors, (1363), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 768 [2025-02-06 09:50:31,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:31,284 INFO L225 Difference]: With dead ends: 4240 [2025-02-06 09:50:31,284 INFO L226 Difference]: Without dead ends: 4240 [2025-02-06 09:50:31,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1559 GetRequests, 1523 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2025-02-06 09:50:31,285 INFO L435 NwaCegarLoop]: 1131 mSDtfsCounter, 6870 mSDsluCounter, 9525 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6912 SdHoareTripleChecker+Valid, 10656 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:31,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6912 Valid, 10656 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 09:50:31,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4240 states. [2025-02-06 09:50:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4240 to 3956. [2025-02-06 09:50:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3888 states have (on average 1.3616255144032923) internal successors, (5294), 3897 states have internal predecessors, (5294), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 09:50:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 5412 transitions. [2025-02-06 09:50:31,341 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 5412 transitions. Word has length 768 [2025-02-06 09:50:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:31,342 INFO L471 AbstractCegarLoop]: Abstraction has 3956 states and 5412 transitions. [2025-02-06 09:50:31,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 64.9047619047619) internal successors, (1363), 21 states have internal predecessors, (1363), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 09:50:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 5412 transitions. [2025-02-06 09:50:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2025-02-06 09:50:31,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:31,391 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 09:50:31,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:50:31,592 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:31,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:31,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2137833013, now seen corresponding path program 2 times [2025-02-06 09:50:31,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:31,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853263854] [2025-02-06 09:50:31,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:50:31,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:32,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1644 statements into 2 equivalence classes. [2025-02-06 09:50:32,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 78 of 1644 statements. [2025-02-06 09:50:32,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:50:32,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 09:50:32,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853263854] [2025-02-06 09:50:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853263854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:32,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:32,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:50:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40395724] [2025-02-06 09:50:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:32,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:50:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:32,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:50:32,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:50:32,250 INFO L87 Difference]: Start difference. First operand 3956 states and 5412 transitions. Second operand has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:50:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:33,377 INFO L93 Difference]: Finished difference Result 3971 states and 5428 transitions. [2025-02-06 09:50:33,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:50:33,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1644 [2025-02-06 09:50:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:33,397 INFO L225 Difference]: With dead ends: 3971 [2025-02-06 09:50:33,398 INFO L226 Difference]: Without dead ends: 3971 [2025-02-06 09:50:33,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 09:50:33,401 INFO L435 NwaCegarLoop]: 1151 mSDtfsCounter, 53 mSDsluCounter, 4369 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 5520 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:33,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 5520 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 09:50:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3971 states. [2025-02-06 09:50:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3971 to 3967. [2025-02-06 09:50:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3967 states, 3899 states have (on average 1.3606052834060016) internal successors, (5305), 3908 states have internal predecessors, (5305), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 09:50:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3967 states and 5423 transitions. [2025-02-06 09:50:33,453 INFO L78 Accepts]: Start accepts. Automaton has 3967 states and 5423 transitions. Word has length 1644 [2025-02-06 09:50:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:33,454 INFO L471 AbstractCegarLoop]: Abstraction has 3967 states and 5423 transitions. [2025-02-06 09:50:33,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:50:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3967 states and 5423 transitions. [2025-02-06 09:50:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2025-02-06 09:50:33,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:33,471 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:50:33,471 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:33,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1925955623, now seen corresponding path program 1 times [2025-02-06 09:50:33,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:33,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297995544] [2025-02-06 09:50:33,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:33,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:33,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-02-06 09:50:34,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-02-06 09:50:34,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:34,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 09:50:38,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:38,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297995544] [2025-02-06 09:50:38,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297995544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:38,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:38,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:50:38,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652707907] [2025-02-06 09:50:38,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:38,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:50:38,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:38,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:50:38,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:50:38,163 INFO L87 Difference]: Start difference. First operand 3967 states and 5423 transitions. Second operand has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:50:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:38,686 INFO L93 Difference]: Finished difference Result 3972 states and 5429 transitions. [2025-02-06 09:50:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:50:38,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1645 [2025-02-06 09:50:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:38,696 INFO L225 Difference]: With dead ends: 3972 [2025-02-06 09:50:38,696 INFO L226 Difference]: Without dead ends: 3972 [2025-02-06 09:50:38,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:50:38,697 INFO L435 NwaCegarLoop]: 1157 mSDtfsCounter, 20 mSDsluCounter, 5416 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6573 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:38,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6573 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 09:50:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2025-02-06 09:50:38,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 3971. [2025-02-06 09:50:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3903 states have (on average 1.3604919292851652) internal successors, (5310), 3912 states have internal predecessors, (5310), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 09:50:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5428 transitions. [2025-02-06 09:50:38,737 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5428 transitions. Word has length 1645 [2025-02-06 09:50:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:38,739 INFO L471 AbstractCegarLoop]: Abstraction has 3971 states and 5428 transitions. [2025-02-06 09:50:38,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:50:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5428 transitions. [2025-02-06 09:50:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2025-02-06 09:50:38,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:38,790 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:50:38,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:38,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash 726572480, now seen corresponding path program 1 times [2025-02-06 09:50:38,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:38,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274528028] [2025-02-06 09:50:38,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:39,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-02-06 09:50:39,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-02-06 09:50:39,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:39,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 09:50:42,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:42,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274528028] [2025-02-06 09:50:42,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274528028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:42,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:42,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:50:42,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779953490] [2025-02-06 09:50:42,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:42,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:50:42,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:42,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:50:42,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:50:42,920 INFO L87 Difference]: Start difference. First operand 3971 states and 5428 transitions. Second operand has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:50:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:43,449 INFO L93 Difference]: Finished difference Result 3979 states and 5438 transitions. [2025-02-06 09:50:43,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:50:43,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1645 [2025-02-06 09:50:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:43,459 INFO L225 Difference]: With dead ends: 3979 [2025-02-06 09:50:43,460 INFO L226 Difference]: Without dead ends: 3979 [2025-02-06 09:50:43,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:50:43,461 INFO L435 NwaCegarLoop]: 1151 mSDtfsCounter, 24 mSDsluCounter, 6526 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 7677 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:43,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 7677 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 09:50:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2025-02-06 09:50:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3971. [2025-02-06 09:50:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3903 states have (on average 1.3604919292851652) internal successors, (5310), 3912 states have internal predecessors, (5310), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 09:50:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5428 transitions. [2025-02-06 09:50:43,496 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5428 transitions. Word has length 1645 [2025-02-06 09:50:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:43,497 INFO L471 AbstractCegarLoop]: Abstraction has 3971 states and 5428 transitions. [2025-02-06 09:50:43,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:50:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5428 transitions. [2025-02-06 09:50:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1647 [2025-02-06 09:50:43,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:43,513 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:50:43,514 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:43,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:43,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1569608110, now seen corresponding path program 1 times [2025-02-06 09:50:43,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:43,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005194391] [2025-02-06 09:50:43,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:43,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:43,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1646 statements into 1 equivalence classes. [2025-02-06 09:50:44,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1646 of 1646 statements. [2025-02-06 09:50:44,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:44,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 09:50:47,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:47,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005194391] [2025-02-06 09:50:47,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005194391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:50:47,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:50:47,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:50:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419697225] [2025-02-06 09:50:47,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:50:47,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 09:50:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:50:47,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 09:50:47,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:50:47,484 INFO L87 Difference]: Start difference. First operand 3971 states and 5428 transitions. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:50:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:50:48,219 INFO L93 Difference]: Finished difference Result 3982 states and 5442 transitions. [2025-02-06 09:50:48,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:50:48,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1646 [2025-02-06 09:50:48,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:50:48,228 INFO L225 Difference]: With dead ends: 3982 [2025-02-06 09:50:48,228 INFO L226 Difference]: Without dead ends: 3982 [2025-02-06 09:50:48,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 09:50:48,230 INFO L435 NwaCegarLoop]: 1151 mSDtfsCounter, 31 mSDsluCounter, 7687 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8838 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 09:50:48,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8838 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 09:50:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2025-02-06 09:50:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3979. [2025-02-06 09:50:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3979 states, 3911 states have (on average 1.3602659166453592) internal successors, (5320), 3920 states have internal predecessors, (5320), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 09:50:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 5438 transitions. [2025-02-06 09:50:48,282 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 5438 transitions. Word has length 1646 [2025-02-06 09:50:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:50:48,283 INFO L471 AbstractCegarLoop]: Abstraction has 3979 states and 5438 transitions. [2025-02-06 09:50:48,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:50:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 5438 transitions. [2025-02-06 09:50:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1648 [2025-02-06 09:50:48,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:50:48,313 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:50:48,314 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:50:48,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:50:48,315 INFO L85 PathProgramCache]: Analyzing trace with hash 791691807, now seen corresponding path program 1 times [2025-02-06 09:50:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:50:48,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092796594] [2025-02-06 09:50:48,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:48,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:50:48,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1647 statements into 1 equivalence classes. [2025-02-06 09:50:49,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1647 of 1647 statements. [2025-02-06 09:50:49,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:49,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 1988 proven. 75 refuted. 0 times theorem prover too weak. 5275 trivial. 0 not checked. [2025-02-06 09:50:54,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:50:54,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092796594] [2025-02-06 09:50:54,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092796594] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:50:54,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325920566] [2025-02-06 09:50:54,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:50:54,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:50:54,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:50:54,394 INFO L229 MonitoredProcess]: Starting monitored process 5 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:54,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 09:50:55,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1647 statements into 1 equivalence classes. [2025-02-06 09:50:56,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1647 of 1647 statements. [2025-02-06 09:50:56,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:50:56,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:50:56,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 7931 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 09:50:56,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:50:57,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:57,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:57,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:57,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:57,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:58,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:58,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:58,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:58,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:58,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:58,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 09:50:58,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 09:50:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 42 proven. 7272 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:50:58,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:51:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 42 proven. 7272 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 09:51:00,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325920566] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:51:00,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:51:00,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 16] total 34 [2025-02-06 09:51:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853285212] [2025-02-06 09:51:00,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:51:00,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 09:51:00,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:51:00,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 09:51:00,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=735, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 09:51:00,676 INFO L87 Difference]: Start difference. First operand 3979 states and 5438 transitions. Second operand has 34 states, 34 states have (on average 98.47058823529412) internal successors, (3348), 34 states have internal predecessors, (3348), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 09:51:03,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 09:51:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:51:05,908 INFO L93 Difference]: Finished difference Result 7326 states and 9950 transitions. [2025-02-06 09:51:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-02-06 09:51:05,909 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 98.47058823529412) internal successors, (3348), 34 states have internal predecessors, (3348), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1647 [2025-02-06 09:51:05,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:51:05,920 INFO L225 Difference]: With dead ends: 7326 [2025-02-06 09:51:05,921 INFO L226 Difference]: Without dead ends: 7326 [2025-02-06 09:51:05,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3350 GetRequests, 3264 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1731, Invalid=4749, Unknown=0, NotChecked=0, Total=6480 [2025-02-06 09:51:05,923 INFO L435 NwaCegarLoop]: 1098 mSDtfsCounter, 9520 mSDsluCounter, 9845 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9592 SdHoareTripleChecker+Valid, 10943 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:51:05,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9592 Valid, 10943 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 09:51:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7326 states. [2025-02-06 09:51:05,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7326 to 7323. [2025-02-06 09:51:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7323 states, 7189 states have (on average 1.349005424954792) internal successors, (9698), 7198 states have internal predecessors, (9698), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (125), 119 states have call predecessors, (125), 125 states have call successors, (125) [2025-02-06 09:51:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7323 states to 7323 states and 9948 transitions. [2025-02-06 09:51:05,976 INFO L78 Accepts]: Start accepts. Automaton has 7323 states and 9948 transitions. Word has length 1647 [2025-02-06 09:51:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:51:05,977 INFO L471 AbstractCegarLoop]: Abstraction has 7323 states and 9948 transitions. [2025-02-06 09:51:05,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 98.47058823529412) internal successors, (3348), 34 states have internal predecessors, (3348), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 09:51:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7323 states and 9948 transitions. [2025-02-06 09:51:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3320 [2025-02-06 09:51:06,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:51:06,144 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 09:51:06,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 09:51:06,345 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:51:06,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:51:06,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1992242909, now seen corresponding path program 2 times [2025-02-06 09:51:06,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:51:06,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304383425] [2025-02-06 09:51:06,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:51:06,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:51:07,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3319 statements into 2 equivalence classes. [2025-02-06 09:51:07,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 81 of 3319 statements. [2025-02-06 09:51:07,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:51:07,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:51:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 43286 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43286 trivial. 0 not checked. [2025-02-06 09:51:07,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:51:07,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304383425] [2025-02-06 09:51:07,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304383425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:51:07,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:51:07,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 09:51:07,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016465356] [2025-02-06 09:51:07,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:51:07,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:51:07,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:51:07,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:51:07,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:51:07,380 INFO L87 Difference]: Start difference. First operand 7323 states and 9948 transitions. Second operand has 13 states, 13 states have (on average 18.76923076923077) internal successors, (244), 13 states have internal predecessors, (244), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:51:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:51:08,342 INFO L93 Difference]: Finished difference Result 7368 states and 10012 transitions. [2025-02-06 09:51:08,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:51:08,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.76923076923077) internal successors, (244), 13 states have internal predecessors, (244), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 3319 [2025-02-06 09:51:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:51:08,354 INFO L225 Difference]: With dead ends: 7368 [2025-02-06 09:51:08,354 INFO L226 Difference]: Without dead ends: 7368 [2025-02-06 09:51:08,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 09:51:08,355 INFO L435 NwaCegarLoop]: 1158 mSDtfsCounter, 85 mSDsluCounter, 8969 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 10127 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 09:51:08,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 10127 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1646 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 09:51:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7368 states. [2025-02-06 09:51:08,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7368 to 7329. [2025-02-06 09:51:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7329 states, 7195 states have (on average 1.3489923558026407) internal successors, (9706), 7204 states have internal predecessors, (9706), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (125), 119 states have call predecessors, (125), 125 states have call successors, (125) [2025-02-06 09:51:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7329 states to 7329 states and 9956 transitions. [2025-02-06 09:51:08,415 INFO L78 Accepts]: Start accepts. Automaton has 7329 states and 9956 transitions. Word has length 3319 [2025-02-06 09:51:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:51:08,416 INFO L471 AbstractCegarLoop]: Abstraction has 7329 states and 9956 transitions. [2025-02-06 09:51:08,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.76923076923077) internal successors, (244), 13 states have internal predecessors, (244), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:51:08,417 INFO L276 IsEmpty]: Start isEmpty. Operand 7329 states and 9956 transitions. [2025-02-06 09:51:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3320 [2025-02-06 09:51:08,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:51:08,464 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:51:08,464 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:51:08,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:51:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1399133990, now seen corresponding path program 1 times [2025-02-06 09:51:08,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:51:08,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242689106] [2025-02-06 09:51:08,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:51:08,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:51:09,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3319 statements into 1 equivalence classes. [2025-02-06 09:51:10,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3319 of 3319 statements. [2025-02-06 09:51:10,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:51:10,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:51:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 43286 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43286 trivial. 0 not checked. [2025-02-06 09:51:18,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:51:18,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242689106] [2025-02-06 09:51:18,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242689106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:51:18,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:51:18,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:51:18,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410763266] [2025-02-06 09:51:18,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:51:18,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:51:18,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:51:18,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:51:18,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:51:18,253 INFO L87 Difference]: Start difference. First operand 7329 states and 9956 transitions. Second operand has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:51:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:51:18,645 INFO L93 Difference]: Finished difference Result 7332 states and 9959 transitions. [2025-02-06 09:51:18,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:51:18,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 3319 [2025-02-06 09:51:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:51:18,656 INFO L225 Difference]: With dead ends: 7332 [2025-02-06 09:51:18,657 INFO L226 Difference]: Without dead ends: 7332 [2025-02-06 09:51:18,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:51:18,657 INFO L435 NwaCegarLoop]: 1160 mSDtfsCounter, 15 mSDsluCounter, 4364 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5524 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 09:51:18,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5524 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 09:51:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7332 states. [2025-02-06 09:51:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7332 to 7332. [2025-02-06 09:51:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7332 states, 7198 states have (on average 1.3488469019171991) internal successors, (9709), 7207 states have internal predecessors, (9709), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (125), 119 states have call predecessors, (125), 125 states have call successors, (125) [2025-02-06 09:51:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7332 states to 7332 states and 9959 transitions. [2025-02-06 09:51:18,710 INFO L78 Accepts]: Start accepts. Automaton has 7332 states and 9959 transitions. Word has length 3319 [2025-02-06 09:51:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:51:18,712 INFO L471 AbstractCegarLoop]: Abstraction has 7332 states and 9959 transitions. [2025-02-06 09:51:18,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 09:51:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 7332 states and 9959 transitions. [2025-02-06 09:51:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3321 [2025-02-06 09:51:18,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:51:18,761 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:51:18,762 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:51:18,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:51:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash 147769123, now seen corresponding path program 1 times [2025-02-06 09:51:18,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:51:18,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848813964] [2025-02-06 09:51:18,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:51:18,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:51:19,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3320 statements into 1 equivalence classes. [2025-02-06 09:51:21,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3320 of 3320 statements. [2025-02-06 09:51:21,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:51:21,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat