./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce6a3162e09155ad765d255c42023f1cbec9d995c66c63f43c14fadd8640484e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:34:34,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:34:34,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-17 11:34:34,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:34:34,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:34:34,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:34:34,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:34:34,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:34:34,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:34:34,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:34:34,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:34:34,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:34:34,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:34:34,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:34:34,798 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:34:34,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:34:34,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:34:34,799 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:34:34,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:34:34,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:34:34,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:34:34,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:34:34,799 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:34:34,799 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:34:34,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:34:34,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:34:34,799 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:34:34,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:34:34,800 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:34:34,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:34:34,800 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:34:34,800 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:34:34,800 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:34:34,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:34:34,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:34:34,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:34:34,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:34:34,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:34:34,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:34:34,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:34:34,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:34:34,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:34:34,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:34:34,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:34:34,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:34:34,801 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce6a3162e09155ad765d255c42023f1cbec9d995c66c63f43c14fadd8640484e [2025-03-17 11:34:35,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:34:35,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:34:35,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:34:35,037 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:34:35,038 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:34:35,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i [2025-03-17 11:34:36,160 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba14d7dc4/1417a78b21c944deb480bef96447bc1a/FLAG0b84315ad [2025-03-17 11:34:36,473 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:34:36,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i [2025-03-17 11:34:36,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba14d7dc4/1417a78b21c944deb480bef96447bc1a/FLAG0b84315ad [2025-03-17 11:34:36,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba14d7dc4/1417a78b21c944deb480bef96447bc1a [2025-03-17 11:34:36,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:34:36,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:34:36,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:34:36,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:34:36,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:34:36,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:34:36" (1/1) ... [2025-03-17 11:34:36,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5532132c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:36, skipping insertion in model container [2025-03-17 11:34:36,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:34:36" (1/1) ... [2025-03-17 11:34:36,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:34:37,025 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,052 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,058 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,061 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,067 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,087 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,091 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,092 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,095 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,111 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,112 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,113 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,113 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,131 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,132 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,133 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,134 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,147 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,147 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,148 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,148 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,158 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,159 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,160 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,160 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:37,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:34:37,180 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:34:37,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:34:37,347 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:34:37,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37 WrapperNode [2025-03-17 11:34:37,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:34:37,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:34:37,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:34:37,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:34:37,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (1/1) ... [2025-03-17 11:34:37,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (1/1) ... [2025-03-17 11:34:37,452 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3310 [2025-03-17 11:34:37,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:34:37,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:34:37,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:34:37,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:34:37,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (1/1) ... [2025-03-17 11:34:37,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (1/1) ... [2025-03-17 11:34:37,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (1/1) ... [2025-03-17 11:34:37,611 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-03-17 11:34:37,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (1/1) ... [2025-03-17 11:34:37,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (1/1) ... [2025-03-17 11:34:37,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (1/1) ... [2025-03-17 11:34:37,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (1/1) ... [2025-03-17 11:34:37,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (1/1) ... [2025-03-17 11:34:37,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (1/1) ... [2025-03-17 11:34:37,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:34:37,703 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:34:37,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:34:37,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:34:37,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (1/1) ... [2025-03-17 11:34:37,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:34:37,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:34:37,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:34:37,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:34:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-17 11:34:37,749 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-17 11:34:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:34:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:34:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 11:34:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 11:34:37,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 11:34:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:34:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:34:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 11:34:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 11:34:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 11:34:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 11:34:37,750 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 11:34:37,750 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 11:34:37,750 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 11:34:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:34:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:34:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:34:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:34:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 11:34:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:34:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:34:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:34:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 11:34:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:34:37,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:34:37,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:34:37,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 11:34:37,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:34:37,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:34:37,934 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:34:37,935 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:34:39,811 INFO L1322 $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-03-17 11:34:39,994 INFO L? ?]: Removed 782 outVars from TransFormulas that were not future-live. [2025-03-17 11:34:39,994 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:34:40,089 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:34:40,089 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 11:34:40,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:34:40 BoogieIcfgContainer [2025-03-17 11:34:40,089 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:34:40,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:34:40,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:34:40,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:34:40,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:34:36" (1/3) ... [2025-03-17 11:34:40,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f9f56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:34:40, skipping insertion in model container [2025-03-17 11:34:40,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:37" (2/3) ... [2025-03-17 11:34:40,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f9f56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:34:40, skipping insertion in model container [2025-03-17 11:34:40,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:34:40" (3/3) ... [2025-03-17 11:34:40,099 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-1.i [2025-03-17 11:34:40,111 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:34:40,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test10-1.i that has 6 procedures, 1026 locations, 1 initial locations, 78 loop locations, and 2 error locations. [2025-03-17 11:34:40,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:34:40,179 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;@44fff5a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:34:40,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 11:34:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 1018 states, 998 states have (on average 1.62625250501002) internal successors, (1623), 1004 states have internal predecessors, (1623), 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-03-17 11:34:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:34:40,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:40,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:34:40,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:40,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:40,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1457075004, now seen corresponding path program 1 times [2025-03-17 11:34:40,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:40,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166014070] [2025-03-17 11:34:40,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:40,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:40,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:34:40,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:34:40,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:40,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:34:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:40,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166014070] [2025-03-17 11:34:40,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166014070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:40,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:40,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:34:40,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609292017] [2025-03-17 11:34:40,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:40,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:34:40,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:40,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:34:40,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:34:40,353 INFO L87 Difference]: Start difference. First operand has 1018 states, 998 states have (on average 1.62625250501002) internal successors, (1623), 1004 states have internal predecessors, (1623), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-03-17 11:34:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:40,577 INFO L93 Difference]: Finished difference Result 1017 states and 1502 transitions. [2025-03-17 11:34:40,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:34:40,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2025-03-17 11:34:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:40,593 INFO L225 Difference]: With dead ends: 1017 [2025-03-17 11:34:40,593 INFO L226 Difference]: Without dead ends: 1015 [2025-03-17 11:34:40,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:34:40,598 INFO L435 NwaCegarLoop]: 1382 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, 1382 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:40,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1382 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:34:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-17 11:34:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2025-03-17 11:34:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 996 states have (on average 1.4779116465863453) internal successors, (1472), 1001 states have internal predecessors, (1472), 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-03-17 11:34:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1500 transitions. [2025-03-17 11:34:40,679 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1500 transitions. Word has length 13 [2025-03-17 11:34:40,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:40,679 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1500 transitions. [2025-03-17 11:34:40,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-03-17 11:34:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1500 transitions. [2025-03-17 11:34:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 11:34:40,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:40,684 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] [2025-03-17 11:34:40,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:34:40,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:40,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1059423530, now seen corresponding path program 1 times [2025-03-17 11:34:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:40,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193643987] [2025-03-17 11:34:40,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:40,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:40,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 11:34:40,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 11:34:40,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:40,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:34:41,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:41,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193643987] [2025-03-17 11:34:41,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193643987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:41,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:41,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:34:41,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767851433] [2025-03-17 11:34:41,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:41,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:34:41,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:41,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:34:41,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:34:41,086 INFO L87 Difference]: Start difference. First operand 1015 states and 1500 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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-03-17 11:34:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:41,488 INFO L93 Difference]: Finished difference Result 1395 states and 2055 transitions. [2025-03-17 11:34:41,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:34:41,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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 66 [2025-03-17 11:34:41,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:41,493 INFO L225 Difference]: With dead ends: 1395 [2025-03-17 11:34:41,493 INFO L226 Difference]: Without dead ends: 1395 [2025-03-17 11:34:41,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:34:41,494 INFO L435 NwaCegarLoop]: 1415 mSDtfsCounter, 542 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4139 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:41,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4139 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:34:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-03-17 11:34:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1017. [2025-03-17 11:34:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 998 states have (on average 1.4769539078156313) internal successors, (1474), 1003 states have internal predecessors, (1474), 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-03-17 11:34:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1502 transitions. [2025-03-17 11:34:41,527 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1502 transitions. Word has length 66 [2025-03-17 11:34:41,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:41,527 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1502 transitions. [2025-03-17 11:34:41,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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-03-17 11:34:41,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1502 transitions. [2025-03-17 11:34:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 11:34:41,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:41,531 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] [2025-03-17 11:34:41,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:34:41,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:41,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:41,532 INFO L85 PathProgramCache]: Analyzing trace with hash -94075490, now seen corresponding path program 1 times [2025-03-17 11:34:41,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:41,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948149811] [2025-03-17 11:34:41,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:41,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:41,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 11:34:41,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 11:34:41,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:41,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:34:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:41,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948149811] [2025-03-17 11:34:41,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948149811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:41,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:41,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:34:41,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162734799] [2025-03-17 11:34:41,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:41,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:34:41,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:41,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:34:41,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:34:41,955 INFO L87 Difference]: Start difference. First operand 1017 states and 1502 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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-03-17 11:34:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:42,285 INFO L93 Difference]: Finished difference Result 1395 states and 2054 transitions. [2025-03-17 11:34:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:34:42,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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 141 [2025-03-17 11:34:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:42,289 INFO L225 Difference]: With dead ends: 1395 [2025-03-17 11:34:42,289 INFO L226 Difference]: Without dead ends: 1395 [2025-03-17 11:34:42,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:34:42,290 INFO L435 NwaCegarLoop]: 1384 mSDtfsCounter, 538 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 4078 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.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:42,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 4078 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:34:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-03-17 11:34:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1020. [2025-03-17 11:34:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1001 states have (on average 1.4755244755244756) internal successors, (1477), 1006 states have internal predecessors, (1477), 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-03-17 11:34:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1505 transitions. [2025-03-17 11:34:42,314 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1505 transitions. Word has length 141 [2025-03-17 11:34:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:42,314 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1505 transitions. [2025-03-17 11:34:42,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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-03-17 11:34:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1505 transitions. [2025-03-17 11:34:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-17 11:34:42,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:42,316 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] [2025-03-17 11:34:42,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:34:42,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:42,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash -915478561, now seen corresponding path program 1 times [2025-03-17 11:34:42,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:42,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495130012] [2025-03-17 11:34:42,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:42,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:42,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-17 11:34:42,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-17 11:34:42,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:42,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:34:42,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:42,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495130012] [2025-03-17 11:34:42,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495130012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:42,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:42,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:34:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613166566] [2025-03-17 11:34:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:42,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:34:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:42,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:34:42,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:34:42,668 INFO L87 Difference]: Start difference. First operand 1020 states and 1505 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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-03-17 11:34:42,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:42,914 INFO L93 Difference]: Finished difference Result 978 states and 1428 transitions. [2025-03-17 11:34:42,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:34:42,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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 210 [2025-03-17 11:34:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:42,918 INFO L225 Difference]: With dead ends: 978 [2025-03-17 11:34:42,918 INFO L226 Difference]: Without dead ends: 978 [2025-03-17 11:34:42,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:34:42,920 INFO L435 NwaCegarLoop]: 1288 mSDtfsCounter, 30 mSDsluCounter, 2557 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3845 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:42,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3845 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:34:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-17 11:34:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2025-03-17 11:34:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 959 states have (on average 1.4598540145985401) internal successors, (1400), 964 states have internal predecessors, (1400), 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-03-17 11:34:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1428 transitions. [2025-03-17 11:34:42,940 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1428 transitions. Word has length 210 [2025-03-17 11:34:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:42,941 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1428 transitions. [2025-03-17 11:34:42,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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-03-17 11:34:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1428 transitions. [2025-03-17 11:34:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-17 11:34:42,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:42,943 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] [2025-03-17 11:34:42,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:34:42,943 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:42,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash 668735205, now seen corresponding path program 1 times [2025-03-17 11:34:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:42,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888519137] [2025-03-17 11:34:42,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:43,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-17 11:34:43,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-17 11:34:43,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:43,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:34:43,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:43,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888519137] [2025-03-17 11:34:43,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888519137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:43,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:43,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:34:43,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851553765] [2025-03-17 11:34:43,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:43,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:34:43,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:43,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:34:43,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:34:43,189 INFO L87 Difference]: Start difference. First operand 978 states and 1428 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-03-17 11:34:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:43,450 INFO L93 Difference]: Finished difference Result 1504 states and 2204 transitions. [2025-03-17 11:34:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:34:43,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 210 [2025-03-17 11:34:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:43,455 INFO L225 Difference]: With dead ends: 1504 [2025-03-17 11:34:43,456 INFO L226 Difference]: Without dead ends: 1504 [2025-03-17 11:34:43,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:34:43,458 INFO L435 NwaCegarLoop]: 1304 mSDtfsCounter, 712 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2590 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-03-17 11:34:43,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2590 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:34:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-03-17 11:34:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1344. [2025-03-17 11:34:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1323 states have (on average 1.4633408919123205) internal successors, (1936), 1328 states have internal predecessors, (1936), 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-03-17 11:34:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1968 transitions. [2025-03-17 11:34:43,492 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1968 transitions. Word has length 210 [2025-03-17 11:34:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:43,493 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1968 transitions. [2025-03-17 11:34:43,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-03-17 11:34:43,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1968 transitions. [2025-03-17 11:34:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-17 11:34:43,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:43,497 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] [2025-03-17 11:34:43,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:34:43,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:43,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1208913336, now seen corresponding path program 1 times [2025-03-17 11:34:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:43,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803886010] [2025-03-17 11:34:43,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:43,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 11:34:43,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 11:34:43,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:43,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:34:43,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:43,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803886010] [2025-03-17 11:34:43,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803886010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:43,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:43,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:34:43,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954692572] [2025-03-17 11:34:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:43,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:34:43,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:43,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:34:43,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:34:43,840 INFO L87 Difference]: Start difference. First operand 1344 states and 1968 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-03-17 11:34:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:44,059 INFO L93 Difference]: Finished difference Result 1302 states and 1891 transitions. [2025-03-17 11:34:44,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:34:44,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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 225 [2025-03-17 11:34:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:44,064 INFO L225 Difference]: With dead ends: 1302 [2025-03-17 11:34:44,064 INFO L226 Difference]: Without dead ends: 1302 [2025-03-17 11:34:44,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:34:44,065 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 30 mSDsluCounter, 2409 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3623 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:44,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3623 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:34:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-03-17 11:34:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2025-03-17 11:34:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1281 states have (on average 1.4512099921935988) internal successors, (1859), 1286 states have internal predecessors, (1859), 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-03-17 11:34:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1891 transitions. [2025-03-17 11:34:44,087 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1891 transitions. Word has length 225 [2025-03-17 11:34:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:44,087 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1891 transitions. [2025-03-17 11:34:44,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-03-17 11:34:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1891 transitions. [2025-03-17 11:34:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-17 11:34:44,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:44,089 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] [2025-03-17 11:34:44,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:34:44,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:44,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:44,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2061798639, now seen corresponding path program 1 times [2025-03-17 11:34:44,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:44,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346122745] [2025-03-17 11:34:44,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:44,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 11:34:44,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 11:34:44,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:44,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:34:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:44,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346122745] [2025-03-17 11:34:44,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346122745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:44,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:44,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:34:44,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473897904] [2025-03-17 11:34:44,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:44,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:34:44,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:44,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:34:44,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:34:44,331 INFO L87 Difference]: Start difference. First operand 1302 states and 1891 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-03-17 11:34:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:44,496 INFO L93 Difference]: Finished difference Result 1302 states and 1888 transitions. [2025-03-17 11:34:44,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:34:44,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 225 [2025-03-17 11:34:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:44,501 INFO L225 Difference]: With dead ends: 1302 [2025-03-17 11:34:44,501 INFO L226 Difference]: Without dead ends: 1302 [2025-03-17 11:34:44,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:34:44,501 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 1 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:44,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2430 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:34:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-03-17 11:34:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2025-03-17 11:34:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1281 states have (on average 1.4488680718188915) internal successors, (1856), 1286 states have internal predecessors, (1856), 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-03-17 11:34:44,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1888 transitions. [2025-03-17 11:34:44,524 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1888 transitions. Word has length 225 [2025-03-17 11:34:44,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:44,524 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1888 transitions. [2025-03-17 11:34:44,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-03-17 11:34:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1888 transitions. [2025-03-17 11:34:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-17 11:34:44,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:44,526 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] [2025-03-17 11:34:44,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:34:44,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:44,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1997490482, now seen corresponding path program 1 times [2025-03-17 11:34:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:44,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710591035] [2025-03-17 11:34:44,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:44,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:44,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 11:34:44,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 11:34:44,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:44,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:34:44,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:44,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710591035] [2025-03-17 11:34:44,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710591035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:44,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:44,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:34:44,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682454004] [2025-03-17 11:34:44,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:44,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:34:44,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:44,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:34:44,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:34:44,747 INFO L87 Difference]: Start difference. First operand 1302 states and 1888 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-03-17 11:34:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:44,969 INFO L93 Difference]: Finished difference Result 1867 states and 2711 transitions. [2025-03-17 11:34:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:34:44,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 225 [2025-03-17 11:34:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:44,976 INFO L225 Difference]: With dead ends: 1867 [2025-03-17 11:34:44,976 INFO L226 Difference]: Without dead ends: 1867 [2025-03-17 11:34:44,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:34:44,976 INFO L435 NwaCegarLoop]: 1230 mSDtfsCounter, 594 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:44,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 2442 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:34:44,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2025-03-17 11:34:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1859. [2025-03-17 11:34:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1832 states have (on average 1.4514192139737991) internal successors, (2659), 1837 states have internal predecessors, (2659), 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-03-17 11:34:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2703 transitions. [2025-03-17 11:34:45,011 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2703 transitions. Word has length 225 [2025-03-17 11:34:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:45,011 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2703 transitions. [2025-03-17 11:34:45,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-03-17 11:34:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2703 transitions. [2025-03-17 11:34:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-17 11:34:45,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:45,014 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] [2025-03-17 11:34:45,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:34:45,014 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:45,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:45,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1994377682, now seen corresponding path program 1 times [2025-03-17 11:34:45,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:45,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677199086] [2025-03-17 11:34:45,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:45,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:45,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 11:34:45,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 11:34:45,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:45,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 11:34:45,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:45,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677199086] [2025-03-17 11:34:45,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677199086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:45,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:45,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:34:45,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774907243] [2025-03-17 11:34:45,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:45,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:34:45,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:45,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:34:45,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:34:45,285 INFO L87 Difference]: Start difference. First operand 1859 states and 2703 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-03-17 11:34:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:45,636 INFO L93 Difference]: Finished difference Result 1436 states and 2064 transitions. [2025-03-17 11:34:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:34:45,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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 240 [2025-03-17 11:34:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:45,641 INFO L225 Difference]: With dead ends: 1436 [2025-03-17 11:34:45,642 INFO L226 Difference]: Without dead ends: 1436 [2025-03-17 11:34:45,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-03-17 11:34:45,642 INFO L435 NwaCegarLoop]: 1259 mSDtfsCounter, 2352 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2352 SdHoareTripleChecker+Valid, 1441 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.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:45,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2352 Valid, 1441 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:34:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-03-17 11:34:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436. [2025-03-17 11:34:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1414 states have (on average 1.4356435643564356) internal successors, (2030), 1419 states have internal predecessors, (2030), 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-03-17 11:34:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2064 transitions. [2025-03-17 11:34:45,666 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2064 transitions. Word has length 240 [2025-03-17 11:34:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:45,666 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 2064 transitions. [2025-03-17 11:34:45,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-03-17 11:34:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2064 transitions. [2025-03-17 11:34:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-17 11:34:45,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:45,669 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] [2025-03-17 11:34:45,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:34:45,669 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:45,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:45,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1307603328, now seen corresponding path program 1 times [2025-03-17 11:34:45,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:45,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239557155] [2025-03-17 11:34:45,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:45,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 11:34:45,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 11:34:45,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:45,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 11:34:45,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239557155] [2025-03-17 11:34:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239557155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:45,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:45,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:34:45,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053356526] [2025-03-17 11:34:45,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:45,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:34:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:45,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:34:45,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:34:45,968 INFO L87 Difference]: Start difference. First operand 1436 states and 2064 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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-03-17 11:34:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:46,169 INFO L93 Difference]: Finished difference Result 1394 states and 1987 transitions. [2025-03-17 11:34:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:34:46,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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 250 [2025-03-17 11:34:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:46,174 INFO L225 Difference]: With dead ends: 1394 [2025-03-17 11:34:46,174 INFO L226 Difference]: Without dead ends: 1394 [2025-03-17 11:34:46,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:34:46,175 INFO L435 NwaCegarLoop]: 1138 mSDtfsCounter, 30 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3395 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-03-17 11:34:46,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3395 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:34:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-17 11:34:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2025-03-17 11:34:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1372 states have (on average 1.4234693877551021) internal successors, (1953), 1377 states have internal predecessors, (1953), 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-03-17 11:34:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1987 transitions. [2025-03-17 11:34:46,196 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1987 transitions. Word has length 250 [2025-03-17 11:34:46,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:46,197 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1987 transitions. [2025-03-17 11:34:46,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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-03-17 11:34:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1987 transitions. [2025-03-17 11:34:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-17 11:34:46,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:46,199 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] [2025-03-17 11:34:46,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:34:46,199 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:46,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1322185657, now seen corresponding path program 1 times [2025-03-17 11:34:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:46,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236378085] [2025-03-17 11:34:46,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:46,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:46,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 11:34:46,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 11:34:46,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:46,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 11:34:46,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:46,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236378085] [2025-03-17 11:34:46,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236378085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:34:46,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063833807] [2025-03-17 11:34:46,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:46,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:34:46,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:34:46,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:34:46,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:34:47,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 11:34:47,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 11:34:47,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:47,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:47,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 11:34:47,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:34:47,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:34:47,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 11:34:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 11:34:47,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:34:47,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063833807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:47,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:34:47,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-17 11:34:47,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085369928] [2025-03-17 11:34:47,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:47,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:34:47,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:47,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:34:47,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:34:47,866 INFO L87 Difference]: Start difference. First operand 1394 states and 1987 transitions. Second operand has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 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-03-17 11:34:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:48,977 INFO L93 Difference]: Finished difference Result 1714 states and 2412 transitions. [2025-03-17 11:34:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:34:48,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 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 250 [2025-03-17 11:34:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:48,983 INFO L225 Difference]: With dead ends: 1714 [2025-03-17 11:34:48,983 INFO L226 Difference]: Without dead ends: 1714 [2025-03-17 11:34:48,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 239 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-03-17 11:34:48,985 INFO L435 NwaCegarLoop]: 1096 mSDtfsCounter, 1848 mSDsluCounter, 3558 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 4654 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:48,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 4654 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 11:34:48,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-03-17 11:34:49,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1562. [2025-03-17 11:34:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1530 states have (on average 1.4137254901960785) internal successors, (2163), 1539 states have internal predecessors, (2163), 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-03-17 11:34:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2211 transitions. [2025-03-17 11:34:49,010 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2211 transitions. Word has length 250 [2025-03-17 11:34:49,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:49,010 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2211 transitions. [2025-03-17 11:34:49,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 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-03-17 11:34:49,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2211 transitions. [2025-03-17 11:34:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-17 11:34:49,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:49,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:34:49,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:34:49,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 11:34:49,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:49,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash -885282159, now seen corresponding path program 1 times [2025-03-17 11:34:49,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:49,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113234406] [2025-03-17 11:34:49,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:49,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:49,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-17 11:34:49,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-17 11:34:49,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:49,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 11:34:50,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113234406] [2025-03-17 11:34:50,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113234406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:34:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823410341] [2025-03-17 11:34:50,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:50,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:34:50,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:34:50,147 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:34:50,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:34:50,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-17 11:34:50,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-17 11:34:50,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:50,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:50,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:34:50,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:34:50,674 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-03-17 11:34:50,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:34:50,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 11:34:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 11:34:50,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:34:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 11:34:51,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823410341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:34:51,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:34:51,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-03-17 11:34:51,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547467528] [2025-03-17 11:34:51,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:34:51,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:34:51,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:51,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:34:51,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:34:51,282 INFO L87 Difference]: Start difference. First operand 1562 states and 2211 transitions. Second operand has 11 states, 11 states have (on average 43.0) internal successors, (473), 11 states have internal predecessors, (473), 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-03-17 11:34:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:52,044 INFO L93 Difference]: Finished difference Result 2488 states and 3451 transitions. [2025-03-17 11:34:52,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:34:52,045 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 43.0) internal successors, (473), 11 states have internal predecessors, (473), 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 325 [2025-03-17 11:34:52,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:52,052 INFO L225 Difference]: With dead ends: 2488 [2025-03-17 11:34:52,052 INFO L226 Difference]: Without dead ends: 2488 [2025-03-17 11:34:52,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 640 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:34:52,054 INFO L435 NwaCegarLoop]: 1124 mSDtfsCounter, 2194 mSDsluCounter, 6783 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 7907 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:52,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 7907 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 11:34:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2025-03-17 11:34:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2206. [2025-03-17 11:34:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 2162 states have (on average 1.3880666049953747) internal successors, (3001), 2171 states have internal predecessors, (3001), 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-03-17 11:34:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3071 transitions. [2025-03-17 11:34:52,103 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3071 transitions. Word has length 325 [2025-03-17 11:34:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:52,104 INFO L471 AbstractCegarLoop]: Abstraction has 2206 states and 3071 transitions. [2025-03-17 11:34:52,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 43.0) internal successors, (473), 11 states have internal predecessors, (473), 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-03-17 11:34:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3071 transitions. [2025-03-17 11:34:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-17 11:34:52,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:52,118 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, 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] [2025-03-17 11:34:52,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:34:52,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 11:34:52,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:52,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:52,320 INFO L85 PathProgramCache]: Analyzing trace with hash 963504342, now seen corresponding path program 1 times [2025-03-17 11:34:52,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:52,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021094143] [2025-03-17 11:34:52,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:52,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:52,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-17 11:34:52,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-17 11:34:52,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:52,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 11:34:56,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:56,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021094143] [2025-03-17 11:34:56,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021094143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:34:56,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587028549] [2025-03-17 11:34:56,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:56,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:34:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:34:56,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:34:56,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:34:56,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-17 11:34:57,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-17 11:34:57,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:57,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:57,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 3756 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 11:34:57,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:34:57,366 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-03-17 11:34:57,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:34:57,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:34:57,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:34:58,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:34:58,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 11:34:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 11:34:58,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:34:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 11:34:58,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587028549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:34:58,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:34:58,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2025-03-17 11:34:58,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463914453] [2025-03-17 11:34:58,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:34:58,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 11:34:58,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:58,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 11:34:58,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:34:58,697 INFO L87 Difference]: Start difference. First operand 2206 states and 3071 transitions. Second operand has 20 states, 20 states have (on average 67.15) internal successors, (1343), 20 states have internal predecessors, (1343), 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-03-17 11:34:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:59,615 INFO L93 Difference]: Finished difference Result 4210 states and 5761 transitions. [2025-03-17 11:34:59,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 11:34:59,616 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 67.15) internal successors, (1343), 20 states have internal predecessors, (1343), 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 757 [2025-03-17 11:34:59,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:59,628 INFO L225 Difference]: With dead ends: 4210 [2025-03-17 11:34:59,628 INFO L226 Difference]: Without dead ends: 4210 [2025-03-17 11:34:59,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1537 GetRequests, 1502 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=599, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:34:59,629 INFO L435 NwaCegarLoop]: 1124 mSDtfsCounter, 5396 mSDsluCounter, 7752 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5434 SdHoareTripleChecker+Valid, 8876 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:59,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5434 Valid, 8876 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 11:34:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4210 states. [2025-03-17 11:34:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4210 to 3928. [2025-03-17 11:34:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3928 states, 3860 states have (on average 1.3634715025906736) internal successors, (5263), 3869 states have internal predecessors, (5263), 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-03-17 11:34:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 5381 transitions. [2025-03-17 11:34:59,686 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 5381 transitions. Word has length 757 [2025-03-17 11:34:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:59,686 INFO L471 AbstractCegarLoop]: Abstraction has 3928 states and 5381 transitions. [2025-03-17 11:34:59,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 67.15) internal successors, (1343), 20 states have internal predecessors, (1343), 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-03-17 11:34:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 5381 transitions. [2025-03-17 11:34:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2025-03-17 11:34:59,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:59,735 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2025-03-17 11:34:59,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:34:59,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:34:59,935 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:59,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1738152800, now seen corresponding path program 2 times [2025-03-17 11:34:59,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:59,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525832234] [2025-03-17 11:34:59,936 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:34:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:35:00,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1621 statements into 2 equivalence classes. [2025-03-17 11:35:00,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 1621 statements. [2025-03-17 11:35:00,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:35:00,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:35:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-17 11:35:00,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:35:00,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525832234] [2025-03-17 11:35:00,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525832234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:35:00,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:35:00,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:35:00,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240373835] [2025-03-17 11:35:00,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:35:00,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:35:00,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:35:00,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:35:00,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:35:00,719 INFO L87 Difference]: Start difference. First operand 3928 states and 5381 transitions. Second operand has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 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-03-17 11:35:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:35:01,356 INFO L93 Difference]: Finished difference Result 3943 states and 5397 transitions. [2025-03-17 11:35:01,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:35:01,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 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 1621 [2025-03-17 11:35:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:35:01,369 INFO L225 Difference]: With dead ends: 3943 [2025-03-17 11:35:01,371 INFO L226 Difference]: Without dead ends: 3943 [2025-03-17 11:35:01,371 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-03-17 11:35:01,372 INFO L435 NwaCegarLoop]: 1144 mSDtfsCounter, 53 mSDsluCounter, 5396 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 6540 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:35:01,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 6540 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 11:35:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2025-03-17 11:35:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3939. [2025-03-17 11:35:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3871 states have (on average 1.3624386463446139) internal successors, (5274), 3880 states have internal predecessors, (5274), 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-03-17 11:35:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 5392 transitions. [2025-03-17 11:35:01,424 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 5392 transitions. Word has length 1621 [2025-03-17 11:35:01,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:35:01,426 INFO L471 AbstractCegarLoop]: Abstraction has 3939 states and 5392 transitions. [2025-03-17 11:35:01,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 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-03-17 11:35:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 5392 transitions. [2025-03-17 11:35:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-17 11:35:01,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:35:01,442 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2025-03-17 11:35:01,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:35:01,442 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:35:01,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:35:01,443 INFO L85 PathProgramCache]: Analyzing trace with hash 814609995, now seen corresponding path program 1 times [2025-03-17 11:35:01,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:35:01,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490493822] [2025-03-17 11:35:01,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:35:01,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:35:01,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-17 11:35:02,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-17 11:35:02,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:35:02,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:35:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-17 11:35:05,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:35:05,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490493822] [2025-03-17 11:35:05,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490493822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:35:05,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:35:05,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:35:05,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533358878] [2025-03-17 11:35:05,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:35:05,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:35:05,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:35:05,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:35:05,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:35:05,896 INFO L87 Difference]: Start difference. First operand 3939 states and 5392 transitions. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 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-03-17 11:35:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:35:06,403 INFO L93 Difference]: Finished difference Result 3944 states and 5398 transitions. [2025-03-17 11:35:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:35:06,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 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 1622 [2025-03-17 11:35:06,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:35:06,418 INFO L225 Difference]: With dead ends: 3944 [2025-03-17 11:35:06,418 INFO L226 Difference]: Without dead ends: 3944 [2025-03-17 11:35:06,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:35:06,420 INFO L435 NwaCegarLoop]: 1150 mSDtfsCounter, 20 mSDsluCounter, 5381 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6531 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-03-17 11:35:06,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6531 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:35:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2025-03-17 11:35:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3943. [2025-03-17 11:35:06,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3875 states have (on average 1.3623225806451613) internal successors, (5279), 3884 states have internal predecessors, (5279), 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-03-17 11:35:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 5397 transitions. [2025-03-17 11:35:06,470 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 5397 transitions. Word has length 1622 [2025-03-17 11:35:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:35:06,472 INFO L471 AbstractCegarLoop]: Abstraction has 3943 states and 5397 transitions. [2025-03-17 11:35:06,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 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-03-17 11:35:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 5397 transitions. [2025-03-17 11:35:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-17 11:35:06,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:35:06,488 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2025-03-17 11:35:06,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:35:06,488 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:35:06,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:35:06,489 INFO L85 PathProgramCache]: Analyzing trace with hash -827829198, now seen corresponding path program 1 times [2025-03-17 11:35:06,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:35:06,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954512064] [2025-03-17 11:35:06,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:35:06,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:35:06,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-17 11:35:07,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-17 11:35:07,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:35:07,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:35:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-17 11:35:10,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:35:10,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954512064] [2025-03-17 11:35:10,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954512064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:35:10,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:35:10,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:35:10,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346645253] [2025-03-17 11:35:10,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:35:10,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:35:10,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:35:10,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:35:10,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:35:10,042 INFO L87 Difference]: Start difference. First operand 3943 states and 5397 transitions. Second operand has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 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-03-17 11:35:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:35:10,435 INFO L93 Difference]: Finished difference Result 3951 states and 5407 transitions. [2025-03-17 11:35:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:35:10,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 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 1622 [2025-03-17 11:35:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:35:10,444 INFO L225 Difference]: With dead ends: 3951 [2025-03-17 11:35:10,444 INFO L226 Difference]: Without dead ends: 3951 [2025-03-17 11:35:10,444 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-03-17 11:35:10,445 INFO L435 NwaCegarLoop]: 1144 mSDtfsCounter, 25 mSDsluCounter, 5429 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6573 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:35:10,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6573 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:35:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-03-17 11:35:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3943. [2025-03-17 11:35:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3875 states have (on average 1.3623225806451613) internal successors, (5279), 3884 states have internal predecessors, (5279), 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-03-17 11:35:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 5397 transitions. [2025-03-17 11:35:10,480 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 5397 transitions. Word has length 1622 [2025-03-17 11:35:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:35:10,481 INFO L471 AbstractCegarLoop]: Abstraction has 3943 states and 5397 transitions. [2025-03-17 11:35:10,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 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-03-17 11:35:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 5397 transitions. [2025-03-17 11:35:10,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1624 [2025-03-17 11:35:10,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:35:10,496 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-03-17 11:35:10,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:35:10,496 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:35:10,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:35:10,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1421420615, now seen corresponding path program 1 times [2025-03-17 11:35:10,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:35:10,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231913219] [2025-03-17 11:35:10,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:35:10,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:35:10,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-17 11:35:11,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-17 11:35:11,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:35:11,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:35:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-17 11:35:14,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:35:14,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231913219] [2025-03-17 11:35:14,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231913219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:35:14,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:35:14,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:35:14,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861715974] [2025-03-17 11:35:14,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:35:14,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:35:14,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:35:14,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:35:14,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:35:14,152 INFO L87 Difference]: Start difference. First operand 3943 states and 5397 transitions. Second operand has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 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-03-17 11:35:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:35:14,691 INFO L93 Difference]: Finished difference Result 3954 states and 5411 transitions. [2025-03-17 11:35:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:35:14,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 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 1623 [2025-03-17 11:35:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:35:14,698 INFO L225 Difference]: With dead ends: 3954 [2025-03-17 11:35:14,698 INFO L226 Difference]: Without dead ends: 3954 [2025-03-17 11:35:14,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:35:14,698 INFO L435 NwaCegarLoop]: 1144 mSDtfsCounter, 31 mSDsluCounter, 7638 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8782 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.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:35:14,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8782 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:35:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3954 states. [2025-03-17 11:35:14,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3954 to 3951. [2025-03-17 11:35:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3883 states have (on average 1.3620911666237445) internal successors, (5289), 3892 states have internal predecessors, (5289), 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-03-17 11:35:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 5407 transitions. [2025-03-17 11:35:14,729 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 5407 transitions. Word has length 1623 [2025-03-17 11:35:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:35:14,769 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 5407 transitions. [2025-03-17 11:35:14,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 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-03-17 11:35:14,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 5407 transitions. [2025-03-17 11:35:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-03-17 11:35:14,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:35:14,787 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-03-17 11:35:14,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:35:14,788 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:35:14,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:35:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1413455278, now seen corresponding path program 1 times [2025-03-17 11:35:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:35:14,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57009478] [2025-03-17 11:35:14,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:35:14,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:35:15,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-17 11:35:15,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-17 11:35:15,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:35:15,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:35:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-17 11:35:18,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:35:18,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57009478] [2025-03-17 11:35:18,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57009478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:35:18,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:35:18,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:35:18,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827211028] [2025-03-17 11:35:18,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:35:18,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:35:18,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:35:18,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:35:18,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:35:18,312 INFO L87 Difference]: Start difference. First operand 3951 states and 5407 transitions. Second operand has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 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-03-17 11:35:18,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:35:18,657 INFO L93 Difference]: Finished difference Result 3954 states and 5410 transitions. [2025-03-17 11:35:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:35:18,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 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 1624 [2025-03-17 11:35:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:35:18,664 INFO L225 Difference]: With dead ends: 3954 [2025-03-17 11:35:18,664 INFO L226 Difference]: Without dead ends: 3954 [2025-03-17 11:35:18,665 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-03-17 11:35:18,665 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 16 mSDsluCounter, 4341 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5494 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:35:18,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5494 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:35:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3954 states. [2025-03-17 11:35:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3954 to 3954. [2025-03-17 11:35:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3886 states have (on average 1.361811631497684) internal successors, (5292), 3895 states have internal predecessors, (5292), 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-03-17 11:35:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 5410 transitions. [2025-03-17 11:35:18,697 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 5410 transitions. Word has length 1624 [2025-03-17 11:35:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:35:18,697 INFO L471 AbstractCegarLoop]: Abstraction has 3954 states and 5410 transitions. [2025-03-17 11:35:18,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 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-03-17 11:35:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 5410 transitions. [2025-03-17 11:35:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-03-17 11:35:18,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:35:18,713 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-03-17 11:35:18,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:35:18,713 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:35:18,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:35:18,714 INFO L85 PathProgramCache]: Analyzing trace with hash 313673269, now seen corresponding path program 1 times [2025-03-17 11:35:18,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:35:18,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046950449] [2025-03-17 11:35:18,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:35:18,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:35:19,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-17 11:35:19,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-17 11:35:19,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:35:19,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:35:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 1961 proven. 74 refuted. 0 times theorem prover too weak. 5203 trivial. 0 not checked. [2025-03-17 11:35:24,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:35:24,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046950449] [2025-03-17 11:35:24,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046950449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:35:24,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954522893] [2025-03-17 11:35:24,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:35:24,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:35:24,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:35:24,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:35:24,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:35:25,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-17 11:35:26,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-17 11:35:26,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:35:26,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:35:26,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 7986 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 11:35:26,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:35:26,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:35:26,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:35:26,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:35:26,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:35:27,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:35:27,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:35:27,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:35:27,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:35:27,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:35:27,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:35:27,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:35:27,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 11:35:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 42 proven. 7172 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 11:35:27,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:35:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 42 proven. 7172 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 11:35:29,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954522893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:35:29,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:35:29,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 16] total 34 [2025-03-17 11:35:29,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541420033] [2025-03-17 11:35:29,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:35:29,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 11:35:29,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:35:29,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 11:35:29,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=735, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 11:35:29,257 INFO L87 Difference]: Start difference. First operand 3954 states and 5410 transitions. Second operand has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 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-03-17 11:35:34,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:35:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:35:35,245 INFO L93 Difference]: Finished difference Result 7279 states and 9834 transitions. [2025-03-17 11:35:35,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-17 11:35:35,246 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 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 1624 [2025-03-17 11:35:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:35:35,259 INFO L225 Difference]: With dead ends: 7279 [2025-03-17 11:35:35,259 INFO L226 Difference]: Without dead ends: 7279 [2025-03-17 11:35:35,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3303 GetRequests, 3217 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1731, Invalid=4749, Unknown=0, NotChecked=0, Total=6480 [2025-03-17 11:35:35,261 INFO L435 NwaCegarLoop]: 1091 mSDtfsCounter, 10938 mSDsluCounter, 11486 mSDsCounter, 0 mSdLazyCounter, 1842 mSolverCounterSat, 66 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11010 SdHoareTripleChecker+Valid, 12577 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1842 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-17 11:35:35,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11010 Valid, 12577 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1842 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-03-17 11:35:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7279 states. [2025-03-17 11:35:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7279 to 7276. [2025-03-17 11:35:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7276 states, 7142 states have (on average 1.3416409969196303) internal successors, (9582), 7151 states have internal predecessors, (9582), 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-03-17 11:35:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7276 states to 7276 states and 9832 transitions. [2025-03-17 11:35:35,324 INFO L78 Accepts]: Start accepts. Automaton has 7276 states and 9832 transitions. Word has length 1624 [2025-03-17 11:35:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:35:35,325 INFO L471 AbstractCegarLoop]: Abstraction has 7276 states and 9832 transitions. [2025-03-17 11:35:35,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 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-03-17 11:35:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 7276 states and 9832 transitions. [2025-03-17 11:35:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3275 [2025-03-17 11:35:35,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:35:35,374 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, 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, 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-03-17 11:35:35,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:35:35,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:35:35,576 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:35:35,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:35:35,578 INFO L85 PathProgramCache]: Analyzing trace with hash 736980789, now seen corresponding path program 2 times [2025-03-17 11:35:35,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:35:35,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763026098] [2025-03-17 11:35:35,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:35:35,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:35:36,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3274 statements into 2 equivalence classes. [2025-03-17 11:35:36,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 79 of 3274 statements. [2025-03-17 11:35:36,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:35:36,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:35:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 42713 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42713 trivial. 0 not checked. [2025-03-17 11:35:36,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:35:36,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763026098] [2025-03-17 11:35:36,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763026098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:35:36,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:35:36,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:35:36,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108800235] [2025-03-17 11:35:36,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:35:36,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:35:36,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:35:36,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:35:36,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:35:36,647 INFO L87 Difference]: Start difference. First operand 7276 states and 9832 transitions. Second operand has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 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-03-17 11:35:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:35:37,787 INFO L93 Difference]: Finished difference Result 7321 states and 9896 transitions. [2025-03-17 11:35:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:35:37,788 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 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 3274 [2025-03-17 11:35:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:35:37,801 INFO L225 Difference]: With dead ends: 7321 [2025-03-17 11:35:37,801 INFO L226 Difference]: Without dead ends: 7321 [2025-03-17 11:35:37,802 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-03-17 11:35:37,803 INFO L435 NwaCegarLoop]: 1151 mSDtfsCounter, 85 mSDsluCounter, 12161 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 13312 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:35:37,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 13312 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 11:35:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7321 states. [2025-03-17 11:35:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7321 to 7282. [2025-03-17 11:35:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7282 states, 7148 states have (on average 1.3416340235030777) internal successors, (9590), 7157 states have internal predecessors, (9590), 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-03-17 11:35:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7282 states to 7282 states and 9840 transitions. [2025-03-17 11:35:37,869 INFO L78 Accepts]: Start accepts. Automaton has 7282 states and 9840 transitions. Word has length 3274 [2025-03-17 11:35:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:35:37,871 INFO L471 AbstractCegarLoop]: Abstraction has 7282 states and 9840 transitions. [2025-03-17 11:35:37,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 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-03-17 11:35:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 7282 states and 9840 transitions. [2025-03-17 11:35:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3276 [2025-03-17 11:35:37,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:35:37,919 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, 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, 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-03-17 11:35:37,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:35:37,920 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:35:37,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:35:37,921 INFO L85 PathProgramCache]: Analyzing trace with hash -496676952, now seen corresponding path program 1 times [2025-03-17 11:35:37,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:35:37,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208857064] [2025-03-17 11:35:37,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:35:37,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:35:38,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3275 statements into 1 equivalence classes. [2025-03-17 11:35:40,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3275 of 3275 statements. [2025-03-17 11:35:40,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:35:40,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat