./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-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_test2-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 d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:54:26,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:54:26,080 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:54:26,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:54:26,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:54:26,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:54:26,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:54:26,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:54:26,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:54:26,110 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:54:26,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:54:26,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:54:26,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:54:26,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:54:26,111 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:54:26,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:54:26,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:54:26,112 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:54:26,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:54:26,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:54:26,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:54:26,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:54:26,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:54:26,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:54:26,112 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:54:26,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:54:26,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:54:26,112 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:54:26,113 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:54:26,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:54:26,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:54:26,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:54:26,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:54:26,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:54:26,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:54:26,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:54:26,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:54:26,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:54:26,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:54:26,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:54:26,114 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:54:26,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:54:26,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:54:26,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:54:26,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:54:26,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:54:26,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:54:26,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:54:26,114 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 -> d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d [2025-01-09 20:54:26,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:54:26,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:54:26,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:54:26,349 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:54:26,350 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:54:26,351 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_test2-2.i [2025-01-09 20:54:27,565 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50b098680/c735c47cfa7d4ae1844a1577bf0779e1/FLAGea5c94f01 [2025-01-09 20:54:27,844 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:54:27,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2025-01-09 20:54:27,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50b098680/c735c47cfa7d4ae1844a1577bf0779e1/FLAGea5c94f01 [2025-01-09 20:54:27,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50b098680/c735c47cfa7d4ae1844a1577bf0779e1 [2025-01-09 20:54:27,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:54:27,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:54:27,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:54:27,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:54:27,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:54:27,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:54:27" (1/1) ... [2025-01-09 20:54:27,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24eea893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:27, skipping insertion in model container [2025-01-09 20:54:27,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:54:27" (1/1) ... [2025-01-09 20:54:27,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:54:28,203 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_test2-2.i[37019,37032] [2025-01-09 20:54:28,272 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_test2-2.i[47352,47365] [2025-01-09 20:54:28,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:54:28,289 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:54:28,310 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_test2-2.i[37019,37032] [2025-01-09 20:54:28,354 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_test2-2.i[47352,47365] [2025-01-09 20:54:28,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:54:28,388 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:54:28,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28 WrapperNode [2025-01-09 20:54:28,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:54:28,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:54:28,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:54:28,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:54:28,397 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:54:28" (1/1) ... [2025-01-09 20:54:28,426 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:54:28" (1/1) ... [2025-01-09 20:54:28,492 INFO L138 Inliner]: procedures = 208, calls = 278, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1423 [2025-01-09 20:54:28,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:54:28,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:54:28,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:54:28,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:54:28,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28" (1/1) ... [2025-01-09 20:54:28,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28" (1/1) ... [2025-01-09 20:54:28,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28" (1/1) ... [2025-01-09 20:54:28,576 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 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, 50, 4]. [2025-01-09 20:54:28,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28" (1/1) ... [2025-01-09 20:54:28,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28" (1/1) ... [2025-01-09 20:54:28,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28" (1/1) ... [2025-01-09 20:54:28,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28" (1/1) ... [2025-01-09 20:54:28,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28" (1/1) ... [2025-01-09 20:54:28,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28" (1/1) ... [2025-01-09 20:54:28,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28" (1/1) ... [2025-01-09 20:54:28,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:54:28,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:54:28,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:54:28,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:54:28,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28" (1/1) ... [2025-01-09 20:54:28,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:54:28,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:54:28,695 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:54:28,699 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:54:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:54:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:54:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:54:28,719 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:54:28,719 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:54:28,719 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:54:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:54:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:54:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:54:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:54:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:54:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:54:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:54:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:54:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:54:28,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:54:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:54:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:54:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:54:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:54:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:54:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:54:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:54:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:54:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:54:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:54:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:54:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:54:28,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:54:28,888 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:54:28,890 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:54:30,022 INFO L? ?]: Removed 328 outVars from TransFormulas that were not future-live. [2025-01-09 20:54:30,022 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:54:30,043 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:54:30,043 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2025-01-09 20:54:30,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:54:30 BoogieIcfgContainer [2025-01-09 20:54:30,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:54:30,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:54:30,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:54:30,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:54:30,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:54:27" (1/3) ... [2025-01-09 20:54:30,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e099819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:54:30, skipping insertion in model container [2025-01-09 20:54:30,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:28" (2/3) ... [2025-01-09 20:54:30,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e099819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:54:30, skipping insertion in model container [2025-01-09 20:54:30,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:54:30" (3/3) ... [2025-01-09 20:54:30,050 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-2.i [2025-01-09 20:54:30,060 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:54:30,061 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test2-2.i that has 5 procedures, 421 locations, 1 initial locations, 38 loop locations, and 2 error locations. [2025-01-09 20:54:30,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:54:30,116 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;@2d846942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:54:30,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 20:54:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 413 states, 400 states have (on average 1.615) internal successors, (646), 407 states have internal predecessors, (646), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:54:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 20:54:30,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:30,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:54:30,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:30,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1337805440, now seen corresponding path program 1 times [2025-01-09 20:54:30,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:30,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492977883] [2025-01-09 20:54:30,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:30,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:30,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 20:54:30,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 20:54:30,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:30,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:30,238 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:54:30,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492977883] [2025-01-09 20:54:30,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492977883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:30,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:30,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:54:30,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784535569] [2025-01-09 20:54:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:30,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:54:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:30,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:54:30,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:54:30,261 INFO L87 Difference]: Start difference. First operand has 413 states, 400 states have (on average 1.615) internal successors, (646), 407 states have internal predecessors, (646), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) 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:54:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:30,311 INFO L93 Difference]: Finished difference Result 824 states and 1327 transitions. [2025-01-09 20:54:30,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:54:30,313 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:54:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:30,320 INFO L225 Difference]: With dead ends: 824 [2025-01-09 20:54:30,322 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 20:54:30,328 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:54:30,329 INFO L435 NwaCegarLoop]: 598 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, 598 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:54:30,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:54:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 20:54:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-01-09 20:54:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 364 states have (on average 1.4615384615384615) internal successors, (532), 370 states have internal predecessors, (532), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:54:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 548 transitions. [2025-01-09 20:54:30,375 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 548 transitions. Word has length 9 [2025-01-09 20:54:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:30,376 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 548 transitions. [2025-01-09 20:54:30,376 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:54:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 548 transitions. [2025-01-09 20:54:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 20:54:30,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:30,378 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:54:30,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:54:30,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:30,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1772541247, now seen corresponding path program 1 times [2025-01-09 20:54:30,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:30,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571881342] [2025-01-09 20:54:30,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:30,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:30,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 20:54:30,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 20:54:30,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:30,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:30,798 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:54:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571881342] [2025-01-09 20:54:30,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571881342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:30,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:54:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746686757] [2025-01-09 20:54:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:30,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:54:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:30,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:54:30,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:54:30,800 INFO L87 Difference]: Start difference. First operand 376 states and 548 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:54:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:30,942 INFO L93 Difference]: Finished difference Result 914 states and 1343 transitions. [2025-01-09 20:54:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:54:30,943 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:54:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:30,946 INFO L225 Difference]: With dead ends: 914 [2025-01-09 20:54:30,946 INFO L226 Difference]: Without dead ends: 739 [2025-01-09 20:54:30,947 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:54:30,947 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 517 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:30,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1664 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:54:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-01-09 20:54:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 378. [2025-01-09 20:54:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 366 states have (on average 1.459016393442623) internal successors, (534), 372 states have internal predecessors, (534), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:54:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 550 transitions. [2025-01-09 20:54:30,976 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 550 transitions. Word has length 63 [2025-01-09 20:54:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:30,976 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 550 transitions. [2025-01-09 20:54:30,976 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:54:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 550 transitions. [2025-01-09 20:54:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:54:30,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:30,982 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:54:30,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:54:30,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:30,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:30,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1726808251, now seen corresponding path program 1 times [2025-01-09 20:54:30,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:30,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500428047] [2025-01-09 20:54:30,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:30,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:31,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:54:31,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:54:31,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:31,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:31,303 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:54:31,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:31,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500428047] [2025-01-09 20:54:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500428047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:31,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:54:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188632865] [2025-01-09 20:54:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:31,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:54:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:31,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:54:31,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:54:31,306 INFO L87 Difference]: Start difference. First operand 378 states and 550 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:54:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:31,384 INFO L93 Difference]: Finished difference Result 710 states and 1030 transitions. [2025-01-09 20:54:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:54:31,385 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:54:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:31,388 INFO L225 Difference]: With dead ends: 710 [2025-01-09 20:54:31,388 INFO L226 Difference]: Without dead ends: 336 [2025-01-09 20:54:31,389 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:54:31,390 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 30 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1320 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:31,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1320 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:54:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-01-09 20:54:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-01-09 20:54:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 324 states have (on average 1.4104938271604939) internal successors, (457), 330 states have internal predecessors, (457), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:54:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 473 transitions. [2025-01-09 20:54:31,411 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 473 transitions. Word has length 139 [2025-01-09 20:54:31,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:31,411 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 473 transitions. [2025-01-09 20:54:31,411 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:54:31,411 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 473 transitions. [2025-01-09 20:54:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:54:31,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:31,416 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:54:31,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:54:31,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:31,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:31,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2010984557, now seen corresponding path program 1 times [2025-01-09 20:54:31,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:31,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036725784] [2025-01-09 20:54:31,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:31,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:54:31,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:54:31,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:31,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:31,590 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:54:31,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:31,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036725784] [2025-01-09 20:54:31,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036725784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:31,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:31,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:54:31,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039498366] [2025-01-09 20:54:31,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:31,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:54:31,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:31,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:54:31,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:54:31,595 INFO L87 Difference]: Start difference. First operand 336 states and 473 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:54:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:31,639 INFO L93 Difference]: Finished difference Result 668 states and 942 transitions. [2025-01-09 20:54:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:54:31,640 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:54:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:31,643 INFO L225 Difference]: With dead ends: 668 [2025-01-09 20:54:31,643 INFO L226 Difference]: Without dead ends: 336 [2025-01-09 20:54:31,644 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:54:31,644 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 1 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 896 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:54:31,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 896 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:54:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-01-09 20:54:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-01-09 20:54:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 324 states have (on average 1.4012345679012346) internal successors, (454), 330 states have internal predecessors, (454), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:54:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2025-01-09 20:54:31,662 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 139 [2025-01-09 20:54:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:31,662 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2025-01-09 20:54:31,662 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:54:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2025-01-09 20:54:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:54:31,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:31,664 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:54:31,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:54:31,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:31,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1820533361, now seen corresponding path program 1 times [2025-01-09 20:54:31,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:31,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462040734] [2025-01-09 20:54:31,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:31,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:31,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:54:31,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:54:31,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:31,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:31,836 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:54:31,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:31,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462040734] [2025-01-09 20:54:31,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462040734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:31,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:31,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:54:31,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129108092] [2025-01-09 20:54:31,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:31,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:54:31,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:31,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:54:31,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:54:31,837 INFO L87 Difference]: Start difference. First operand 336 states and 470 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:54:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:31,898 INFO L93 Difference]: Finished difference Result 902 states and 1276 transitions. [2025-01-09 20:54:31,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:54:31,899 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:54:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:31,901 INFO L225 Difference]: With dead ends: 902 [2025-01-09 20:54:31,903 INFO L226 Difference]: Without dead ends: 570 [2025-01-09 20:54:31,904 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:54:31,904 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 270 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1111 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:54:31,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1111 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:54:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-01-09 20:54:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2025-01-09 20:54:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 551 states have (on average 1.4174228675136116) internal successors, (781), 562 states have internal predecessors, (781), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:54:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 807 transitions. [2025-01-09 20:54:31,923 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 807 transitions. Word has length 139 [2025-01-09 20:54:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:31,923 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 807 transitions. [2025-01-09 20:54:31,923 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:54:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 807 transitions. [2025-01-09 20:54:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:54:31,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:31,925 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:54:31,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:54:31,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:31,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:31,927 INFO L85 PathProgramCache]: Analyzing trace with hash 462311130, now seen corresponding path program 1 times [2025-01-09 20:54:31,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:31,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654760057] [2025-01-09 20:54:31,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:31,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:31,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:54:32,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:54:32,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:32,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:32,190 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:54:32,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:32,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654760057] [2025-01-09 20:54:32,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654760057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:32,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:32,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:54:32,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53092905] [2025-01-09 20:54:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:32,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:54:32,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:32,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:54:32,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:54:32,193 INFO L87 Difference]: Start difference. First operand 568 states and 807 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 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:54:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:32,258 INFO L93 Difference]: Finished difference Result 803 states and 1155 transitions. [2025-01-09 20:54:32,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:54:32,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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:54:32,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:32,262 INFO L225 Difference]: With dead ends: 803 [2025-01-09 20:54:32,262 INFO L226 Difference]: Without dead ends: 484 [2025-01-09 20:54:32,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:54:32,264 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 30 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:32,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1073 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:54:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-01-09 20:54:32,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-01-09 20:54:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 467 states have (on average 1.342612419700214) internal successors, (627), 478 states have internal predecessors, (627), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:54:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 653 transitions. [2025-01-09 20:54:32,280 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 653 transitions. Word has length 154 [2025-01-09 20:54:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:32,280 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 653 transitions. [2025-01-09 20:54:32,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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:54:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 653 transitions. [2025-01-09 20:54:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:54:32,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:32,282 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:54:32,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:54:32,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:32,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:32,283 INFO L85 PathProgramCache]: Analyzing trace with hash -709202994, now seen corresponding path program 1 times [2025-01-09 20:54:32,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:32,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245718020] [2025-01-09 20:54:32,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:32,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:32,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:54:32,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:54:32,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:32,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:32,531 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:54:32,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:32,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245718020] [2025-01-09 20:54:32,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245718020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:32,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:32,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:54:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293568600] [2025-01-09 20:54:32,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:32,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:54:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:32,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:54:32,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:54:32,532 INFO L87 Difference]: Start difference. First operand 484 states and 653 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:54:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:32,868 INFO L93 Difference]: Finished difference Result 957 states and 1294 transitions. [2025-01-09 20:54:32,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:54:32,869 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:54:32,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:32,872 INFO L225 Difference]: With dead ends: 957 [2025-01-09 20:54:32,872 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 20:54:32,873 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:54:32,873 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 800 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:32,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1049 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:54:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 20:54:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 381. [2025-01-09 20:54:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 375 states have internal predecessors, (490), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:54:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 506 transitions. [2025-01-09 20:54:32,905 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 506 transitions. Word has length 154 [2025-01-09 20:54:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:32,905 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 506 transitions. [2025-01-09 20:54:32,905 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:54:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 506 transitions. [2025-01-09 20:54:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 20:54:32,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:32,907 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:54:32,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:54:32,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:32,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:32,908 INFO L85 PathProgramCache]: Analyzing trace with hash -809852259, now seen corresponding path program 1 times [2025-01-09 20:54:32,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:32,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091995134] [2025-01-09 20:54:32,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:32,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:32,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:54:32,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:54:32,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:32,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:33,535 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:54:33,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:33,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091995134] [2025-01-09 20:54:33,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091995134] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:54:33,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890730617] [2025-01-09 20:54:33,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:33,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:33,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:54:33,540 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:54:33,545 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:54:33,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:54:33,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:54:33,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:33,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:33,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 20:54:33,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:54:33,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:54:34,064 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 23 treesize of output 3 [2025-01-09 20:54:34,070 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:54:34,086 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:54:34,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:54:34,250 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:54:34,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890730617] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:54:34,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:54:34,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 20:54:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362008783] [2025-01-09 20:54:34,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:54:34,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:54:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:34,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:54:34,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:54:34,252 INFO L87 Difference]: Start difference. First operand 381 states and 506 transitions. Second operand has 11 states, 11 states have (on average 29.545454545454547) internal successors, (325), 11 states have internal predecessors, (325), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 20:54:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:34,499 INFO L93 Difference]: Finished difference Result 1261 states and 1690 transitions. [2025-01-09 20:54:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:54:34,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.545454545454547) internal successors, (325), 11 states have internal predecessors, (325), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 164 [2025-01-09 20:54:34,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:34,504 INFO L225 Difference]: With dead ends: 1261 [2025-01-09 20:54:34,504 INFO L226 Difference]: Without dead ends: 1128 [2025-01-09 20:54:34,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 321 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-01-09 20:54:34,505 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 1184 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:34,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 2680 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:54:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-01-09 20:54:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 728. [2025-01-09 20:54:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 712 states have (on average 1.321629213483146) internal successors, (941), 718 states have internal predecessors, (941), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:54:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 963 transitions. [2025-01-09 20:54:34,529 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 963 transitions. Word has length 164 [2025-01-09 20:54:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:34,530 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 963 transitions. [2025-01-09 20:54:34,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.545454545454547) internal successors, (325), 11 states have internal predecessors, (325), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 20:54:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 963 transitions. [2025-01-09 20:54:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 20:54:34,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:34,537 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:54:34,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 20:54:34,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:34,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:34,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1156074547, now seen corresponding path program 1 times [2025-01-09 20:54:34,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:34,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426949988] [2025-01-09 20:54:34,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:34,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:34,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 20:54:34,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 20:54:34,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:34,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:37,533 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:54:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:37,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426949988] [2025-01-09 20:54:37,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426949988] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:54:37,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093492760] [2025-01-09 20:54:37,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:37,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:37,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:54:37,536 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:54:37,537 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:54:37,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 20:54:38,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 20:54:38,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:38,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:38,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 20:54:38,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:54:38,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:54:38,352 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 23 treesize of output 3 [2025-01-09 20:54:38,451 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:54:38,543 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:54:38,631 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:54:38,635 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:54:38,642 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:54:38,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:54:39,088 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:54:39,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093492760] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:54:39,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:54:39,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 19 [2025-01-09 20:54:39,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465771957] [2025-01-09 20:54:39,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:54:39,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 20:54:39,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:39,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 20:54:39,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2025-01-09 20:54:39,091 INFO L87 Difference]: Start difference. First operand 728 states and 963 transitions. Second operand has 19 states, 19 states have (on average 41.31578947368421) internal successors, (785), 19 states have internal predecessors, (785), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 20:54:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:39,561 INFO L93 Difference]: Finished difference Result 2503 states and 3358 transitions. [2025-01-09 20:54:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 20:54:39,561 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 41.31578947368421) internal successors, (785), 19 states have internal predecessors, (785), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 392 [2025-01-09 20:54:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:39,570 INFO L225 Difference]: With dead ends: 2503 [2025-01-09 20:54:39,570 INFO L226 Difference]: Without dead ends: 2370 [2025-01-09 20:54:39,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 775 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-01-09 20:54:39,573 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 3700 mSDsluCounter, 4406 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3735 SdHoareTripleChecker+Valid, 4811 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:39,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3735 Valid, 4811 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:54:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2025-01-09 20:54:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1592. [2025-01-09 20:54:39,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1570 states have (on average 1.3178343949044586) internal successors, (2069), 1576 states have internal predecessors, (2069), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:54:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2103 transitions. [2025-01-09 20:54:39,621 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2103 transitions. Word has length 392 [2025-01-09 20:54:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:39,623 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2103 transitions. [2025-01-09 20:54:39,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 41.31578947368421) internal successors, (785), 19 states have internal predecessors, (785), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 20:54:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2103 transitions. [2025-01-09 20:54:39,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2025-01-09 20:54:39,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:39,636 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:54:39,649 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:54:39,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:39,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:39,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:39,839 INFO L85 PathProgramCache]: Analyzing trace with hash -247187873, now seen corresponding path program 2 times [2025-01-09 20:54:39,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:39,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266570061] [2025-01-09 20:54:39,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:54:39,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:40,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 848 statements into 2 equivalence classes. [2025-01-09 20:54:40,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 848 statements. [2025-01-09 20:54:40,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:54:40,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:40,313 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:54:40,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:40,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266570061] [2025-01-09 20:54:40,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266570061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:40,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:40,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:54:40,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481048835] [2025-01-09 20:54:40,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:40,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:54:40,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:40,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:54:40,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:54:40,315 INFO L87 Difference]: Start difference. First operand 1592 states and 2103 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 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:54:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:40,617 INFO L93 Difference]: Finished difference Result 1735 states and 2297 transitions. [2025-01-09 20:54:40,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:54:40,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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:54:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:40,623 INFO L225 Difference]: With dead ends: 1735 [2025-01-09 20:54:40,623 INFO L226 Difference]: Without dead ends: 1603 [2025-01-09 20:54:40,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:54:40,625 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 21 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:40,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1559 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:54:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-01-09 20:54:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1596. [2025-01-09 20:54:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1574 states have (on average 1.3170266836086404) internal successors, (2073), 1580 states have internal predecessors, (2073), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:54:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2107 transitions. [2025-01-09 20:54:40,661 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2107 transitions. Word has length 848 [2025-01-09 20:54:40,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:40,662 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2107 transitions. [2025-01-09 20:54:40,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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:54:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2107 transitions. [2025-01-09 20:54:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2025-01-09 20:54:40,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:40,676 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:54:40,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:54:40,676 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:40,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:40,677 INFO L85 PathProgramCache]: Analyzing trace with hash 202601438, now seen corresponding path program 1 times [2025-01-09 20:54:40,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:40,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876960889] [2025-01-09 20:54:40,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:40,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:40,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 849 statements into 1 equivalence classes. [2025-01-09 20:54:41,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 849 of 849 statements. [2025-01-09 20:54:41,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:41,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:43,042 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:54:43,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:43,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876960889] [2025-01-09 20:54:43,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876960889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:43,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:43,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:54:43,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238125203] [2025-01-09 20:54:43,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:43,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:54:43,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:43,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:54:43,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:54:43,044 INFO L87 Difference]: Start difference. First operand 1596 states and 2107 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:54:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:43,338 INFO L93 Difference]: Finished difference Result 1747 states and 2311 transitions. [2025-01-09 20:54:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:54:43,338 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:54:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:43,345 INFO L225 Difference]: With dead ends: 1747 [2025-01-09 20:54:43,345 INFO L226 Difference]: Without dead ends: 1611 [2025-01-09 20:54:43,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:54:43,348 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 25 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:43,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1872 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:54:43,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-01-09 20:54:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1600. [2025-01-09 20:54:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1578 states have (on average 1.3168567807351077) internal successors, (2078), 1584 states have internal predecessors, (2078), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:54:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2112 transitions. [2025-01-09 20:54:43,386 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2112 transitions. Word has length 849 [2025-01-09 20:54:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:43,388 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2112 transitions. [2025-01-09 20:54:43,388 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:54:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2112 transitions. [2025-01-09 20:54:43,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 20:54:43,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:43,394 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:54:43,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:54:43,394 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:43,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:43,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1802712917, now seen corresponding path program 1 times [2025-01-09 20:54:43,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:43,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200879343] [2025-01-09 20:54:43,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:43,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:43,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-01-09 20:54:43,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-01-09 20:54:43,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:43,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:45,223 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:54:45,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:45,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200879343] [2025-01-09 20:54:45,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200879343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:45,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:45,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:54:45,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236137447] [2025-01-09 20:54:45,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:45,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:54:45,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:45,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:54:45,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:54:45,226 INFO L87 Difference]: Start difference. First operand 1600 states and 2112 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:54:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:45,626 INFO L93 Difference]: Finished difference Result 1751 states and 2318 transitions. [2025-01-09 20:54:45,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:54:45,626 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:54:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:45,633 INFO L225 Difference]: With dead ends: 1751 [2025-01-09 20:54:45,633 INFO L226 Difference]: Without dead ends: 1611 [2025-01-09 20:54:45,634 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:54:45,634 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 31 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:45,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2525 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:54:45,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-01-09 20:54:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1608. [2025-01-09 20:54:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1586 states have (on average 1.3165195460277428) internal successors, (2088), 1592 states have internal predecessors, (2088), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:54:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2122 transitions. [2025-01-09 20:54:45,669 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2122 transitions. Word has length 850 [2025-01-09 20:54:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:45,670 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2122 transitions. [2025-01-09 20:54:45,670 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:54:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2122 transitions. [2025-01-09 20:54:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 20:54:45,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:45,677 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:54:45,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:54:45,678 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:45,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:45,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1577988860, now seen corresponding path program 1 times [2025-01-09 20:54:45,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:45,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840860097] [2025-01-09 20:54:45,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:45,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:45,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-01-09 20:54:46,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-01-09 20:54:46,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:46,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:47,425 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:54:47,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:47,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840860097] [2025-01-09 20:54:47,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840860097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:47,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:47,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:54:47,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234565067] [2025-01-09 20:54:47,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:47,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:54:47,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:47,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:54:47,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:54:47,427 INFO L87 Difference]: Start difference. First operand 1608 states and 2122 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 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:54:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:47,675 INFO L93 Difference]: Finished difference Result 1765 states and 2332 transitions. [2025-01-09 20:54:47,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:54:47,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 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:54:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:47,681 INFO L225 Difference]: With dead ends: 1765 [2025-01-09 20:54:47,681 INFO L226 Difference]: Without dead ends: 1617 [2025-01-09 20:54:47,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:54:47,682 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 15 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:47,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1849 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:54:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-01-09 20:54:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1611. [2025-01-09 20:54:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1589 states have (on average 1.315921963499056) internal successors, (2091), 1595 states have internal predecessors, (2091), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:54:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2125 transitions. [2025-01-09 20:54:47,715 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2125 transitions. Word has length 850 [2025-01-09 20:54:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:47,716 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2125 transitions. [2025-01-09 20:54:47,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 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:54:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2125 transitions. [2025-01-09 20:54:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 20:54:47,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:47,722 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:54:47,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:54:47,722 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:47,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1929210657, now seen corresponding path program 1 times [2025-01-09 20:54:47,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:47,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681883712] [2025-01-09 20:54:47,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:47,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:47,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes.