./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:56:23,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:56:23,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:56:23,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:56:23,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:56:23,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:56:23,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:56:23,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:56:23,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:56:23,520 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:56:23,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:56:23,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:56:23,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:56:23,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:56:23,520 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:56:23,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:56:23,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:56:23,520 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:56:23,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:56:23,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:56:23,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:56:23,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:56:23,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:56:23,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:56:23,522 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:56:23,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:56:23,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:56:23,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:56:23,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:56:23,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:56:23,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:56:23,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:56:23,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:56:23,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:56:23,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:56:23,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:56:23,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:56:23,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:56:23,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:56:23,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:56:23,524 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:56:23,524 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:56:23,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:56:23,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:56:23,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:56:23,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:56:23,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:56:23,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:56:23,525 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> d993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988 [2025-01-09 20:56:23,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:56:23,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:56:23,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:56:23,755 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:56:23,755 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:56:23,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i [2025-01-09 20:56:24,923 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da1ed89be/251de62dea8048cda1789099dca0ebdb/FLAG1bd965385 [2025-01-09 20:56:25,284 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:56:25,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i [2025-01-09 20:56:25,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da1ed89be/251de62dea8048cda1789099dca0ebdb/FLAG1bd965385 [2025-01-09 20:56:25,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da1ed89be/251de62dea8048cda1789099dca0ebdb [2025-01-09 20:56:25,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:56:25,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:56:25,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:56:25,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:56:25,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:56:25,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:25,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718da415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25, skipping insertion in model container [2025-01-09 20:56:25,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:25,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:56:25,593 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i[33021,33034] [2025-01-09 20:56:25,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i[84583,84596] [2025-01-09 20:56:25,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:56:25,759 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:56:25,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i[33021,33034] [2025-01-09 20:56:25,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i[84583,84596] [2025-01-09 20:56:25,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:56:25,920 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:56:25,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25 WrapperNode [2025-01-09 20:56:25,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:56:25,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:56:25,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:56:25,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:56:25,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:25,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:26,047 INFO L138 Inliner]: procedures = 177, calls = 773, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3403 [2025-01-09 20:56:26,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:56:26,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:56:26,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:56:26,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:56:26,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:26,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:26,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:26,121 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-01-09 20:56:26,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:26,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:26,173 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:26,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:26,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:26,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:26,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:26,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:56:26,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:56:26,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:56:26,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:56:26,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (1/1) ... [2025-01-09 20:56:26,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:56:26,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:56:26,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:56:26,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:56:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:56:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:56:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:56:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:56:26,288 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:56:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:56:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:56:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:56:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:56:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:56:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:56:26,289 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:56:26,289 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:56:26,289 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:56:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:56:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:56:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:56:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:56:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:56:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:56:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:56:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:56:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:56:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:56:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:56:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:56:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:56:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:56:26,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:56:26,463 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:56:26,464 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:56:28,504 INFO L? ?]: Removed 823 outVars from TransFormulas that were not future-live. [2025-01-09 20:56:28,504 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:56:28,544 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:56:28,545 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2025-01-09 20:56:28,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:56:28 BoogieIcfgContainer [2025-01-09 20:56:28,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:56:28,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:56:28,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:56:28,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:56:28,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:56:25" (1/3) ... [2025-01-09 20:56:28,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142a3688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:56:28, skipping insertion in model container [2025-01-09 20:56:28,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:25" (2/3) ... [2025-01-09 20:56:28,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142a3688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:56:28, skipping insertion in model container [2025-01-09 20:56:28,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:56:28" (3/3) ... [2025-01-09 20:56:28,553 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-2.i [2025-01-09 20:56:28,563 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:56:28,564 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test9-2.i that has 5 procedures, 1411 locations, 1 initial locations, 38 loop locations, and 2 error locations. [2025-01-09 20:56:28,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:56:28,653 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=LoopHeads, 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;@774f3e11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:56:28,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 20:56:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 1403 states, 895 states have (on average 1.8279329608938548) internal successors, (1636), 1397 states have internal predecessors, (1636), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 20:56:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 20:56:28,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:28,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:56:28,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:28,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:28,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1337710400, now seen corresponding path program 1 times [2025-01-09 20:56:28,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:28,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459705085] [2025-01-09 20:56:28,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:28,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 20:56:28,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 20:56:28,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:28,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:56:28,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:28,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459705085] [2025-01-09 20:56:28,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459705085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:28,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:28,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:56:28,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618555802] [2025-01-09 20:56:28,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:28,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:56:28,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:28,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:56:28,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:56:28,823 INFO L87 Difference]: Start difference. First operand has 1403 states, 895 states have (on average 1.8279329608938548) internal successors, (1636), 1397 states have internal predecessors, (1636), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:56:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:28,984 INFO L93 Difference]: Finished difference Result 2804 states and 5782 transitions. [2025-01-09 20:56:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:56:28,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 20:56:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:29,002 INFO L225 Difference]: With dead ends: 2804 [2025-01-09 20:56:29,003 INFO L226 Difference]: Without dead ends: 1366 [2025-01-09 20:56:29,012 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-01-09 20:56:29,013 INFO L435 NwaCegarLoop]: 2578 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2578 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:29,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2578 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:56:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-01-09 20:56:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1366. [2025-01-09 20:56:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 859 states have (on average 1.7718277066356227) internal successors, (1522), 1360 states have internal predecessors, (1522), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 20:56:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2528 transitions. [2025-01-09 20:56:29,265 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2528 transitions. Word has length 9 [2025-01-09 20:56:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:29,266 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 2528 transitions. [2025-01-09 20:56:29,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:56:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2528 transitions. [2025-01-09 20:56:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 20:56:29,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:29,269 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] [2025-01-09 20:56:29,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:56:29,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:29,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1772636287, now seen corresponding path program 1 times [2025-01-09 20:56:29,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:29,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15558068] [2025-01-09 20:56:29,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:29,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:29,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 20:56:29,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 20:56:29,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:29,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:56:29,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:29,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15558068] [2025-01-09 20:56:29,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15558068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:29,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:29,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:56:29,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008582949] [2025-01-09 20:56:29,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:29,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:56:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:29,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:56:29,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:56:29,655 INFO L87 Difference]: Start difference. First operand 1366 states and 2528 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:56:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:30,386 INFO L93 Difference]: Finished difference Result 3884 states and 7283 transitions. [2025-01-09 20:56:30,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:56:30,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 20:56:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:30,408 INFO L225 Difference]: With dead ends: 3884 [2025-01-09 20:56:30,408 INFO L226 Difference]: Without dead ends: 2719 [2025-01-09 20:56:30,412 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-01-09 20:56:30,413 INFO L435 NwaCegarLoop]: 2761 mSDtfsCounter, 1507 mSDsluCounter, 4764 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 7525 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:30,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 7525 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 20:56:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2025-01-09 20:56:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 1368. [2025-01-09 20:56:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 861 states have (on average 1.7700348432055748) internal successors, (1524), 1362 states have internal predecessors, (1524), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 20:56:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2530 transitions. [2025-01-09 20:56:30,780 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2530 transitions. Word has length 63 [2025-01-09 20:56:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:30,780 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 2530 transitions. [2025-01-09 20:56:30,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:56:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2530 transitions. [2025-01-09 20:56:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:56:30,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:30,783 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] [2025-01-09 20:56:30,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:56:30,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:30,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:30,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1726903291, now seen corresponding path program 1 times [2025-01-09 20:56:30,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:30,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513491189] [2025-01-09 20:56:30,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:30,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:30,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:56:30,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:56:30,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:30,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:56:31,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513491189] [2025-01-09 20:56:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513491189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:31,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:31,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:56:31,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854418905] [2025-01-09 20:56:31,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:31,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:56:31,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:31,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:56:31,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:56:31,081 INFO L87 Difference]: Start difference. First operand 1368 states and 2530 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:56:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:31,196 INFO L93 Difference]: Finished difference Result 2690 states and 4990 transitions. [2025-01-09 20:56:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:56:31,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-01-09 20:56:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:31,207 INFO L225 Difference]: With dead ends: 2690 [2025-01-09 20:56:31,207 INFO L226 Difference]: Without dead ends: 1326 [2025-01-09 20:56:31,212 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-01-09 20:56:31,214 INFO L435 NwaCegarLoop]: 2426 mSDtfsCounter, 30 mSDsluCounter, 4834 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7260 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:31,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7260 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:56:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-01-09 20:56:31,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2025-01-09 20:56:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 819 states have (on average 1.7667887667887667) internal successors, (1447), 1320 states have internal predecessors, (1447), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 20:56:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2453 transitions. [2025-01-09 20:56:31,327 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2453 transitions. Word has length 139 [2025-01-09 20:56:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:31,327 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 2453 transitions. [2025-01-09 20:56:31,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:56:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2453 transitions. [2025-01-09 20:56:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:56:31,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:31,329 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] [2025-01-09 20:56:31,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:56:31,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:31,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:31,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2011079597, now seen corresponding path program 1 times [2025-01-09 20:56:31,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:31,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906716143] [2025-01-09 20:56:31,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:31,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:31,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:56:31,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:56:31,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:31,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:56:31,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:31,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906716143] [2025-01-09 20:56:31,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906716143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:31,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:31,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:56:31,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785785416] [2025-01-09 20:56:31,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:31,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:56:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:31,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:56:31,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:56:31,478 INFO L87 Difference]: Start difference. First operand 1326 states and 2453 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:56:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:31,554 INFO L93 Difference]: Finished difference Result 2648 states and 4902 transitions. [2025-01-09 20:56:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:56:31,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-01-09 20:56:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:31,563 INFO L225 Difference]: With dead ends: 2648 [2025-01-09 20:56:31,563 INFO L226 Difference]: Without dead ends: 1326 [2025-01-09 20:56:31,566 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-01-09 20:56:31,566 INFO L435 NwaCegarLoop]: 2439 mSDtfsCounter, 1 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4856 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:31,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4856 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:56:31,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-01-09 20:56:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2025-01-09 20:56:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 819 states have (on average 1.763125763125763) internal successors, (1444), 1320 states have internal predecessors, (1444), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 20:56:31,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2450 transitions. [2025-01-09 20:56:31,655 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2450 transitions. Word has length 139 [2025-01-09 20:56:31,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:31,656 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 2450 transitions. [2025-01-09 20:56:31,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:56:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2450 transitions. [2025-01-09 20:56:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:56:31,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:31,658 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] [2025-01-09 20:56:31,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:56:31,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:31,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1820628401, now seen corresponding path program 1 times [2025-01-09 20:56:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:31,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365695243] [2025-01-09 20:56:31,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:31,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:31,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:56:31,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:56:31,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:31,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:56:31,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:31,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365695243] [2025-01-09 20:56:31,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365695243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:31,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:31,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:56:31,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332286413] [2025-01-09 20:56:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:31,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:56:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:31,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:56:31,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:56:31,810 INFO L87 Difference]: Start difference. First operand 1326 states and 2450 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:56:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:31,949 INFO L93 Difference]: Finished difference Result 3872 states and 7216 transitions. [2025-01-09 20:56:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:56:31,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-01-09 20:56:31,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:31,965 INFO L225 Difference]: With dead ends: 3872 [2025-01-09 20:56:31,965 INFO L226 Difference]: Without dead ends: 2550 [2025-01-09 20:56:31,968 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-01-09 20:56:31,970 INFO L435 NwaCegarLoop]: 2906 mSDtfsCounter, 1260 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 5337 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:31,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 5337 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:56:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2025-01-09 20:56:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2548. [2025-01-09 20:56:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 1541 states have (on average 1.7916937053861128) internal successors, (2761), 2542 states have internal predecessors, (2761), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-09 20:56:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 4767 transitions. [2025-01-09 20:56:32,203 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 4767 transitions. Word has length 139 [2025-01-09 20:56:32,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:32,203 INFO L471 AbstractCegarLoop]: Abstraction has 2548 states and 4767 transitions. [2025-01-09 20:56:32,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:56:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 4767 transitions. [2025-01-09 20:56:32,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:56:32,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:32,205 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:56:32,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:56:32,205 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:32,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:32,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1104711270, now seen corresponding path program 1 times [2025-01-09 20:56:32,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:32,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430260655] [2025-01-09 20:56:32,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:32,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:32,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:56:32,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:56:32,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:32,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:56:32,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:32,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430260655] [2025-01-09 20:56:32,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430260655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:32,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:32,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:56:32,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956279433] [2025-01-09 20:56:32,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:32,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:56:32,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:32,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:56:32,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:56:32,468 INFO L87 Difference]: Start difference. First operand 2548 states and 4767 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:56:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:32,673 INFO L93 Difference]: Finished difference Result 4927 states and 9309 transitions. [2025-01-09 20:56:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:56:32,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-01-09 20:56:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:32,688 INFO L225 Difference]: With dead ends: 4927 [2025-01-09 20:56:32,688 INFO L226 Difference]: Without dead ends: 2628 [2025-01-09 20:56:32,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:56:32,696 INFO L435 NwaCegarLoop]: 2420 mSDtfsCounter, 129 mSDsluCounter, 7145 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 9565 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:32,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 9565 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:56:32,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2025-01-09 20:56:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2552. [2025-01-09 20:56:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 1545 states have (on average 1.7909385113268608) internal successors, (2767), 2546 states have internal predecessors, (2767), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-09 20:56:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 4773 transitions. [2025-01-09 20:56:32,996 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 4773 transitions. Word has length 154 [2025-01-09 20:56:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:32,997 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 4773 transitions. [2025-01-09 20:56:32,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:56:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 4773 transitions. [2025-01-09 20:56:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:56:32,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:32,999 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:56:32,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:56:32,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:32,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash 433628760, now seen corresponding path program 1 times [2025-01-09 20:56:32,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:33,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720833642] [2025-01-09 20:56:33,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:33,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:33,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:56:33,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:56:33,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:33,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:56:33,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:33,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720833642] [2025-01-09 20:56:33,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720833642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:33,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:33,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:56:33,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174592360] [2025-01-09 20:56:33,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:33,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:56:33,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:33,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:56:33,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:56:33,259 INFO L87 Difference]: Start difference. First operand 2552 states and 4773 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:56:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:33,407 INFO L93 Difference]: Finished difference Result 4767 states and 9079 transitions. [2025-01-09 20:56:33,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:56:33,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-01-09 20:56:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:33,422 INFO L225 Difference]: With dead ends: 4767 [2025-01-09 20:56:33,422 INFO L226 Difference]: Without dead ends: 2464 [2025-01-09 20:56:33,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:56:33,430 INFO L435 NwaCegarLoop]: 2344 mSDtfsCounter, 12 mSDsluCounter, 7001 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9345 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:33,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9345 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:56:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2025-01-09 20:56:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2464. [2025-01-09 20:56:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2464 states, 1457 states have (on average 1.789293067947838) internal successors, (2607), 2458 states have internal predecessors, (2607), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-09 20:56:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 4613 transitions. [2025-01-09 20:56:33,772 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 4613 transitions. Word has length 154 [2025-01-09 20:56:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:33,772 INFO L471 AbstractCegarLoop]: Abstraction has 2464 states and 4613 transitions. [2025-01-09 20:56:33,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:56:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 4613 transitions. [2025-01-09 20:56:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:56:33,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:33,774 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:56:33,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:56:33,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:33,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2018741902, now seen corresponding path program 1 times [2025-01-09 20:56:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:33,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133806712] [2025-01-09 20:56:33,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:33,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:33,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:56:33,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:56:33,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:33,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:56:33,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:33,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133806712] [2025-01-09 20:56:33,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133806712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:33,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:33,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:56:33,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091551854] [2025-01-09 20:56:33,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:33,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:56:33,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:33,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:56:33,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:56:33,973 INFO L87 Difference]: Start difference. First operand 2464 states and 4613 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:56:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:35,723 INFO L93 Difference]: Finished difference Result 4917 states and 9214 transitions. [2025-01-09 20:56:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:56:35,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-01-09 20:56:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:35,739 INFO L225 Difference]: With dead ends: 4917 [2025-01-09 20:56:35,739 INFO L226 Difference]: Without dead ends: 2544 [2025-01-09 20:56:35,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:56:35,747 INFO L435 NwaCegarLoop]: 2666 mSDtfsCounter, 6133 mSDsluCounter, 2445 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 1539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6634 SdHoareTripleChecker+Valid, 5111 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1539 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:35,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6634 Valid, 5111 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1539 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 20:56:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2025-01-09 20:56:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 1371. [2025-01-09 20:56:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 864 states have (on average 1.712962962962963) internal successors, (1480), 1365 states have internal predecessors, (1480), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 20:56:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2486 transitions. [2025-01-09 20:56:35,988 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2486 transitions. Word has length 154 [2025-01-09 20:56:35,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:35,989 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 2486 transitions. [2025-01-09 20:56:35,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:56:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2486 transitions. [2025-01-09 20:56:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 20:56:35,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:35,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:56:35,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:56:35,991 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:35,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:35,992 INFO L85 PathProgramCache]: Analyzing trace with hash 706635101, now seen corresponding path program 1 times [2025-01-09 20:56:35,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:35,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107651315] [2025-01-09 20:56:35,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:35,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:36,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:56:36,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:56:36,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:36,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:56:36,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:36,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107651315] [2025-01-09 20:56:36,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107651315] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:56:36,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640616223] [2025-01-09 20:56:36,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:36,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:56:36,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:56:36,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:56:36,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:56:36,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:56:36,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:56:36,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:36,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:36,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 20:56:36,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:56:36,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 20:56:37,109 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-01-09 20:56:37,114 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-01-09 20:56:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:56:37,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:56:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:56:37,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640616223] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:56:37,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:56:37,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 20:56:37,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515459536] [2025-01-09 20:56:37,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:56:37,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:56:37,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:37,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:56:37,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:56:37,272 INFO L87 Difference]: Start difference. First operand 1371 states and 2486 transitions. Second operand has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:56:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:41,749 INFO L93 Difference]: Finished difference Result 5221 states and 9610 transitions. [2025-01-09 20:56:41,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:56:41,750 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 164 [2025-01-09 20:56:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:41,767 INFO L225 Difference]: With dead ends: 5221 [2025-01-09 20:56:41,767 INFO L226 Difference]: Without dead ends: 4098 [2025-01-09 20:56:41,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 321 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-01-09 20:56:41,771 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 4188 mSDsluCounter, 10042 mSDsCounter, 0 mSdLazyCounter, 5106 mSolverCounterSat, 1005 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5194 SdHoareTripleChecker+Valid, 11932 SdHoareTripleChecker+Invalid, 6111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1005 IncrementalHoareTripleChecker+Valid, 5106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:41,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5194 Valid, 11932 Invalid, 6111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1005 Valid, 5106 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 20:56:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2025-01-09 20:56:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 1718. [2025-01-09 20:56:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1207 states have (on average 1.59983429991715) internal successors, (1931), 1708 states have internal predecessors, (1931), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2025-01-09 20:56:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2943 transitions. [2025-01-09 20:56:42,094 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2943 transitions. Word has length 164 [2025-01-09 20:56:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:42,095 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2943 transitions. [2025-01-09 20:56:42,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:56:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2943 transitions. [2025-01-09 20:56:42,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 20:56:42,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:42,098 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:56:42,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:56:42,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:56:42,303 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:42,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:42,303 INFO L85 PathProgramCache]: Analyzing trace with hash -809087245, now seen corresponding path program 1 times [2025-01-09 20:56:42,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:42,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254977476] [2025-01-09 20:56:42,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:42,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:42,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 20:56:42,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 20:56:42,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:42,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:56:44,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:44,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254977476] [2025-01-09 20:56:44,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254977476] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:56:44,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591823534] [2025-01-09 20:56:44,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:44,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:56:44,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:56:44,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:56:44,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:56:44,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 20:56:45,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 20:56:45,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:45,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:45,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 20:56:45,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:56:45,158 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-01-09 20:56:45,308 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-01-09 20:56:45,406 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-01-09 20:56:45,491 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-01-09 20:56:45,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:56:45,575 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-01-09 20:56:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:56:45,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:56:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:56:46,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591823534] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:56:46,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:56:46,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-01-09 20:56:46,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112509734] [2025-01-09 20:56:46,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:56:46,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 20:56:46,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:46,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 20:56:46,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2025-01-09 20:56:46,025 INFO L87 Difference]: Start difference. First operand 1718 states and 2943 transitions. Second operand has 20 states, 20 states have (on average 35.45) internal successors, (709), 20 states have internal predecessors, (709), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:56:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:55,269 INFO L93 Difference]: Finished difference Result 10549 states and 19373 transitions. [2025-01-09 20:56:55,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 20:56:55,269 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.45) internal successors, (709), 20 states have internal predecessors, (709), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 392 [2025-01-09 20:56:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:55,306 INFO L225 Difference]: With dead ends: 10549 [2025-01-09 20:56:55,307 INFO L226 Difference]: Without dead ends: 9426 [2025-01-09 20:56:55,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 776 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=426, Unknown=0, NotChecked=0, Total=650 [2025-01-09 20:56:55,313 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 17879 mSDsluCounter, 17641 mSDsCounter, 0 mSdLazyCounter, 9861 mSolverCounterSat, 2935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20891 SdHoareTripleChecker+Valid, 19531 SdHoareTripleChecker+Invalid, 12796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2935 IncrementalHoareTripleChecker+Valid, 9861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:55,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20891 Valid, 19531 Invalid, 12796 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2935 Valid, 9861 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2025-01-09 20:56:55,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9426 states. [2025-01-09 20:56:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9426 to 2582. [2025-01-09 20:56:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2582 states, 2065 states have (on average 1.4813559322033898) internal successors, (3059), 2566 states have internal predecessors, (3059), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 20:56:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 4083 transitions. [2025-01-09 20:56:56,173 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 4083 transitions. Word has length 392 [2025-01-09 20:56:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:56,173 INFO L471 AbstractCegarLoop]: Abstraction has 2582 states and 4083 transitions. [2025-01-09 20:56:56,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.45) internal successors, (709), 20 states have internal predecessors, (709), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:56:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 4083 transitions. [2025-01-09 20:56:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2025-01-09 20:56:56,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:56,185 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:56:56,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 20:56:56,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:56:56,388 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:56,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash 716618015, now seen corresponding path program 2 times [2025-01-09 20:56:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:56,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434607660] [2025-01-09 20:56:56,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:56:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:56,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 848 statements into 2 equivalence classes. [2025-01-09 20:56:56,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 848 statements. [2025-01-09 20:56:56,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:56:56,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:56:56,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:56,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434607660] [2025-01-09 20:56:56,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434607660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:56,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:56,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:56:56,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675720470] [2025-01-09 20:56:56,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:56,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:56:56,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:56,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:56:56,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:56:56,802 INFO L87 Difference]: Start difference. First operand 2582 states and 4083 transitions. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:56:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:57,467 INFO L93 Difference]: Finished difference Result 3719 states and 6264 transitions. [2025-01-09 20:56:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:56:57,468 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 848 [2025-01-09 20:56:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:57,477 INFO L225 Difference]: With dead ends: 3719 [2025-01-09 20:56:57,477 INFO L226 Difference]: Without dead ends: 2597 [2025-01-09 20:56:57,479 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-01-09 20:56:57,480 INFO L435 NwaCegarLoop]: 2346 mSDtfsCounter, 51 mSDsluCounter, 13623 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 15969 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:57,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 15969 Invalid, 510 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:56:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2025-01-09 20:56:57,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2593. [2025-01-09 20:56:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2593 states, 2076 states have (on average 1.4788053949903661) internal successors, (3070), 2577 states have internal predecessors, (3070), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 20:56:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 4094 transitions. [2025-01-09 20:56:57,640 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 4094 transitions. Word has length 848 [2025-01-09 20:56:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:57,641 INFO L471 AbstractCegarLoop]: Abstraction has 2593 states and 4094 transitions. [2025-01-09 20:56:57,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:56:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 4094 transitions. [2025-01-09 20:56:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2025-01-09 20:56:57,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:57,655 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:56:57,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:56:57,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:57,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1244047882, now seen corresponding path program 1 times [2025-01-09 20:56:57,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:57,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35172096] [2025-01-09 20:56:57,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:57,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:57,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 849 statements into 1 equivalence classes. [2025-01-09 20:56:58,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 849 of 849 statements. [2025-01-09 20:56:58,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:58,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:56:59,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:59,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35172096] [2025-01-09 20:56:59,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35172096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:59,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:59,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:56:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157776631] [2025-01-09 20:56:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:59,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:56:59,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:59,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:56:59,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:56:59,693 INFO L87 Difference]: Start difference. First operand 2593 states and 4094 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:56:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:59,996 INFO L93 Difference]: Finished difference Result 3731 states and 6273 transitions. [2025-01-09 20:56:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:56:59,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 849 [2025-01-09 20:56:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:57:00,006 INFO L225 Difference]: With dead ends: 3731 [2025-01-09 20:57:00,006 INFO L226 Difference]: Without dead ends: 2598 [2025-01-09 20:57:00,010 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-01-09 20:57:00,010 INFO L435 NwaCegarLoop]: 2353 mSDtfsCounter, 21 mSDsluCounter, 9106 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 11459 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:57:00,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 11459 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:57:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2025-01-09 20:57:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2597. [2025-01-09 20:57:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2080 states have (on average 1.4783653846153846) internal successors, (3075), 2581 states have internal predecessors, (3075), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 20:57:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 4099 transitions. [2025-01-09 20:57:00,159 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 4099 transitions. Word has length 849 [2025-01-09 20:57:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:57:00,160 INFO L471 AbstractCegarLoop]: Abstraction has 2597 states and 4099 transitions. [2025-01-09 20:57:00,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:57:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 4099 transitions. [2025-01-09 20:57:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2025-01-09 20:57:00,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:57:00,167 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:57:00,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:57:00,167 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:57:00,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:57:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash 12961694, now seen corresponding path program 1 times [2025-01-09 20:57:00,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:57:00,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366172179] [2025-01-09 20:57:00,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:57:00,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:57:00,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 849 statements into 1 equivalence classes. [2025-01-09 20:57:00,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 849 of 849 statements. [2025-01-09 20:57:00,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:57:00,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:57:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:57:01,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:57:01,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366172179] [2025-01-09 20:57:01,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366172179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:57:01,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:57:01,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:57:01,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168433108] [2025-01-09 20:57:01,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:57:01,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:57:01,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:57:01,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:57:01,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:57:01,977 INFO L87 Difference]: Start difference. First operand 2597 states and 4099 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:57:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:57:02,448 INFO L93 Difference]: Finished difference Result 3742 states and 6287 transitions. [2025-01-09 20:57:02,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:57:02,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 849 [2025-01-09 20:57:02,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:57:02,462 INFO L225 Difference]: With dead ends: 3742 [2025-01-09 20:57:02,463 INFO L226 Difference]: Without dead ends: 2605 [2025-01-09 20:57:02,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:57:02,468 INFO L435 NwaCegarLoop]: 2346 mSDtfsCounter, 24 mSDsluCounter, 13656 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 16002 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:57:02,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 16002 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:57:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2025-01-09 20:57:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2597. [2025-01-09 20:57:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2080 states have (on average 1.4783653846153846) internal successors, (3075), 2581 states have internal predecessors, (3075), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 20:57:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 4099 transitions. [2025-01-09 20:57:02,623 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 4099 transitions. Word has length 849 [2025-01-09 20:57:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:57:02,624 INFO L471 AbstractCegarLoop]: Abstraction has 2597 states and 4099 transitions. [2025-01-09 20:57:02,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:57:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 4099 transitions. [2025-01-09 20:57:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 20:57:02,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:57:02,631 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:57:02,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:57:02,631 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:57:02,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:57:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash 905538411, now seen corresponding path program 1 times [2025-01-09 20:57:02,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:57:02,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956189717] [2025-01-09 20:57:02,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:57:02,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:57:02,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-01-09 20:57:03,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-01-09 20:57:03,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:57:03,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:57:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:57:04,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:57:04,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956189717] [2025-01-09 20:57:04,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956189717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:57:04,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:57:04,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:57:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126708958] [2025-01-09 20:57:04,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:57:04,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:57:04,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:57:04,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:57:04,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:57:04,266 INFO L87 Difference]: Start difference. First operand 2597 states and 4099 transitions. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:57:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:57:04,699 INFO L93 Difference]: Finished difference Result 3745 states and 6292 transitions. [2025-01-09 20:57:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:57:04,699 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2025-01-09 20:57:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:57:04,709 INFO L225 Difference]: With dead ends: 3745 [2025-01-09 20:57:04,709 INFO L226 Difference]: Without dead ends: 2608 [2025-01-09 20:57:04,712 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-01-09 20:57:04,712 INFO L435 NwaCegarLoop]: 2347 mSDtfsCounter, 31 mSDsluCounter, 16014 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18361 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:57:04,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18361 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:57:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2025-01-09 20:57:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2605. [2025-01-09 20:57:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 2088 states have (on average 1.4774904214559388) internal successors, (3085), 2589 states have internal predecessors, (3085), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 20:57:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4109 transitions. [2025-01-09 20:57:04,870 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4109 transitions. Word has length 850 [2025-01-09 20:57:04,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:57:04,871 INFO L471 AbstractCegarLoop]: Abstraction has 2605 states and 4109 transitions. [2025-01-09 20:57:04,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:57:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4109 transitions. [2025-01-09 20:57:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 20:57:04,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:57:04,878 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:57:04,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:57:04,878 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:57:04,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:57:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash -17195295, now seen corresponding path program 1 times [2025-01-09 20:57:04,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:57:04,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165064518] [2025-01-09 20:57:04,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:57:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:57:05,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 20:57:05,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 20:57:05,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:57:05,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:57:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:57:13,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:57:13,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165064518] [2025-01-09 20:57:13,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165064518] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:57:13,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590579952] [2025-01-09 20:57:13,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:57:13,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:57:13,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:57:13,499 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:57:13,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 20:57:14,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 20:57:14,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 20:57:14,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:57:14,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:57:14,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 4160 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 20:57:14,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:57:14,624 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-01-09 20:57:14,797 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-01-09 20:57:14,877 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-01-09 20:57:14,956 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-01-09 20:57:15,035 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-01-09 20:57:15,114 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-01-09 20:57:15,193 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-01-09 20:57:15,268 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-01-09 20:57:15,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-01-09 20:57:15,420 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-01-09 20:57:15,509 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-01-09 20:57:15,513 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-01-09 20:57:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:57:15,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:57:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:57:16,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590579952] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:57:16,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:57:16,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 38 [2025-01-09 20:57:16,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622565287] [2025-01-09 20:57:16,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:57:16,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 20:57:16,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:57:16,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 20:57:16,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 20:57:16,524 INFO L87 Difference]: Start difference. First operand 2605 states and 4109 transitions. Second operand has 38 states, 38 states have (on average 43.05263157894737) internal successors, (1636), 38 states have internal predecessors, (1636), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)