./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c74f92ba3d978b3a2efb098ebc8eb373bc42abebaabf8c6efaf148fbe05036e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:31:39,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:31:39,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:31:39,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:31:39,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:31:39,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:31:39,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:31:39,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:31:39,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:31:39,078 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:31:39,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:31:39,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:31:39,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:31:39,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:31:39,079 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:31:39,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:31:39,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:31:39,079 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:31:39,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:31:39,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:31:39,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:31:39,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:31:39,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:31:39,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:31:39,079 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:31:39,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:31:39,080 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:31:39,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:31:39,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:31:39,082 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> c74f92ba3d978b3a2efb098ebc8eb373bc42abebaabf8c6efaf148fbe05036e0 [2025-03-16 19:31:39,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:31:39,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:31:39,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:31:39,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:31:39,283 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:31:39,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-03-16 19:31:40,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/758739b9b/18537c0941de44b587c7cb5b80b44d14/FLAG10a50c4c3 [2025-03-16 19:31:40,725 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:31:40,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-03-16 19:31:40,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/758739b9b/18537c0941de44b587c7cb5b80b44d14/FLAG10a50c4c3 [2025-03-16 19:31:40,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/758739b9b/18537c0941de44b587c7cb5b80b44d14 [2025-03-16 19:31:40,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:31:40,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:31:40,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:31:40,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:31:40,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:31:40,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:31:40" (1/1) ... [2025-03-16 19:31:40,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfb277e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:40, skipping insertion in model container [2025-03-16 19:31:40,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:31:40" (1/1) ... [2025-03-16 19:31:41,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:31:41,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18857,18870] [2025-03-16 19:31:41,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25957,25970] [2025-03-16 19:31:41,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29482,29495] [2025-03-16 19:31:41,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32880,32893] [2025-03-16 19:31:41,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36938,36951] [2025-03-16 19:31:41,311 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40412,40425] [2025-03-16 19:31:41,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43977,43990] [2025-03-16 19:31:41,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47412,47425] [2025-03-16 19:31:41,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[51091,51104] [2025-03-16 19:31:41,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54693,54706] [2025-03-16 19:31:41,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58222,58235] [2025-03-16 19:31:41,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:31:41,383 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:31:41,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18857,18870] [2025-03-16 19:31:41,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25957,25970] [2025-03-16 19:31:41,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29482,29495] [2025-03-16 19:31:41,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32880,32893] [2025-03-16 19:31:41,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36938,36951] [2025-03-16 19:31:41,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40412,40425] [2025-03-16 19:31:41,480 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43977,43990] [2025-03-16 19:31:41,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47412,47425] [2025-03-16 19:31:41,489 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[51091,51104] [2025-03-16 19:31:41,493 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54693,54706] [2025-03-16 19:31:41,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58222,58235] [2025-03-16 19:31:41,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:31:41,523 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:31:41,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41 WrapperNode [2025-03-16 19:31:41,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:31:41,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:31:41,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:31:41,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:31:41,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (1/1) ... [2025-03-16 19:31:41,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (1/1) ... [2025-03-16 19:31:41,602 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2971 [2025-03-16 19:31:41,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:31:41,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:31:41,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:31:41,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:31:41,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (1/1) ... [2025-03-16 19:31:41,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (1/1) ... [2025-03-16 19:31:41,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (1/1) ... [2025-03-16 19:31:41,652 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:31:41,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (1/1) ... [2025-03-16 19:31:41,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (1/1) ... [2025-03-16 19:31:41,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (1/1) ... [2025-03-16 19:31:41,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (1/1) ... [2025-03-16 19:31:41,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (1/1) ... [2025-03-16 19:31:41,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (1/1) ... [2025-03-16 19:31:41,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:31:41,717 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:31:41,717 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:31:41,717 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:31:41,718 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (1/1) ... [2025-03-16 19:31:41,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:31:41,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:31:41,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:31:41,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:31:41,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:31:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:31:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:31:41,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:31:41,894 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:31:41,895 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:31:43,178 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L244: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-16 19:31:43,179 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2295: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~15#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~9#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~14#1; [2025-03-16 19:31:43,179 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1371: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~5#1; [2025-03-16 19:31:43,179 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2430: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~10#1; [2025-03-16 19:31:43,179 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4016: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~21#1; [2025-03-16 19:31:43,179 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1902: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~9#1; [2025-03-16 19:31:43,179 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3488: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~15#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4418: havoc main_~node1__m1~17#1;havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~16#1;havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4484: havoc main_~node3__m3~20#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1247: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~7#1;havoc main_~node4__m4~5#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~6#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4617: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~check__tmp~3#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~2#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L854: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~3#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2045: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~13#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~12#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1781: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~11#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~10#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L989: havoc main_~check__tmp~5#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1388: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~6#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4164: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1;havoc main_~node4__m4~22#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~15#1;havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4561: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~24#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2447: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1523: havoc main_~check__tmp~9#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~8#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~18#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3373: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1;havoc main_~node4__m4~17#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~12#1;havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2979: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~15#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3904: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~17#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~14#1;havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L278: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-16 19:31:43,180 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2857: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~12#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~10#1;havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-16 19:31:43,181 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3122: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1;havoc main_~node4__m4~16#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~11#1;havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-03-16 19:31:43,181 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2596: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~9#1;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~16#1; [2025-03-16 19:31:43,182 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4645: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:31:43,182 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:31:43,182 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3659: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~16#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~13#1;havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-03-16 19:31:43,182 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4452: havoc main_~node2__m2~18#1; [2025-03-16 19:31:43,182 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L227: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:31:43,182 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4589: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:31:43,182 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2413: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~9#1; [2025-03-16 19:31:43,274 INFO L? ?]: Removed 576 outVars from TransFormulas that were not future-live. [2025-03-16 19:31:43,275 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:31:43,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:31:43,296 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:31:43,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:31:43 BoogieIcfgContainer [2025-03-16 19:31:43,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:31:43,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:31:43,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:31:43,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:31:43,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:31:40" (1/3) ... [2025-03-16 19:31:43,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f826312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:31:43, skipping insertion in model container [2025-03-16 19:31:43,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:41" (2/3) ... [2025-03-16 19:31:43,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f826312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:31:43, skipping insertion in model container [2025-03-16 19:31:43,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:31:43" (3/3) ... [2025-03-16 19:31:43,304 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-03-16 19:31:43,315 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:31:43,317 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c that has 1 procedures, 569 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-03-16 19:31:43,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:31:43,382 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;@677e63e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:31:43,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-16 19:31:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 569 states, 557 states have (on average 1.784560143626571) internal successors, (994), 568 states have internal predecessors, (994), 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-03-16 19:31:43,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:31:43,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:43,394 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] [2025-03-16 19:31:43,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:43,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash -722374102, now seen corresponding path program 1 times [2025-03-16 19:31:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:43,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100883941] [2025-03-16 19:31:43,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:43,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:43,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:31:43,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:31:43,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:43,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:43,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:43,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100883941] [2025-03-16 19:31:43,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100883941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:43,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:43,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:31:43,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352140669] [2025-03-16 19:31:43,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:43,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:31:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:43,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:31:43,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:31:43,863 INFO L87 Difference]: Start difference. First operand has 569 states, 557 states have (on average 1.784560143626571) internal successors, (994), 568 states have internal predecessors, (994), 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) Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-03-16 19:31:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:44,205 INFO L93 Difference]: Finished difference Result 712 states and 1213 transitions. [2025-03-16 19:31:44,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:31:44,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2025-03-16 19:31:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:44,216 INFO L225 Difference]: With dead ends: 712 [2025-03-16 19:31:44,216 INFO L226 Difference]: Without dead ends: 412 [2025-03-16 19:31:44,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:31:44,225 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 2026 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:44,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 462 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-16 19:31:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-03-16 19:31:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 401 states have (on average 1.2768079800498753) internal successors, (512), 411 states have internal predecessors, (512), 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-03-16 19:31:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 512 transitions. [2025-03-16 19:31:44,274 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 512 transitions. Word has length 59 [2025-03-16 19:31:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:44,275 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 512 transitions. [2025-03-16 19:31:44,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-03-16 19:31:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 512 transitions. [2025-03-16 19:31:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:31:44,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:44,279 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] [2025-03-16 19:31:44,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:31:44,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:44,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash -346856538, now seen corresponding path program 1 times [2025-03-16 19:31:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949667402] [2025-03-16 19:31:44,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:44,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:44,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:31:44,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:31:44,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:44,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:44,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:44,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949667402] [2025-03-16 19:31:44,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949667402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:44,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:44,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:31:44,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521485575] [2025-03-16 19:31:44,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:44,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:31:44,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:44,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:31:44,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:31:44,494 INFO L87 Difference]: Start difference. First operand 412 states and 512 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-03-16 19:31:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:44,717 INFO L93 Difference]: Finished difference Result 588 states and 741 transitions. [2025-03-16 19:31:44,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:31:44,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2025-03-16 19:31:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:44,719 INFO L225 Difference]: With dead ends: 588 [2025-03-16 19:31:44,719 INFO L226 Difference]: Without dead ends: 380 [2025-03-16 19:31:44,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:31:44,720 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 1352 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:44,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 269 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-16 19:31:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-03-16 19:31:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 369 states have (on average 1.2872628726287263) internal successors, (475), 379 states have internal predecessors, (475), 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-03-16 19:31:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 475 transitions. [2025-03-16 19:31:44,728 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 475 transitions. Word has length 59 [2025-03-16 19:31:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:44,728 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 475 transitions. [2025-03-16 19:31:44,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-03-16 19:31:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 475 transitions. [2025-03-16 19:31:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:31:44,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:44,729 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] [2025-03-16 19:31:44,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:31:44,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:44,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:44,730 INFO L85 PathProgramCache]: Analyzing trace with hash 93605960, now seen corresponding path program 1 times [2025-03-16 19:31:44,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:44,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753258278] [2025-03-16 19:31:44,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:44,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:44,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:31:44,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:31:44,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:44,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:44,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:44,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753258278] [2025-03-16 19:31:44,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753258278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:44,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:44,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:31:44,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121211827] [2025-03-16 19:31:44,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:44,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:31:44,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:44,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:31:44,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:31:44,850 INFO L87 Difference]: Start difference. First operand 380 states and 475 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-03-16 19:31:45,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:45,117 INFO L93 Difference]: Finished difference Result 712 states and 907 transitions. [2025-03-16 19:31:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:31:45,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2025-03-16 19:31:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:45,120 INFO L225 Difference]: With dead ends: 712 [2025-03-16 19:31:45,120 INFO L226 Difference]: Without dead ends: 508 [2025-03-16 19:31:45,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:31:45,121 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1673 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:45,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 370 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-16 19:31:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 449. [2025-03-16 19:31:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 438 states have (on average 1.3424657534246576) internal successors, (588), 448 states have internal predecessors, (588), 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-03-16 19:31:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 588 transitions. [2025-03-16 19:31:45,145 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 588 transitions. Word has length 59 [2025-03-16 19:31:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:45,145 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 588 transitions. [2025-03-16 19:31:45,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-03-16 19:31:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 588 transitions. [2025-03-16 19:31:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:31:45,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:45,146 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] [2025-03-16 19:31:45,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:31:45,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:45,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:45,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2062428868, now seen corresponding path program 1 times [2025-03-16 19:31:45,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:45,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485277924] [2025-03-16 19:31:45,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:45,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:45,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:31:45,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:31:45,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:45,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:45,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:45,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485277924] [2025-03-16 19:31:45,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485277924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:45,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:45,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:31:45,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68673447] [2025-03-16 19:31:45,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:45,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:31:45,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:45,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:31:45,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:31:45,267 INFO L87 Difference]: Start difference. First operand 449 states and 588 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-03-16 19:31:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:45,400 INFO L93 Difference]: Finished difference Result 605 states and 793 transitions. [2025-03-16 19:31:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:31:45,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2025-03-16 19:31:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:45,402 INFO L225 Difference]: With dead ends: 605 [2025-03-16 19:31:45,402 INFO L226 Difference]: Without dead ends: 356 [2025-03-16 19:31:45,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:31:45,403 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 912 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:45,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 208 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:31:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-16 19:31:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-03-16 19:31:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3478260869565217) internal successors, (465), 355 states have internal predecessors, (465), 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-03-16 19:31:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 465 transitions. [2025-03-16 19:31:45,411 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 465 transitions. Word has length 61 [2025-03-16 19:31:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:45,411 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 465 transitions. [2025-03-16 19:31:45,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-03-16 19:31:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 465 transitions. [2025-03-16 19:31:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:31:45,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:45,412 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-03-16 19:31:45,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:31:45,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:45,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:45,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1939621604, now seen corresponding path program 1 times [2025-03-16 19:31:45,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:45,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458489659] [2025-03-16 19:31:45,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:45,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:45,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:31:45,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:31:45,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:45,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:45,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:45,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458489659] [2025-03-16 19:31:45,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458489659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:45,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:45,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:31:45,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412985964] [2025-03-16 19:31:45,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:45,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:31:45,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:45,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:31:45,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:31:45,763 INFO L87 Difference]: Start difference. First operand 356 states and 465 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 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-03-16 19:31:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:46,134 INFO L93 Difference]: Finished difference Result 723 states and 947 transitions. [2025-03-16 19:31:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:31:46,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 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-03-16 19:31:46,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:46,137 INFO L225 Difference]: With dead ends: 723 [2025-03-16 19:31:46,137 INFO L226 Difference]: Without dead ends: 530 [2025-03-16 19:31:46,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:31:46,138 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 900 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:46,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 824 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-16 19:31:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 356. [2025-03-16 19:31:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.344927536231884) internal successors, (464), 355 states have internal predecessors, (464), 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-03-16 19:31:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 464 transitions. [2025-03-16 19:31:46,146 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 464 transitions. Word has length 63 [2025-03-16 19:31:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:46,147 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 464 transitions. [2025-03-16 19:31:46,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 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-03-16 19:31:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 464 transitions. [2025-03-16 19:31:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:31:46,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:46,147 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-03-16 19:31:46,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:31:46,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:46,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:46,148 INFO L85 PathProgramCache]: Analyzing trace with hash -35406214, now seen corresponding path program 1 times [2025-03-16 19:31:46,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:46,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222139192] [2025-03-16 19:31:46,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:46,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:46,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:31:46,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:31:46,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:46,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:46,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222139192] [2025-03-16 19:31:46,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222139192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:46,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:46,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:46,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745672425] [2025-03-16 19:31:46,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:46,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:46,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:46,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:46,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:46,430 INFO L87 Difference]: Start difference. First operand 356 states and 464 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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-03-16 19:31:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:46,811 INFO L93 Difference]: Finished difference Result 558 states and 751 transitions. [2025-03-16 19:31:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:31:46,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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-03-16 19:31:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:46,813 INFO L225 Difference]: With dead ends: 558 [2025-03-16 19:31:46,813 INFO L226 Difference]: Without dead ends: 414 [2025-03-16 19:31:46,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:31:46,814 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 660 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:46,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1106 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:46,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-16 19:31:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 356. [2025-03-16 19:31:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3420289855072465) internal successors, (463), 355 states have internal predecessors, (463), 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-03-16 19:31:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 463 transitions. [2025-03-16 19:31:46,824 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 463 transitions. Word has length 63 [2025-03-16 19:31:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:46,824 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 463 transitions. [2025-03-16 19:31:46,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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-03-16 19:31:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 463 transitions. [2025-03-16 19:31:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:31:46,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:46,824 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-03-16 19:31:46,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:31:46,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:46,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash 62594652, now seen corresponding path program 1 times [2025-03-16 19:31:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:46,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597323206] [2025-03-16 19:31:46,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:46,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:46,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:31:46,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:31:46,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:46,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:47,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:47,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597323206] [2025-03-16 19:31:47,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597323206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:47,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:47,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:47,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880319924] [2025-03-16 19:31:47,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:47,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:47,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:47,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:47,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:47,083 INFO L87 Difference]: Start difference. First operand 356 states and 463 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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-03-16 19:31:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:47,496 INFO L93 Difference]: Finished difference Result 698 states and 936 transitions. [2025-03-16 19:31:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:31:47,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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-03-16 19:31:47,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:47,498 INFO L225 Difference]: With dead ends: 698 [2025-03-16 19:31:47,498 INFO L226 Difference]: Without dead ends: 578 [2025-03-16 19:31:47,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:31:47,499 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 981 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:47,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1195 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-16 19:31:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 356. [2025-03-16 19:31:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3391304347826087) internal successors, (462), 355 states have internal predecessors, (462), 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-03-16 19:31:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 462 transitions. [2025-03-16 19:31:47,511 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 462 transitions. Word has length 63 [2025-03-16 19:31:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:47,511 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 462 transitions. [2025-03-16 19:31:47,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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-03-16 19:31:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 462 transitions. [2025-03-16 19:31:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:31:47,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:47,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:47,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:31:47,515 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:47,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:47,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1354162531, now seen corresponding path program 1 times [2025-03-16 19:31:47,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:47,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910406132] [2025-03-16 19:31:47,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:47,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:47,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:31:47,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:31:47,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:47,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:47,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:47,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910406132] [2025-03-16 19:31:47,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910406132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:47,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:47,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:47,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275044920] [2025-03-16 19:31:47,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:47,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:47,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:47,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:47,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:47,719 INFO L87 Difference]: Start difference. First operand 356 states and 462 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-03-16 19:31:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:48,096 INFO L93 Difference]: Finished difference Result 666 states and 886 transitions. [2025-03-16 19:31:48,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:48,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 64 [2025-03-16 19:31:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:48,099 INFO L225 Difference]: With dead ends: 666 [2025-03-16 19:31:48,099 INFO L226 Difference]: Without dead ends: 557 [2025-03-16 19:31:48,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:31:48,099 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1288 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:48,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 857 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:48,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-16 19:31:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 356. [2025-03-16 19:31:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.336231884057971) internal successors, (461), 355 states have internal predecessors, (461), 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-03-16 19:31:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 461 transitions. [2025-03-16 19:31:48,106 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 461 transitions. Word has length 64 [2025-03-16 19:31:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:48,107 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 461 transitions. [2025-03-16 19:31:48,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-03-16 19:31:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 461 transitions. [2025-03-16 19:31:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:31:48,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:48,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:48,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:31:48,108 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:48,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1496986763, now seen corresponding path program 1 times [2025-03-16 19:31:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:48,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38515432] [2025-03-16 19:31:48,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:48,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:31:48,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:31:48,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:48,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:48,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:48,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38515432] [2025-03-16 19:31:48,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38515432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:48,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:48,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:48,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943594556] [2025-03-16 19:31:48,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:48,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:48,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:48,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:48,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:48,286 INFO L87 Difference]: Start difference. First operand 356 states and 461 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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-03-16 19:31:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:48,645 INFO L93 Difference]: Finished difference Result 563 states and 729 transitions. [2025-03-16 19:31:48,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:31:48,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2025-03-16 19:31:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:48,647 INFO L225 Difference]: With dead ends: 563 [2025-03-16 19:31:48,648 INFO L226 Difference]: Without dead ends: 557 [2025-03-16 19:31:48,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:31:48,648 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 835 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:48,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 842 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-16 19:31:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 356. [2025-03-16 19:31:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3333333333333333) internal successors, (460), 355 states have internal predecessors, (460), 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-03-16 19:31:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 460 transitions. [2025-03-16 19:31:48,656 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 460 transitions. Word has length 65 [2025-03-16 19:31:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:48,656 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 460 transitions. [2025-03-16 19:31:48,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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-03-16 19:31:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 460 transitions. [2025-03-16 19:31:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:31:48,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:48,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:48,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:31:48,657 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:48,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash 716937891, now seen corresponding path program 1 times [2025-03-16 19:31:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:48,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845986972] [2025-03-16 19:31:48,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:48,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:48,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:31:48,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:31:48,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:48,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:49,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:49,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845986972] [2025-03-16 19:31:49,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845986972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:49,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:49,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:31:49,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479990665] [2025-03-16 19:31:49,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:49,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:31:49,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:49,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:31:49,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:31:49,004 INFO L87 Difference]: Start difference. First operand 356 states and 460 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 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-03-16 19:31:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:49,830 INFO L93 Difference]: Finished difference Result 1063 states and 1466 transitions. [2025-03-16 19:31:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:31:49,831 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 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 65 [2025-03-16 19:31:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:49,834 INFO L225 Difference]: With dead ends: 1063 [2025-03-16 19:31:49,834 INFO L226 Difference]: Without dead ends: 938 [2025-03-16 19:31:49,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:31:49,835 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 2506 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2506 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:49,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2506 Valid, 1178 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:31:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-03-16 19:31:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 361. [2025-03-16 19:31:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 350 states have (on average 1.3285714285714285) internal successors, (465), 360 states have internal predecessors, (465), 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-03-16 19:31:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 465 transitions. [2025-03-16 19:31:49,844 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 465 transitions. Word has length 65 [2025-03-16 19:31:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:49,844 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 465 transitions. [2025-03-16 19:31:49,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 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-03-16 19:31:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 465 transitions. [2025-03-16 19:31:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:31:49,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:49,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:49,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:31:49,845 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:49,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:49,845 INFO L85 PathProgramCache]: Analyzing trace with hash 206526981, now seen corresponding path program 1 times [2025-03-16 19:31:49,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:49,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208305779] [2025-03-16 19:31:49,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:49,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:49,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:31:49,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:31:49,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:49,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:50,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:50,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208305779] [2025-03-16 19:31:50,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208305779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:50,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:50,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011120584] [2025-03-16 19:31:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:50,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:50,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:50,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:50,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:50,023 INFO L87 Difference]: Start difference. First operand 361 states and 465 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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-03-16 19:31:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:50,432 INFO L93 Difference]: Finished difference Result 674 states and 891 transitions. [2025-03-16 19:31:50,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:50,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2025-03-16 19:31:50,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:50,435 INFO L225 Difference]: With dead ends: 674 [2025-03-16 19:31:50,435 INFO L226 Difference]: Without dead ends: 562 [2025-03-16 19:31:50,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:31:50,436 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1280 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:50,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 857 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-16 19:31:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 361. [2025-03-16 19:31:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 350 states have (on average 1.3257142857142856) internal successors, (464), 360 states have internal predecessors, (464), 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-03-16 19:31:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 464 transitions. [2025-03-16 19:31:50,443 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 464 transitions. Word has length 65 [2025-03-16 19:31:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:50,443 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 464 transitions. [2025-03-16 19:31:50,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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-03-16 19:31:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 464 transitions. [2025-03-16 19:31:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:31:50,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:50,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:50,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:31:50,445 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:50,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:50,445 INFO L85 PathProgramCache]: Analyzing trace with hash -288668587, now seen corresponding path program 1 times [2025-03-16 19:31:50,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:50,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156428202] [2025-03-16 19:31:50,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:50,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:50,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:31:50,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:31:50,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:50,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:50,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:50,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156428202] [2025-03-16 19:31:50,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156428202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:50,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:50,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:50,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645329500] [2025-03-16 19:31:50,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:50,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:50,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:50,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:50,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:50,618 INFO L87 Difference]: Start difference. First operand 361 states and 464 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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-03-16 19:31:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:50,958 INFO L93 Difference]: Finished difference Result 596 states and 793 transitions. [2025-03-16 19:31:50,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:50,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2025-03-16 19:31:50,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:50,959 INFO L225 Difference]: With dead ends: 596 [2025-03-16 19:31:50,959 INFO L226 Difference]: Without dead ends: 419 [2025-03-16 19:31:50,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:31:50,960 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 625 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:50,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 839 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-16 19:31:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 361. [2025-03-16 19:31:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 350 states have (on average 1.32) internal successors, (462), 360 states have internal predecessors, (462), 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-03-16 19:31:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 462 transitions. [2025-03-16 19:31:50,966 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 462 transitions. Word has length 65 [2025-03-16 19:31:50,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:50,966 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 462 transitions. [2025-03-16 19:31:50,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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-03-16 19:31:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 462 transitions. [2025-03-16 19:31:50,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:31:50,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:50,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:50,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:31:50,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:50,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:50,967 INFO L85 PathProgramCache]: Analyzing trace with hash 319743189, now seen corresponding path program 1 times [2025-03-16 19:31:50,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:50,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812549658] [2025-03-16 19:31:50,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:50,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:50,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:31:50,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:31:50,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:50,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:51,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:51,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812549658] [2025-03-16 19:31:51,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812549658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:51,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:51,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:51,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931723576] [2025-03-16 19:31:51,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:51,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:51,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:51,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:51,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:51,153 INFO L87 Difference]: Start difference. First operand 361 states and 462 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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-03-16 19:31:51,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:51,549 INFO L93 Difference]: Finished difference Result 597 states and 774 transitions. [2025-03-16 19:31:51,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:31:51,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2025-03-16 19:31:51,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:51,551 INFO L225 Difference]: With dead ends: 597 [2025-03-16 19:31:51,551 INFO L226 Difference]: Without dead ends: 578 [2025-03-16 19:31:51,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:31:51,552 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 961 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:51,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 1280 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-16 19:31:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 361. [2025-03-16 19:31:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 350 states have (on average 1.3142857142857143) internal successors, (460), 360 states have internal predecessors, (460), 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-03-16 19:31:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 460 transitions. [2025-03-16 19:31:51,559 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 460 transitions. Word has length 65 [2025-03-16 19:31:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:51,559 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 460 transitions. [2025-03-16 19:31:51,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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-03-16 19:31:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 460 transitions. [2025-03-16 19:31:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:31:51,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:51,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:51,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:31:51,560 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:51,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:51,561 INFO L85 PathProgramCache]: Analyzing trace with hash 834159893, now seen corresponding path program 1 times [2025-03-16 19:31:51,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:51,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531561262] [2025-03-16 19:31:51,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:51,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:31:51,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:31:51,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:51,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:51,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:51,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531561262] [2025-03-16 19:31:51,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531561262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:51,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:51,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:51,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394195862] [2025-03-16 19:31:51,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:51,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:51,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:51,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:51,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:51,727 INFO L87 Difference]: Start difference. First operand 361 states and 460 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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-03-16 19:31:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:52,126 INFO L93 Difference]: Finished difference Result 568 states and 727 transitions. [2025-03-16 19:31:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:52,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2025-03-16 19:31:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:52,128 INFO L225 Difference]: With dead ends: 568 [2025-03-16 19:31:52,128 INFO L226 Difference]: Without dead ends: 562 [2025-03-16 19:31:52,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:31:52,129 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 1102 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:52,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1026 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-16 19:31:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 361. [2025-03-16 19:31:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 350 states have (on average 1.3085714285714285) internal successors, (458), 360 states have internal predecessors, (458), 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-03-16 19:31:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 458 transitions. [2025-03-16 19:31:52,136 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 458 transitions. Word has length 65 [2025-03-16 19:31:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:52,136 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 458 transitions. [2025-03-16 19:31:52,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 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-03-16 19:31:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 458 transitions. [2025-03-16 19:31:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:31:52,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:52,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:52,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:31:52,137 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:52,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1484537834, now seen corresponding path program 1 times [2025-03-16 19:31:52,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:52,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728057242] [2025-03-16 19:31:52,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:52,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:31:52,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:31:52,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:52,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:52,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:52,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728057242] [2025-03-16 19:31:52,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728057242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:52,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:52,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:31:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266834710] [2025-03-16 19:31:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:52,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:31:52,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:52,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:31:52,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:31:52,610 INFO L87 Difference]: Start difference. First operand 361 states and 458 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 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-03-16 19:31:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:53,078 INFO L93 Difference]: Finished difference Result 788 states and 1062 transitions. [2025-03-16 19:31:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:31:53,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 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 66 [2025-03-16 19:31:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:53,081 INFO L225 Difference]: With dead ends: 788 [2025-03-16 19:31:53,081 INFO L226 Difference]: Without dead ends: 655 [2025-03-16 19:31:53,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:31:53,082 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 1359 mSDsluCounter, 2460 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:53,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 2791 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-16 19:31:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 334. [2025-03-16 19:31:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 1.3117283950617284) internal successors, (425), 333 states have internal predecessors, (425), 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-03-16 19:31:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 425 transitions. [2025-03-16 19:31:53,090 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 425 transitions. Word has length 66 [2025-03-16 19:31:53,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:53,090 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 425 transitions. [2025-03-16 19:31:53,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 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-03-16 19:31:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 425 transitions. [2025-03-16 19:31:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:31:53,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:53,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:53,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:31:53,091 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:53,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:53,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1614295622, now seen corresponding path program 1 times [2025-03-16 19:31:53,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:53,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10039382] [2025-03-16 19:31:53,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:53,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:31:53,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:31:53,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:53,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:53,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:53,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10039382] [2025-03-16 19:31:53,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10039382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:53,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:53,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:53,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731383025] [2025-03-16 19:31:53,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:53,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:53,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:53,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:53,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:53,266 INFO L87 Difference]: Start difference. First operand 334 states and 425 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 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-03-16 19:31:53,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:53,662 INFO L93 Difference]: Finished difference Result 676 states and 896 transitions. [2025-03-16 19:31:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:53,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 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 66 [2025-03-16 19:31:53,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:53,664 INFO L225 Difference]: With dead ends: 676 [2025-03-16 19:31:53,664 INFO L226 Difference]: Without dead ends: 551 [2025-03-16 19:31:53,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:31:53,665 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 853 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:53,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1466 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-16 19:31:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 329. [2025-03-16 19:31:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 319 states have (on average 1.3134796238244515) internal successors, (419), 328 states have internal predecessors, (419), 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-03-16 19:31:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 419 transitions. [2025-03-16 19:31:53,671 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 419 transitions. Word has length 66 [2025-03-16 19:31:53,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:53,671 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 419 transitions. [2025-03-16 19:31:53,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 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-03-16 19:31:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 419 transitions. [2025-03-16 19:31:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:31:53,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:53,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:53,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:31:53,672 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:53,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:53,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1541532581, now seen corresponding path program 1 times [2025-03-16 19:31:53,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:53,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762134805] [2025-03-16 19:31:53,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:53,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:53,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:31:53,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:31:53,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:53,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:53,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:53,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762134805] [2025-03-16 19:31:53,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762134805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:53,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:53,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:31:53,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20857979] [2025-03-16 19:31:53,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:53,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:31:53,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:53,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:31:53,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:31:53,976 INFO L87 Difference]: Start difference. First operand 329 states and 419 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 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-03-16 19:31:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:54,270 INFO L93 Difference]: Finished difference Result 582 states and 773 transitions. [2025-03-16 19:31:54,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:31:54,270 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 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 66 [2025-03-16 19:31:54,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:54,271 INFO L225 Difference]: With dead ends: 582 [2025-03-16 19:31:54,271 INFO L226 Difference]: Without dead ends: 433 [2025-03-16 19:31:54,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:31:54,272 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 842 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:54,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1109 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:31:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-16 19:31:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 286. [2025-03-16 19:31:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 279 states have (on average 1.3189964157706093) internal successors, (368), 285 states have internal predecessors, (368), 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-03-16 19:31:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 368 transitions. [2025-03-16 19:31:54,278 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 368 transitions. Word has length 66 [2025-03-16 19:31:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:54,278 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 368 transitions. [2025-03-16 19:31:54,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 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-03-16 19:31:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 368 transitions. [2025-03-16 19:31:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:31:54,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:54,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:54,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:31:54,279 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:54,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash 735928810, now seen corresponding path program 1 times [2025-03-16 19:31:54,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:54,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130038738] [2025-03-16 19:31:54,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:54,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:54,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:31:54,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:31:54,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:54,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:54,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:54,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130038738] [2025-03-16 19:31:54,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130038738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:54,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:54,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:31:54,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113530000] [2025-03-16 19:31:54,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:54,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:31:54,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:54,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:31:54,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:31:54,656 INFO L87 Difference]: Start difference. First operand 286 states and 368 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 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-03-16 19:31:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:55,068 INFO L93 Difference]: Finished difference Result 571 states and 774 transitions. [2025-03-16 19:31:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:55,069 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 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 66 [2025-03-16 19:31:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:55,070 INFO L225 Difference]: With dead ends: 571 [2025-03-16 19:31:55,070 INFO L226 Difference]: Without dead ends: 448 [2025-03-16 19:31:55,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:31:55,070 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 996 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:55,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1949 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-16 19:31:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 265. [2025-03-16 19:31:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 259 states have (on average 1.3166023166023166) internal successors, (341), 264 states have internal predecessors, (341), 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-03-16 19:31:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 341 transitions. [2025-03-16 19:31:55,074 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 341 transitions. Word has length 66 [2025-03-16 19:31:55,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:55,075 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 341 transitions. [2025-03-16 19:31:55,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 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-03-16 19:31:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 341 transitions. [2025-03-16 19:31:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:31:55,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:55,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:55,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:31:55,075 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:55,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1405186692, now seen corresponding path program 1 times [2025-03-16 19:31:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:55,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589423701] [2025-03-16 19:31:55,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:55,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:55,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:31:55,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:31:55,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:55,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:55,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:55,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589423701] [2025-03-16 19:31:55,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589423701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:55,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:55,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 19:31:55,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58735754] [2025-03-16 19:31:55,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:55,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:31:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:55,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:31:55,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:31:55,817 INFO L87 Difference]: Start difference. First operand 265 states and 341 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 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-03-16 19:31:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:56,915 INFO L93 Difference]: Finished difference Result 624 states and 831 transitions. [2025-03-16 19:31:56,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:31:56,916 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 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 67 [2025-03-16 19:31:56,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:56,917 INFO L225 Difference]: With dead ends: 624 [2025-03-16 19:31:56,917 INFO L226 Difference]: Without dead ends: 620 [2025-03-16 19:31:56,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:31:56,918 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 1447 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:56,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 2271 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:31:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-03-16 19:31:56,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 275. [2025-03-16 19:31:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 269 states have (on average 1.3159851301115242) internal successors, (354), 274 states have internal predecessors, (354), 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-03-16 19:31:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 354 transitions. [2025-03-16 19:31:56,924 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 354 transitions. Word has length 67 [2025-03-16 19:31:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:56,924 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 354 transitions. [2025-03-16 19:31:56,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 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-03-16 19:31:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2025-03-16 19:31:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:31:56,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:56,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:56,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:31:56,925 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:56,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:56,926 INFO L85 PathProgramCache]: Analyzing trace with hash -683268852, now seen corresponding path program 1 times [2025-03-16 19:31:56,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:56,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781997602] [2025-03-16 19:31:56,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:56,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:31:56,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:31:56,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:56,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:57,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:57,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781997602] [2025-03-16 19:31:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781997602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:57,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:31:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52166358] [2025-03-16 19:31:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:57,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:31:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:57,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:31:57,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:31:57,306 INFO L87 Difference]: Start difference. First operand 275 states and 354 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 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-03-16 19:31:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:57,897 INFO L93 Difference]: Finished difference Result 814 states and 1104 transitions. [2025-03-16 19:31:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:31:57,897 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 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 67 [2025-03-16 19:31:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:57,899 INFO L225 Difference]: With dead ends: 814 [2025-03-16 19:31:57,899 INFO L226 Difference]: Without dead ends: 702 [2025-03-16 19:31:57,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:31:57,900 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1076 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:57,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 1853 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-16 19:31:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 265. [2025-03-16 19:31:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 264 states have internal predecessors, (339), 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-03-16 19:31:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 339 transitions. [2025-03-16 19:31:57,906 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 339 transitions. Word has length 67 [2025-03-16 19:31:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:57,906 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 339 transitions. [2025-03-16 19:31:57,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 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-03-16 19:31:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 339 transitions. [2025-03-16 19:31:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:31:57,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:57,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:57,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:31:57,907 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:57,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash -371927776, now seen corresponding path program 1 times [2025-03-16 19:31:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:57,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087594625] [2025-03-16 19:31:57,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:57,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:57,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:31:57,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:31:57,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:57,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:58,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:58,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087594625] [2025-03-16 19:31:58,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087594625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:58,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:58,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:31:58,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129540469] [2025-03-16 19:31:58,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:58,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:31:58,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:58,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:31:58,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:31:58,242 INFO L87 Difference]: Start difference. First operand 265 states and 339 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 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-03-16 19:31:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:58,482 INFO L93 Difference]: Finished difference Result 265 states and 339 transitions. [2025-03-16 19:31:58,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:58,486 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 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 68 [2025-03-16 19:31:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:58,486 INFO L225 Difference]: With dead ends: 265 [2025-03-16 19:31:58,486 INFO L226 Difference]: Without dead ends: 231 [2025-03-16 19:31:58,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:31:58,487 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 404 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:58,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 996 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:31:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-16 19:31:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-03-16 19:31:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 228 states have (on average 1.3070175438596492) internal successors, (298), 230 states have internal predecessors, (298), 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-03-16 19:31:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 298 transitions. [2025-03-16 19:31:58,490 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 298 transitions. Word has length 68 [2025-03-16 19:31:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:58,490 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 298 transitions. [2025-03-16 19:31:58,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 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-03-16 19:31:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 298 transitions. [2025-03-16 19:31:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:31:58,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:58,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:58,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:31:58,491 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:58,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:58,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2116808754, now seen corresponding path program 1 times [2025-03-16 19:31:58,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:58,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26898642] [2025-03-16 19:31:58,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:58,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:58,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:31:58,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:31:58,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:58,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:58,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:58,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26898642] [2025-03-16 19:31:58,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26898642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:58,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:58,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:58,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433299852] [2025-03-16 19:31:58,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:58,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:58,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:58,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:58,616 INFO L87 Difference]: Start difference. First operand 231 states and 298 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 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-03-16 19:31:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:58,921 INFO L93 Difference]: Finished difference Result 544 states and 732 transitions. [2025-03-16 19:31:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:31:58,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-03-16 19:31:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:58,923 INFO L225 Difference]: With dead ends: 544 [2025-03-16 19:31:58,923 INFO L226 Difference]: Without dead ends: 404 [2025-03-16 19:31:58,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:31:58,925 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 553 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:58,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 759 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-16 19:31:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 231. [2025-03-16 19:31:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 230 states have internal predecessors, (296), 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-03-16 19:31:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 296 transitions. [2025-03-16 19:31:58,929 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 296 transitions. Word has length 69 [2025-03-16 19:31:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:58,929 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 296 transitions. [2025-03-16 19:31:58,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 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-03-16 19:31:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 296 transitions. [2025-03-16 19:31:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:31:58,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:58,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:58,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:31:58,930 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:58,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:58,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1925852878, now seen corresponding path program 1 times [2025-03-16 19:31:58,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:58,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521566310] [2025-03-16 19:31:58,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:58,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:58,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:31:58,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:31:58,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:58,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:59,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:59,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521566310] [2025-03-16 19:31:59,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521566310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:59,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:59,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:59,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171795322] [2025-03-16 19:31:59,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:59,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:59,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:59,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:59,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:59,069 INFO L87 Difference]: Start difference. First operand 231 states and 296 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 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-03-16 19:31:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:59,352 INFO L93 Difference]: Finished difference Result 385 states and 506 transitions. [2025-03-16 19:31:59,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:59,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-03-16 19:31:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:59,353 INFO L225 Difference]: With dead ends: 385 [2025-03-16 19:31:59,353 INFO L226 Difference]: Without dead ends: 377 [2025-03-16 19:31:59,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:31:59,354 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 546 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:59,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 703 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-16 19:31:59,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 231. [2025-03-16 19:31:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 228 states have (on average 1.293859649122807) internal successors, (295), 230 states have internal predecessors, (295), 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-03-16 19:31:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 295 transitions. [2025-03-16 19:31:59,357 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 295 transitions. Word has length 69 [2025-03-16 19:31:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:59,357 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 295 transitions. [2025-03-16 19:31:59,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 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-03-16 19:31:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 295 transitions. [2025-03-16 19:31:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:31:59,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:59,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:59,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:31:59,358 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:59,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:59,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1601065070, now seen corresponding path program 1 times [2025-03-16 19:31:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:59,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743513560] [2025-03-16 19:31:59,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:59,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:31:59,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:31:59,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:59,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:00,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:00,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743513560] [2025-03-16 19:32:00,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743513560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:00,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:00,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-16 19:32:00,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492691575] [2025-03-16 19:32:00,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:00,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:32:00,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:00,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:32:00,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:32:00,021 INFO L87 Difference]: Start difference. First operand 231 states and 295 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 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-03-16 19:32:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:00,798 INFO L93 Difference]: Finished difference Result 383 states and 502 transitions. [2025-03-16 19:32:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 19:32:00,798 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 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 71 [2025-03-16 19:32:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:00,799 INFO L225 Difference]: With dead ends: 383 [2025-03-16 19:32:00,799 INFO L226 Difference]: Without dead ends: 377 [2025-03-16 19:32:00,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=262, Invalid=1298, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 19:32:00,800 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 557 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:00,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 2036 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:32:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-16 19:32:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 244. [2025-03-16 19:32:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 241 states have (on average 1.2904564315352698) internal successors, (311), 243 states have internal predecessors, (311), 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-03-16 19:32:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 311 transitions. [2025-03-16 19:32:00,803 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 311 transitions. Word has length 71 [2025-03-16 19:32:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:00,803 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 311 transitions. [2025-03-16 19:32:00,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 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-03-16 19:32:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 311 transitions. [2025-03-16 19:32:00,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:32:00,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:00,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:00,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:32:00,804 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:00,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:00,805 INFO L85 PathProgramCache]: Analyzing trace with hash -967368738, now seen corresponding path program 1 times [2025-03-16 19:32:00,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:00,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626284996] [2025-03-16 19:32:00,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:00,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:00,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:32:00,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:32:00,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:00,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:01,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:01,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626284996] [2025-03-16 19:32:01,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626284996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:01,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:01,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-16 19:32:01,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866955789] [2025-03-16 19:32:01,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:01,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:32:01,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:01,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:32:01,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:32:01,591 INFO L87 Difference]: Start difference. First operand 244 states and 311 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 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-03-16 19:32:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:02,450 INFO L93 Difference]: Finished difference Result 258 states and 326 transitions. [2025-03-16 19:32:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 19:32:02,451 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 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 71 [2025-03-16 19:32:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:02,451 INFO L225 Difference]: With dead ends: 258 [2025-03-16 19:32:02,451 INFO L226 Difference]: Without dead ends: 249 [2025-03-16 19:32:02,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 19:32:02,452 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 602 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:02,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1751 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:32:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-16 19:32:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2025-03-16 19:32:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 245 states have (on average 1.2897959183673469) internal successors, (316), 247 states have internal predecessors, (316), 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-03-16 19:32:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2025-03-16 19:32:02,456 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 71 [2025-03-16 19:32:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:02,456 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2025-03-16 19:32:02,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 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-03-16 19:32:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2025-03-16 19:32:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:32:02,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:02,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:02,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:32:02,457 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:02,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash -745527790, now seen corresponding path program 1 times [2025-03-16 19:32:02,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:02,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323002709] [2025-03-16 19:32:02,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:02,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:32:02,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:32:02,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:02,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:02,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:02,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323002709] [2025-03-16 19:32:02,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323002709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:02,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:02,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:32:02,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470302431] [2025-03-16 19:32:02,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:02,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:32:02,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:02,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:32:02,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:32:02,762 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 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-03-16 19:32:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:03,100 INFO L93 Difference]: Finished difference Result 384 states and 510 transitions. [2025-03-16 19:32:03,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:32:03,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 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 72 [2025-03-16 19:32:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:03,101 INFO L225 Difference]: With dead ends: 384 [2025-03-16 19:32:03,101 INFO L226 Difference]: Without dead ends: 378 [2025-03-16 19:32:03,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:32:03,102 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 784 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:03,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1022 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-16 19:32:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 235. [2025-03-16 19:32:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 233 states have (on average 1.2875536480686696) internal successors, (300), 234 states have internal predecessors, (300), 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-03-16 19:32:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 300 transitions. [2025-03-16 19:32:03,106 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 300 transitions. Word has length 72 [2025-03-16 19:32:03,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:03,106 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 300 transitions. [2025-03-16 19:32:03,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 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-03-16 19:32:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 300 transitions. [2025-03-16 19:32:03,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:32:03,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:03,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:03,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:32:03,107 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:03,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash 981005698, now seen corresponding path program 1 times [2025-03-16 19:32:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:03,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513630963] [2025-03-16 19:32:03,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:03,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:32:03,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:32:03,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:03,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513630963] [2025-03-16 19:32:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513630963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:03,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:03,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 19:32:03,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503366592] [2025-03-16 19:32:03,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:03,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:32:03,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:03,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:32:03,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:32:03,653 INFO L87 Difference]: Start difference. First operand 235 states and 300 transitions. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 states have internal predecessors, (72), 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-03-16 19:32:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:04,510 INFO L93 Difference]: Finished difference Result 536 states and 714 transitions. [2025-03-16 19:32:04,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 19:32:04,511 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 states have internal predecessors, (72), 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 72 [2025-03-16 19:32:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:04,512 INFO L225 Difference]: With dead ends: 536 [2025-03-16 19:32:04,512 INFO L226 Difference]: Without dead ends: 527 [2025-03-16 19:32:04,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 19:32:04,513 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 971 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:04,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 2344 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:32:04,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-16 19:32:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 225. [2025-03-16 19:32:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 224 states have internal predecessors, (287), 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-03-16 19:32:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 287 transitions. [2025-03-16 19:32:04,519 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 287 transitions. Word has length 72 [2025-03-16 19:32:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:04,519 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 287 transitions. [2025-03-16 19:32:04,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 states have internal predecessors, (72), 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-03-16 19:32:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 287 transitions. [2025-03-16 19:32:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:32:04,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:04,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:04,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:32:04,520 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:04,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:04,521 INFO L85 PathProgramCache]: Analyzing trace with hash -965049898, now seen corresponding path program 1 times [2025-03-16 19:32:04,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:04,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765589214] [2025-03-16 19:32:04,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:04,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:04,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:32:04,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:32:04,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:04,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:04,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765589214] [2025-03-16 19:32:04,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765589214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:04,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:04,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 19:32:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841091793] [2025-03-16 19:32:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:04,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:32:04,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:04,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:32:04,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:32:04,989 INFO L87 Difference]: Start difference. First operand 225 states and 287 transitions. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 states have internal predecessors, (72), 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-03-16 19:32:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:05,892 INFO L93 Difference]: Finished difference Result 758 states and 1040 transitions. [2025-03-16 19:32:05,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 19:32:05,892 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 states have internal predecessors, (72), 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 72 [2025-03-16 19:32:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:05,894 INFO L225 Difference]: With dead ends: 758 [2025-03-16 19:32:05,894 INFO L226 Difference]: Without dead ends: 742 [2025-03-16 19:32:05,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 19:32:05,894 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 1196 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:05,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 2873 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:32:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-16 19:32:05,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 212. [2025-03-16 19:32:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.2938388625592416) internal successors, (273), 211 states have internal predecessors, (273), 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-03-16 19:32:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 273 transitions. [2025-03-16 19:32:05,898 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 273 transitions. Word has length 72 [2025-03-16 19:32:05,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:05,898 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 273 transitions. [2025-03-16 19:32:05,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 states have internal predecessors, (72), 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-03-16 19:32:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 273 transitions. [2025-03-16 19:32:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:32:05,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:05,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:05,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:32:05,899 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:05,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:05,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1737048912, now seen corresponding path program 1 times [2025-03-16 19:32:05,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:05,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825903723] [2025-03-16 19:32:05,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:05,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:05,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:32:05,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 19:32:05,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:05,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:05,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825903723] [2025-03-16 19:32:05,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825903723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:05,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:05,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:05,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008658079] [2025-03-16 19:32:05,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:05,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:05,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:05,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:05,962 INFO L87 Difference]: Start difference. First operand 212 states and 273 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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-03-16 19:32:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:06,036 INFO L93 Difference]: Finished difference Result 1060 states and 1537 transitions. [2025-03-16 19:32:06,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:32:06,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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 95 [2025-03-16 19:32:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:06,039 INFO L225 Difference]: With dead ends: 1060 [2025-03-16 19:32:06,039 INFO L226 Difference]: Without dead ends: 954 [2025-03-16 19:32:06,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:32:06,044 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 777 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:06,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1344 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-03-16 19:32:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 316. [2025-03-16 19:32:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.3523809523809525) internal successors, (426), 315 states have internal predecessors, (426), 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-03-16 19:32:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 426 transitions. [2025-03-16 19:32:06,054 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 426 transitions. Word has length 95 [2025-03-16 19:32:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:06,054 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 426 transitions. [2025-03-16 19:32:06,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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-03-16 19:32:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 426 transitions. [2025-03-16 19:32:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:32:06,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:06,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:06,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:32:06,055 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:06,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash 454666092, now seen corresponding path program 1 times [2025-03-16 19:32:06,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:06,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046045269] [2025-03-16 19:32:06,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:06,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:32:06,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:32:06,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:06,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:06,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:06,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046045269] [2025-03-16 19:32:06,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046045269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:06,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:06,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:06,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077726221] [2025-03-16 19:32:06,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:06,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:06,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:06,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:06,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:06,130 INFO L87 Difference]: Start difference. First operand 316 states and 426 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-03-16 19:32:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:06,183 INFO L93 Difference]: Finished difference Result 1262 states and 1824 transitions. [2025-03-16 19:32:06,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:06,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 97 [2025-03-16 19:32:06,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:06,185 INFO L225 Difference]: With dead ends: 1262 [2025-03-16 19:32:06,185 INFO L226 Difference]: Without dead ends: 1052 [2025-03-16 19:32:06,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:06,186 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 579 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:06,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 834 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-03-16 19:32:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 524. [2025-03-16 19:32:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.4034416826003824) internal successors, (734), 523 states have internal predecessors, (734), 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-03-16 19:32:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 734 transitions. [2025-03-16 19:32:06,193 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 734 transitions. Word has length 97 [2025-03-16 19:32:06,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:06,193 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 734 transitions. [2025-03-16 19:32:06,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-03-16 19:32:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 734 transitions. [2025-03-16 19:32:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:32:06,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:06,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:06,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:32:06,194 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:06,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:06,195 INFO L85 PathProgramCache]: Analyzing trace with hash -135907604, now seen corresponding path program 1 times [2025-03-16 19:32:06,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:06,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234738384] [2025-03-16 19:32:06,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:06,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:06,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:32:06,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:32:06,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:06,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:06,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:06,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234738384] [2025-03-16 19:32:06,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234738384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:06,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:06,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:06,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741353230] [2025-03-16 19:32:06,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:06,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:06,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:06,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:06,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:06,274 INFO L87 Difference]: Start difference. First operand 524 states and 734 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-03-16 19:32:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:06,340 INFO L93 Difference]: Finished difference Result 1470 states and 2132 transitions. [2025-03-16 19:32:06,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:06,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 97 [2025-03-16 19:32:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:06,343 INFO L225 Difference]: With dead ends: 1470 [2025-03-16 19:32:06,343 INFO L226 Difference]: Without dead ends: 1260 [2025-03-16 19:32:06,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:06,344 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 578 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:06,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 805 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2025-03-16 19:32:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 836. [2025-03-16 19:32:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 1.4311377245508983) internal successors, (1195), 835 states have internal predecessors, (1195), 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-03-16 19:32:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1195 transitions. [2025-03-16 19:32:06,351 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1195 transitions. Word has length 97 [2025-03-16 19:32:06,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:06,352 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1195 transitions. [2025-03-16 19:32:06,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-03-16 19:32:06,352 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1195 transitions. [2025-03-16 19:32:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:32:06,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:06,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:06,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:32:06,353 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:06,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1071646316, now seen corresponding path program 1 times [2025-03-16 19:32:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:06,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681581440] [2025-03-16 19:32:06,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:06,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:06,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:32:06,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:32:06,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:06,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:06,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:06,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681581440] [2025-03-16 19:32:06,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681581440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:06,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:06,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942907631] [2025-03-16 19:32:06,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:06,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:06,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:06,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:06,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:06,432 INFO L87 Difference]: Start difference. First operand 836 states and 1195 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-03-16 19:32:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:06,502 INFO L93 Difference]: Finished difference Result 1678 states and 2440 transitions. [2025-03-16 19:32:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:06,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 97 [2025-03-16 19:32:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:06,505 INFO L225 Difference]: With dead ends: 1678 [2025-03-16 19:32:06,505 INFO L226 Difference]: Without dead ends: 1468 [2025-03-16 19:32:06,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:06,506 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 618 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:06,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 775 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2025-03-16 19:32:06,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1044. [2025-03-16 19:32:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 1.4410354745925216) internal successors, (1503), 1043 states have internal predecessors, (1503), 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-03-16 19:32:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1503 transitions. [2025-03-16 19:32:06,520 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1503 transitions. Word has length 97 [2025-03-16 19:32:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:06,521 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1503 transitions. [2025-03-16 19:32:06,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-03-16 19:32:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1503 transitions. [2025-03-16 19:32:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:32:06,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:06,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:06,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:32:06,523 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:06,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:06,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1067541012, now seen corresponding path program 1 times [2025-03-16 19:32:06,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:06,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049462641] [2025-03-16 19:32:06,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:06,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:06,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:32:06,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:32:06,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:06,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:06,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:06,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049462641] [2025-03-16 19:32:06,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049462641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:06,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:06,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:06,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274715440] [2025-03-16 19:32:06,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:06,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:06,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:06,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:06,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:06,604 INFO L87 Difference]: Start difference. First operand 1044 states and 1503 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-03-16 19:32:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:06,672 INFO L93 Difference]: Finished difference Result 1886 states and 2748 transitions. [2025-03-16 19:32:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:06,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 97 [2025-03-16 19:32:06,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:06,676 INFO L225 Difference]: With dead ends: 1886 [2025-03-16 19:32:06,676 INFO L226 Difference]: Without dead ends: 1676 [2025-03-16 19:32:06,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:06,677 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 597 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:06,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 808 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2025-03-16 19:32:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1252. [2025-03-16 19:32:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.4476418864908074) internal successors, (1811), 1251 states have internal predecessors, (1811), 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-03-16 19:32:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1811 transitions. [2025-03-16 19:32:06,691 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1811 transitions. Word has length 97 [2025-03-16 19:32:06,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:06,691 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1811 transitions. [2025-03-16 19:32:06,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-03-16 19:32:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1811 transitions. [2025-03-16 19:32:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:32:06,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:06,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:06,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:32:06,692 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:06,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1482424712, now seen corresponding path program 1 times [2025-03-16 19:32:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:06,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078755205] [2025-03-16 19:32:06,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:06,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:06,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:32:06,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:32:06,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:06,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:06,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078755205] [2025-03-16 19:32:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078755205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:06,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197207797] [2025-03-16 19:32:06,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:06,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:06,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:06,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:06,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:06,727 INFO L87 Difference]: Start difference. First operand 1252 states and 1811 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-03-16 19:32:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:06,750 INFO L93 Difference]: Finished difference Result 3402 states and 4953 transitions. [2025-03-16 19:32:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:06,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 97 [2025-03-16 19:32:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:06,756 INFO L225 Difference]: With dead ends: 3402 [2025-03-16 19:32:06,756 INFO L226 Difference]: Without dead ends: 2256 [2025-03-16 19:32:06,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:06,758 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 67 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 373 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-03-16 19:32:06,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 373 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:06,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2025-03-16 19:32:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2254. [2025-03-16 19:32:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2253 states have (on average 1.4256546826453618) internal successors, (3212), 2253 states have internal predecessors, (3212), 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-03-16 19:32:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3212 transitions. [2025-03-16 19:32:06,778 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3212 transitions. Word has length 97 [2025-03-16 19:32:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:06,779 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 3212 transitions. [2025-03-16 19:32:06,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-03-16 19:32:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3212 transitions. [2025-03-16 19:32:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:32:06,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:06,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:06,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:32:06,780 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:06,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:06,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1517518510, now seen corresponding path program 1 times [2025-03-16 19:32:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860388589] [2025-03-16 19:32:06,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:06,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:06,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:32:06,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:32:06,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:06,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:06,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:06,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860388589] [2025-03-16 19:32:06,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860388589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:06,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:06,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:06,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26601031] [2025-03-16 19:32:06,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:06,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:06,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:06,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:06,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:06,894 INFO L87 Difference]: Start difference. First operand 2254 states and 3212 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-03-16 19:32:07,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:07,068 INFO L93 Difference]: Finished difference Result 4404 states and 6310 transitions. [2025-03-16 19:32:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:07,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 97 [2025-03-16 19:32:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:07,073 INFO L225 Difference]: With dead ends: 4404 [2025-03-16 19:32:07,073 INFO L226 Difference]: Without dead ends: 2256 [2025-03-16 19:32:07,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:32:07,075 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 75 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:07,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 454 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2025-03-16 19:32:07,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2254. [2025-03-16 19:32:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2253 states have (on average 1.4203284509542833) internal successors, (3200), 2253 states have internal predecessors, (3200), 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-03-16 19:32:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3200 transitions. [2025-03-16 19:32:07,092 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3200 transitions. Word has length 97 [2025-03-16 19:32:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:07,092 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 3200 transitions. [2025-03-16 19:32:07,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-03-16 19:32:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3200 transitions. [2025-03-16 19:32:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:32:07,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:07,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:07,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:32:07,093 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:07,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1177041065, now seen corresponding path program 1 times [2025-03-16 19:32:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:07,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545752844] [2025-03-16 19:32:07,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:07,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:32:07,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:32:07,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:07,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:07,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:07,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545752844] [2025-03-16 19:32:07,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545752844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:07,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:07,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:07,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936357855] [2025-03-16 19:32:07,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:07,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:07,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:07,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:07,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:07,171 INFO L87 Difference]: Start difference. First operand 2254 states and 3200 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-03-16 19:32:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:07,198 INFO L93 Difference]: Finished difference Result 5714 states and 8136 transitions. [2025-03-16 19:32:07,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:07,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2025-03-16 19:32:07,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:07,207 INFO L225 Difference]: With dead ends: 5714 [2025-03-16 19:32:07,208 INFO L226 Difference]: Without dead ends: 3566 [2025-03-16 19:32:07,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:07,210 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 78 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:07,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 344 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2025-03-16 19:32:07,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 3388. [2025-03-16 19:32:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3388 states, 3387 states have (on average 1.4065544729849424) internal successors, (4764), 3387 states have internal predecessors, (4764), 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-03-16 19:32:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4764 transitions. [2025-03-16 19:32:07,253 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4764 transitions. Word has length 98 [2025-03-16 19:32:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:07,253 INFO L471 AbstractCegarLoop]: Abstraction has 3388 states and 4764 transitions. [2025-03-16 19:32:07,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-03-16 19:32:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4764 transitions. [2025-03-16 19:32:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:32:07,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:07,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:07,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:32:07,254 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:07,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2003395062, now seen corresponding path program 1 times [2025-03-16 19:32:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:07,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530152902] [2025-03-16 19:32:07,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:07,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:32:07,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:32:07,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:07,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:07,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530152902] [2025-03-16 19:32:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530152902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:07,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:07,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:07,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636998786] [2025-03-16 19:32:07,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:07,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:07,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:07,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:07,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:07,290 INFO L87 Difference]: Start difference. First operand 3388 states and 4764 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-03-16 19:32:07,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:07,319 INFO L93 Difference]: Finished difference Result 6776 states and 9561 transitions. [2025-03-16 19:32:07,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:07,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2025-03-16 19:32:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:07,328 INFO L225 Difference]: With dead ends: 6776 [2025-03-16 19:32:07,328 INFO L226 Difference]: Without dead ends: 3494 [2025-03-16 19:32:07,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:07,333 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 89 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:07,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 261 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2025-03-16 19:32:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3492. [2025-03-16 19:32:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3492 states, 3491 states have (on average 1.3935835004296764) internal successors, (4865), 3491 states have internal predecessors, (4865), 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-03-16 19:32:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 3492 states and 4865 transitions. [2025-03-16 19:32:07,364 INFO L78 Accepts]: Start accepts. Automaton has 3492 states and 4865 transitions. Word has length 99 [2025-03-16 19:32:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:07,364 INFO L471 AbstractCegarLoop]: Abstraction has 3492 states and 4865 transitions. [2025-03-16 19:32:07,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-03-16 19:32:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3492 states and 4865 transitions. [2025-03-16 19:32:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:32:07,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:07,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:07,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:32:07,365 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:07,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:07,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1033698012, now seen corresponding path program 1 times [2025-03-16 19:32:07,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:07,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317826526] [2025-03-16 19:32:07,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:07,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:07,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:32:07,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:32:07,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:07,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:07,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:07,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317826526] [2025-03-16 19:32:07,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317826526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:07,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:07,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:07,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285353452] [2025-03-16 19:32:07,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:07,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:07,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:07,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:07,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:07,445 INFO L87 Difference]: Start difference. First operand 3492 states and 4865 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-03-16 19:32:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:07,465 INFO L93 Difference]: Finished difference Result 9992 states and 13889 transitions. [2025-03-16 19:32:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:07,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2025-03-16 19:32:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:07,475 INFO L225 Difference]: With dead ends: 9992 [2025-03-16 19:32:07,475 INFO L226 Difference]: Without dead ends: 6606 [2025-03-16 19:32:07,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:07,479 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 71 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:07,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 341 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6606 states. [2025-03-16 19:32:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6606 to 6332. [2025-03-16 19:32:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6332 states, 6331 states have (on average 1.378929079134418) internal successors, (8730), 6331 states have internal predecessors, (8730), 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-03-16 19:32:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6332 states to 6332 states and 8730 transitions. [2025-03-16 19:32:07,530 INFO L78 Accepts]: Start accepts. Automaton has 6332 states and 8730 transitions. Word has length 99 [2025-03-16 19:32:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:07,530 INFO L471 AbstractCegarLoop]: Abstraction has 6332 states and 8730 transitions. [2025-03-16 19:32:07,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-03-16 19:32:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 6332 states and 8730 transitions. [2025-03-16 19:32:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:32:07,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:07,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:07,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:32:07,531 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:07,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:07,531 INFO L85 PathProgramCache]: Analyzing trace with hash 119837533, now seen corresponding path program 1 times [2025-03-16 19:32:07,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:07,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725468489] [2025-03-16 19:32:07,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:07,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:07,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:32:07,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:32:07,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:07,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:07,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:07,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725468489] [2025-03-16 19:32:07,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725468489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:07,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:07,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:07,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513171067] [2025-03-16 19:32:07,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:07,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:07,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:07,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:07,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:07,602 INFO L87 Difference]: Start difference. First operand 6332 states and 8730 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-03-16 19:32:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:07,629 INFO L93 Difference]: Finished difference Result 18240 states and 25008 transitions. [2025-03-16 19:32:07,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:07,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 100 [2025-03-16 19:32:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:07,652 INFO L225 Difference]: With dead ends: 18240 [2025-03-16 19:32:07,653 INFO L226 Difference]: Without dead ends: 12014 [2025-03-16 19:32:07,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:07,659 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 64 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:07,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 341 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12014 states. [2025-03-16 19:32:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12014 to 11468. [2025-03-16 19:32:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11468 states, 11467 states have (on average 1.358332606610273) internal successors, (15576), 11467 states have internal predecessors, (15576), 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-03-16 19:32:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11468 states to 11468 states and 15576 transitions. [2025-03-16 19:32:07,808 INFO L78 Accepts]: Start accepts. Automaton has 11468 states and 15576 transitions. Word has length 100 [2025-03-16 19:32:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:07,808 INFO L471 AbstractCegarLoop]: Abstraction has 11468 states and 15576 transitions. [2025-03-16 19:32:07,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-03-16 19:32:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 11468 states and 15576 transitions. [2025-03-16 19:32:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:32:07,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:07,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:07,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:32:07,810 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:07,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash -352354096, now seen corresponding path program 1 times [2025-03-16 19:32:07,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:07,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23580833] [2025-03-16 19:32:07,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:07,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:07,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:32:07,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:32:07,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:07,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:07,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23580833] [2025-03-16 19:32:07,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23580833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:07,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:07,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:07,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669497596] [2025-03-16 19:32:07,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:07,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:07,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:07,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:07,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:07,949 INFO L87 Difference]: Start difference. First operand 11468 states and 15576 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-03-16 19:32:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:08,003 INFO L93 Difference]: Finished difference Result 33104 states and 44594 transitions. [2025-03-16 19:32:08,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:08,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-03-16 19:32:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:08,031 INFO L225 Difference]: With dead ends: 33104 [2025-03-16 19:32:08,031 INFO L226 Difference]: Without dead ends: 21742 [2025-03-16 19:32:08,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:08,044 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 54 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:08,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 341 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21742 states. [2025-03-16 19:32:08,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21742 to 20652. [2025-03-16 19:32:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20652 states, 20651 states have (on average 1.331654641421723) internal successors, (27500), 20651 states have internal predecessors, (27500), 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-03-16 19:32:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20652 states to 20652 states and 27500 transitions. [2025-03-16 19:32:08,399 INFO L78 Accepts]: Start accepts. Automaton has 20652 states and 27500 transitions. Word has length 101 [2025-03-16 19:32:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:08,399 INFO L471 AbstractCegarLoop]: Abstraction has 20652 states and 27500 transitions. [2025-03-16 19:32:08,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-03-16 19:32:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 20652 states and 27500 transitions. [2025-03-16 19:32:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:32:08,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:08,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:08,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:32:08,400 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:08,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1381454506, now seen corresponding path program 1 times [2025-03-16 19:32:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:08,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314370968] [2025-03-16 19:32:08,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:08,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:08,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:32:08,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:32:08,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:08,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:08,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:08,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314370968] [2025-03-16 19:32:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314370968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:08,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:08,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694028476] [2025-03-16 19:32:08,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:08,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:08,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:08,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:08,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:08,668 INFO L87 Difference]: Start difference. First operand 20652 states and 27500 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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-03-16 19:32:08,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:08,735 INFO L93 Difference]: Finished difference Result 21134 states and 28141 transitions. [2025-03-16 19:32:08,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:08,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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 102 [2025-03-16 19:32:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:08,762 INFO L225 Difference]: With dead ends: 21134 [2025-03-16 19:32:08,762 INFO L226 Difference]: Without dead ends: 21132 [2025-03-16 19:32:08,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:08,769 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:08,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 773 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:08,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21132 states. [2025-03-16 19:32:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21132 to 21132. [2025-03-16 19:32:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21132 states, 21131 states have (on average 1.3150347830202074) internal successors, (27788), 21131 states have internal predecessors, (27788), 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-03-16 19:32:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21132 states to 21132 states and 27788 transitions. [2025-03-16 19:32:09,024 INFO L78 Accepts]: Start accepts. Automaton has 21132 states and 27788 transitions. Word has length 102 [2025-03-16 19:32:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:09,024 INFO L471 AbstractCegarLoop]: Abstraction has 21132 states and 27788 transitions. [2025-03-16 19:32:09,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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-03-16 19:32:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 21132 states and 27788 transitions. [2025-03-16 19:32:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 19:32:09,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:09,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:09,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:32:09,028 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:09,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:09,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1109195304, now seen corresponding path program 1 times [2025-03-16 19:32:09,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:09,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694032343] [2025-03-16 19:32:09,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:09,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 19:32:09,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 19:32:09,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:09,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694032343] [2025-03-16 19:32:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694032343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:32:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050495007] [2025-03-16 19:32:09,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:09,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:32:09,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:32:09,436 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:32:09,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:32:09,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 19:32:09,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 19:32:09,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:09,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:09,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:32:09,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:32:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:10,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:32:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:11,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050495007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:32:11,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:32:11,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-03-16 19:32:11,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438565384] [2025-03-16 19:32:11,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:32:11,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 19:32:11,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:11,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 19:32:11,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:32:11,476 INFO L87 Difference]: Start difference. First operand 21132 states and 27788 transitions. Second operand has 28 states, 28 states have (on average 11.0) internal successors, (308), 27 states have internal predecessors, (308), 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-03-16 19:32:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:14,958 INFO L93 Difference]: Finished difference Result 198661 states and 261004 transitions. [2025-03-16 19:32:14,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2025-03-16 19:32:14,959 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 11.0) internal successors, (308), 27 states have internal predecessors, (308), 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 129 [2025-03-16 19:32:14,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:15,168 INFO L225 Difference]: With dead ends: 198661 [2025-03-16 19:32:15,168 INFO L226 Difference]: Without dead ends: 177635 [2025-03-16 19:32:15,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6932 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2997, Invalid=17883, Unknown=0, NotChecked=0, Total=20880 [2025-03-16 19:32:15,228 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 3079 mSDsluCounter, 2652 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3079 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:15,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3079 Valid, 2826 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:32:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177635 states. [2025-03-16 19:32:16,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177635 to 77934. [2025-03-16 19:32:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77934 states, 77933 states have (on average 1.3032476614527864) internal successors, (101566), 77933 states have internal predecessors, (101566), 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-03-16 19:32:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77934 states to 77934 states and 101566 transitions. [2025-03-16 19:32:16,587 INFO L78 Accepts]: Start accepts. Automaton has 77934 states and 101566 transitions. Word has length 129 [2025-03-16 19:32:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:16,588 INFO L471 AbstractCegarLoop]: Abstraction has 77934 states and 101566 transitions. [2025-03-16 19:32:16,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.0) internal successors, (308), 27 states have internal predecessors, (308), 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-03-16 19:32:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 77934 states and 101566 transitions. [2025-03-16 19:32:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 19:32:16,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:16,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:16,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:32:16,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:32:16,796 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:16,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1902655876, now seen corresponding path program 1 times [2025-03-16 19:32:16,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:16,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202601578] [2025-03-16 19:32:16,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:16,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:16,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 19:32:16,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 19:32:16,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:16,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:16,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:16,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202601578] [2025-03-16 19:32:16,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202601578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:32:16,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450229459] [2025-03-16 19:32:16,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:16,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:32:16,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:32:16,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:32:16,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:32:17,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 19:32:17,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 19:32:17,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:17,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:17,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 19:32:17,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:32:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:17,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:32:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450229459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:32:18,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:32:18,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 23 [2025-03-16 19:32:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862239323] [2025-03-16 19:32:18,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:32:18,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:32:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:18,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:32:18,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:32:18,426 INFO L87 Difference]: Start difference. First operand 77934 states and 101566 transitions. Second operand has 23 states, 23 states have (on average 14.347826086956522) internal successors, (330), 23 states have internal predecessors, (330), 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-03-16 19:32:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:20,371 INFO L93 Difference]: Finished difference Result 226038 states and 295024 transitions. [2025-03-16 19:32:20,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-16 19:32:20,371 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 14.347826086956522) internal successors, (330), 23 states have internal predecessors, (330), 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 130 [2025-03-16 19:32:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:20,567 INFO L225 Difference]: With dead ends: 226038 [2025-03-16 19:32:20,568 INFO L226 Difference]: Without dead ends: 205012 [2025-03-16 19:32:20,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=973, Invalid=3583, Unknown=0, NotChecked=0, Total=4556 [2025-03-16 19:32:20,599 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1456 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:20,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 1660 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:32:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205012 states. [2025-03-16 19:32:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205012 to 123898. [2025-03-16 19:32:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123898 states, 123897 states have (on average 1.3018071462585858) internal successors, (161290), 123897 states have internal predecessors, (161290), 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-03-16 19:32:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123898 states to 123898 states and 161290 transitions. [2025-03-16 19:32:22,011 INFO L78 Accepts]: Start accepts. Automaton has 123898 states and 161290 transitions. Word has length 130 [2025-03-16 19:32:22,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:22,012 INFO L471 AbstractCegarLoop]: Abstraction has 123898 states and 161290 transitions. [2025-03-16 19:32:22,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.347826086956522) internal successors, (330), 23 states have internal predecessors, (330), 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-03-16 19:32:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 123898 states and 161290 transitions. [2025-03-16 19:32:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 19:32:22,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:22,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:22,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:32:22,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-03-16 19:32:22,223 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:22,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash -623512505, now seen corresponding path program 1 times [2025-03-16 19:32:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:22,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8258818] [2025-03-16 19:32:22,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:22,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 19:32:22,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 19:32:22,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:22,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:22,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:22,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8258818] [2025-03-16 19:32:22,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8258818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:32:22,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122468329] [2025-03-16 19:32:22,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:22,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:32:22,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:32:22,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:32:22,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:32:22,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 19:32:23,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 19:32:23,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:23,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:23,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 19:32:23,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:32:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:23,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:32:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:23,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122468329] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:32:23,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:32:23,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 31 [2025-03-16 19:32:23,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771380234] [2025-03-16 19:32:23,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:32:23,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 19:32:23,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:23,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 19:32:23,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2025-03-16 19:32:23,989 INFO L87 Difference]: Start difference. First operand 123898 states and 161290 transitions. Second operand has 31 states, 31 states have (on average 11.580645161290322) internal successors, (359), 31 states have internal predecessors, (359), 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)