./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1 --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 8ff37a6bc6dd9a1cef87b79c0817272bb118995e5e060e5cd0eb428df45ac24f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 05:58:07,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 05:58:07,293 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 05:58:07,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 05:58:07,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 05:58:07,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 05:58:07,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 05:58:07,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 05:58:07,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 05:58:07,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 05:58:07,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 05:58:07,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 05:58:07,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 05:58:07,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 05:58:07,323 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 05:58:07,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 05:58:07,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 05:58:07,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 05:58:07,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 05:58:07,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 05:58:07,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 05:58:07,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 05:58:07,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 05:58:07,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 05:58:07,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 05:58:07,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 05:58:07,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 05:58:07,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 05:58:07,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 05:58:07,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 05:58:07,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 05:58:07,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 05:58:07,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 05:58:07,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 05:58:07,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 05:58:07,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 05:58:07,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 05:58:07,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 05:58:07,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 05:58:07,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 05:58:07,325 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 05:58:07,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 05:58:07,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 05:58:07,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 05:58:07,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 05:58:07,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 05:58:07,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 05:58:07,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 05:58:07,326 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1 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 -> 8ff37a6bc6dd9a1cef87b79c0817272bb118995e5e060e5cd0eb428df45ac24f [2024-12-02 05:58:07,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 05:58:07,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 05:58:07,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 05:58:07,544 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 05:58:07,544 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 05:58:07,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-12-02 05:58:10,206 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/data/92e6c8018/e1634e0ee9ab40048a029e641787a993/FLAG52f663651 [2024-12-02 05:58:10,488 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 05:58:10,489 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-12-02 05:58:10,506 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/data/92e6c8018/e1634e0ee9ab40048a029e641787a993/FLAG52f663651 [2024-12-02 05:58:10,520 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/data/92e6c8018/e1634e0ee9ab40048a029e641787a993 [2024-12-02 05:58:10,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 05:58:10,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 05:58:10,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 05:58:10,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 05:58:10,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 05:58:10,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:58:10" (1/1) ... [2024-12-02 05:58:10,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44586f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:10, skipping insertion in model container [2024-12-02 05:58:10,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:58:10" (1/1) ... [2024-12-02 05:58:10,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 05:58:11,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34668,34681] [2024-12-02 05:58:11,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35558,35571] [2024-12-02 05:58:11,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37388,37401] [2024-12-02 05:58:11,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38278,38291] [2024-12-02 05:58:11,233 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41051,41064] [2024-12-02 05:58:11,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41944,41957] [2024-12-02 05:58:11,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[43777,43790] [2024-12-02 05:58:11,301 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[45054,45067] [2024-12-02 05:58:11,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60707,60720] [2024-12-02 05:58:11,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61600,61613] [2024-12-02 05:58:11,491 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[63433,63446] [2024-12-02 05:58:11,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67890,67903] [2024-12-02 05:58:11,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 05:58:11,675 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 05:58:11,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34668,34681] [2024-12-02 05:58:11,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35558,35571] [2024-12-02 05:58:11,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37388,37401] [2024-12-02 05:58:11,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38278,38291] [2024-12-02 05:58:12,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41051,41064] [2024-12-02 05:58:12,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41944,41957] [2024-12-02 05:58:12,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[43777,43790] [2024-12-02 05:58:12,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[45054,45067] [2024-12-02 05:58:12,167 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60707,60720] [2024-12-02 05:58:12,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61600,61613] [2024-12-02 05:58:12,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[63433,63446] [2024-12-02 05:58:12,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67890,67903] [2024-12-02 05:58:12,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 05:58:12,341 INFO L204 MainTranslator]: Completed translation [2024-12-02 05:58:12,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12 WrapperNode [2024-12-02 05:58:12,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 05:58:12,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 05:58:12,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 05:58:12,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 05:58:12,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,461 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4306 [2024-12-02 05:58:12,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 05:58:12,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 05:58:12,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 05:58:12,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 05:58:12,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,520 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]. [2024-12-02 05:58:12,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,550 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 05:58:12,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 05:58:12,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 05:58:12,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 05:58:12,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (1/1) ... [2024-12-02 05:58:12,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 05:58:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 05:58:12,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 05:58:12,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c2abe73-3917-45f6-ab19-ae4fcaaa8287/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 05:58:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 05:58:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 05:58:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 05:58:12,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 05:58:12,872 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 05:58:12,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 05:58:15,615 INFO L? ?]: Removed 267 outVars from TransFormulas that were not future-live. [2024-12-02 05:58:15,615 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 05:58:15,644 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 05:58:15,644 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 05:58:15,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:58:15 BoogieIcfgContainer [2024-12-02 05:58:15,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 05:58:15,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 05:58:15,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 05:58:15,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 05:58:15,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:58:10" (1/3) ... [2024-12-02 05:58:15,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6eaaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:58:15, skipping insertion in model container [2024-12-02 05:58:15,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:58:12" (2/3) ... [2024-12-02 05:58:15,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6eaaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:58:15, skipping insertion in model container [2024-12-02 05:58:15,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:58:15" (3/3) ... [2024-12-02 05:58:15,653 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-12-02 05:58:15,664 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 05:58:15,666 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 999 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2024-12-02 05:58:15,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 05:58:15,743 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;@13758b9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 05:58:15,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-12-02 05:58:15,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 999 states, 986 states have (on average 1.8123732251521298) internal successors, (1787), 998 states have internal predecessors, (1787), 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) [2024-12-02 05:58:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-12-02 05:58:15,773 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:15,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:15,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:15,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:15,779 INFO L85 PathProgramCache]: Analyzing trace with hash -85310569, now seen corresponding path program 1 times [2024-12-02 05:58:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610869698] [2024-12-02 05:58:15,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:15,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:16,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:16,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610869698] [2024-12-02 05:58:16,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610869698] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:16,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:16,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:58:16,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493704573] [2024-12-02 05:58:16,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:16,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:58:16,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:16,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:58:16,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:58:16,559 INFO L87 Difference]: Start difference. First operand has 999 states, 986 states have (on average 1.8123732251521298) internal successors, (1787), 998 states have internal predecessors, (1787), 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 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 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) [2024-12-02 05:58:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:16,850 INFO L93 Difference]: Finished difference Result 1757 states and 3116 transitions. [2024-12-02 05:58:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:58:16,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 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 308 [2024-12-02 05:58:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:16,869 INFO L225 Difference]: With dead ends: 1757 [2024-12-02 05:58:16,870 INFO L226 Difference]: Without dead ends: 1465 [2024-12-02 05:58:16,874 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 [2024-12-02 05:58:16,877 INFO L435 NwaCegarLoop]: 1966 mSDtfsCounter, 999 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:16,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 3253 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 05:58:16,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2024-12-02 05:58:16,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1463. [2024-12-02 05:58:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1451 states have (on average 1.5506547208821502) internal successors, (2250), 1462 states have internal predecessors, (2250), 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) [2024-12-02 05:58:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2250 transitions. [2024-12-02 05:58:16,983 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2250 transitions. Word has length 308 [2024-12-02 05:58:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:16,984 INFO L471 AbstractCegarLoop]: Abstraction has 1463 states and 2250 transitions. [2024-12-02 05:58:16,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 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) [2024-12-02 05:58:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2250 transitions. [2024-12-02 05:58:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-12-02 05:58:16,990 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:16,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:16,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 05:58:16,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:16,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:16,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1477444319, now seen corresponding path program 1 times [2024-12-02 05:58:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:16,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893265303] [2024-12-02 05:58:16,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:17,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893265303] [2024-12-02 05:58:17,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893265303] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:17,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:17,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:58:17,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235135034] [2024-12-02 05:58:17,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:17,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:58:17,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:17,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:58:17,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:58:17,499 INFO L87 Difference]: Start difference. First operand 1463 states and 2250 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 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) [2024-12-02 05:58:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:17,781 INFO L93 Difference]: Finished difference Result 2860 states and 4447 transitions. [2024-12-02 05:58:17,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:58:17,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 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 308 [2024-12-02 05:58:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:17,792 INFO L225 Difference]: With dead ends: 2860 [2024-12-02 05:58:17,792 INFO L226 Difference]: Without dead ends: 2491 [2024-12-02 05:58:17,794 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 [2024-12-02 05:58:17,795 INFO L435 NwaCegarLoop]: 1670 mSDtfsCounter, 889 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:17,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 2824 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 05:58:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2024-12-02 05:58:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 2489. [2024-12-02 05:58:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2477 states have (on average 1.5538958417440452) internal successors, (3849), 2488 states have internal predecessors, (3849), 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) [2024-12-02 05:58:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3849 transitions. [2024-12-02 05:58:17,879 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3849 transitions. Word has length 308 [2024-12-02 05:58:17,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:17,880 INFO L471 AbstractCegarLoop]: Abstraction has 2489 states and 3849 transitions. [2024-12-02 05:58:17,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 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) [2024-12-02 05:58:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3849 transitions. [2024-12-02 05:58:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-12-02 05:58:17,887 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:17,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:17,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 05:58:17,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:17,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1477875295, now seen corresponding path program 1 times [2024-12-02 05:58:17,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:17,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806509588] [2024-12-02 05:58:17,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:17,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:19,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:19,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806509588] [2024-12-02 05:58:19,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806509588] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:19,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:19,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 05:58:19,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624156569] [2024-12-02 05:58:19,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:19,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 05:58:19,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:19,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 05:58:19,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:58:19,147 INFO L87 Difference]: Start difference. First operand 2489 states and 3849 transitions. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 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) [2024-12-02 05:58:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:19,390 INFO L93 Difference]: Finished difference Result 9713 states and 14977 transitions. [2024-12-02 05:58:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 05:58:19,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 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 308 [2024-12-02 05:58:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:19,417 INFO L225 Difference]: With dead ends: 9713 [2024-12-02 05:58:19,417 INFO L226 Difference]: Without dead ends: 7271 [2024-12-02 05:58:19,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:58:19,422 INFO L435 NwaCegarLoop]: 2505 mSDtfsCounter, 3272 mSDsluCounter, 2864 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3272 SdHoareTripleChecker+Valid, 5369 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:19,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3272 Valid, 5369 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:58:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7271 states. [2024-12-02 05:58:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7271 to 4714. [2024-12-02 05:58:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4714 states, 4702 states have (on average 1.5484900042535092) internal successors, (7281), 4713 states have internal predecessors, (7281), 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) [2024-12-02 05:58:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 7281 transitions. [2024-12-02 05:58:19,573 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 7281 transitions. Word has length 308 [2024-12-02 05:58:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:19,573 INFO L471 AbstractCegarLoop]: Abstraction has 4714 states and 7281 transitions. [2024-12-02 05:58:19,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 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) [2024-12-02 05:58:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 7281 transitions. [2024-12-02 05:58:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-12-02 05:58:19,584 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:19,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:19,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 05:58:19,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:19,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:19,586 INFO L85 PathProgramCache]: Analyzing trace with hash 157578207, now seen corresponding path program 1 times [2024-12-02 05:58:19,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:19,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183987616] [2024-12-02 05:58:19,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:19,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:19,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:19,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183987616] [2024-12-02 05:58:19,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183987616] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:19,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:19,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:58:19,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28037720] [2024-12-02 05:58:19,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:19,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:58:19,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:19,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:58:19,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:58:19,883 INFO L87 Difference]: Start difference. First operand 4714 states and 7281 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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) [2024-12-02 05:58:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:20,080 INFO L93 Difference]: Finished difference Result 13840 states and 21318 transitions. [2024-12-02 05:58:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:58:20,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 310 [2024-12-02 05:58:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:20,114 INFO L225 Difference]: With dead ends: 13840 [2024-12-02 05:58:20,114 INFO L226 Difference]: Without dead ends: 9251 [2024-12-02 05:58:20,121 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 [2024-12-02 05:58:20,121 INFO L435 NwaCegarLoop]: 2963 mSDtfsCounter, 1390 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 4416 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:20,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 4416 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:58:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9251 states. [2024-12-02 05:58:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9251 to 9080. [2024-12-02 05:58:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9080 states, 9068 states have (on average 1.540692545213939) internal successors, (13971), 9079 states have internal predecessors, (13971), 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) [2024-12-02 05:58:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9080 states to 9080 states and 13971 transitions. [2024-12-02 05:58:20,377 INFO L78 Accepts]: Start accepts. Automaton has 9080 states and 13971 transitions. Word has length 310 [2024-12-02 05:58:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:20,377 INFO L471 AbstractCegarLoop]: Abstraction has 9080 states and 13971 transitions. [2024-12-02 05:58:20,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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) [2024-12-02 05:58:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 9080 states and 13971 transitions. [2024-12-02 05:58:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-12-02 05:58:20,392 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:20,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:20,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 05:58:20,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:20,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1863589604, now seen corresponding path program 1 times [2024-12-02 05:58:20,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:20,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49759359] [2024-12-02 05:58:20,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:20,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:20,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:20,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49759359] [2024-12-02 05:58:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49759359] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:20,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:20,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:58:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358811509] [2024-12-02 05:58:20,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:20,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:58:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:20,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:58:20,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:58:20,600 INFO L87 Difference]: Start difference. First operand 9080 states and 13971 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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) [2024-12-02 05:58:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:20,744 INFO L93 Difference]: Finished difference Result 27173 states and 41792 transitions. [2024-12-02 05:58:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:58:20,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 310 [2024-12-02 05:58:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:20,794 INFO L225 Difference]: With dead ends: 27173 [2024-12-02 05:58:20,794 INFO L226 Difference]: Without dead ends: 18131 [2024-12-02 05:58:20,805 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 [2024-12-02 05:58:20,806 INFO L435 NwaCegarLoop]: 3020 mSDtfsCounter, 1507 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 4528 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:20,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 4528 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:58:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18131 states. [2024-12-02 05:58:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18131 to 9099. [2024-12-02 05:58:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9099 states, 9087 states have (on average 1.5406624848684936) internal successors, (14000), 9098 states have internal predecessors, (14000), 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) [2024-12-02 05:58:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9099 states to 9099 states and 14000 transitions. [2024-12-02 05:58:21,081 INFO L78 Accepts]: Start accepts. Automaton has 9099 states and 14000 transitions. Word has length 310 [2024-12-02 05:58:21,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:21,081 INFO L471 AbstractCegarLoop]: Abstraction has 9099 states and 14000 transitions. [2024-12-02 05:58:21,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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) [2024-12-02 05:58:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 9099 states and 14000 transitions. [2024-12-02 05:58:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-12-02 05:58:21,096 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:21,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:21,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 05:58:21,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:21,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:21,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2037830479, now seen corresponding path program 1 times [2024-12-02 05:58:21,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:21,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025998921] [2024-12-02 05:58:21,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:21,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:21,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:21,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025998921] [2024-12-02 05:58:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025998921] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:21,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:58:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094238694] [2024-12-02 05:58:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:21,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:58:21,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:21,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:58:21,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:58:21,305 INFO L87 Difference]: Start difference. First operand 9099 states and 14000 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 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) [2024-12-02 05:58:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:21,376 INFO L93 Difference]: Finished difference Result 18160 states and 27930 transitions. [2024-12-02 05:58:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:58:21,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 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) Word has length 311 [2024-12-02 05:58:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:21,395 INFO L225 Difference]: With dead ends: 18160 [2024-12-02 05:58:21,395 INFO L226 Difference]: Without dead ends: 9117 [2024-12-02 05:58:21,405 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 [2024-12-02 05:58:21,405 INFO L435 NwaCegarLoop]: 1531 mSDtfsCounter, 5 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3047 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:21,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3047 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:58:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9117 states. [2024-12-02 05:58:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9117 to 9117. [2024-12-02 05:58:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9117 states, 9105 states have (on average 1.5399231191652938) internal successors, (14021), 9116 states have internal predecessors, (14021), 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) [2024-12-02 05:58:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9117 states to 9117 states and 14021 transitions. [2024-12-02 05:58:21,567 INFO L78 Accepts]: Start accepts. Automaton has 9117 states and 14021 transitions. Word has length 311 [2024-12-02 05:58:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:21,567 INFO L471 AbstractCegarLoop]: Abstraction has 9117 states and 14021 transitions. [2024-12-02 05:58:21,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 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) [2024-12-02 05:58:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 9117 states and 14021 transitions. [2024-12-02 05:58:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-12-02 05:58:21,581 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:21,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:21,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 05:58:21,582 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:21,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1963640314, now seen corresponding path program 1 times [2024-12-02 05:58:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418136213] [2024-12-02 05:58:21,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:21,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:21,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:21,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418136213] [2024-12-02 05:58:21,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418136213] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:21,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:21,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:58:21,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305125813] [2024-12-02 05:58:21,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:21,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:58:21,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:21,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:58:21,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:58:21,815 INFO L87 Difference]: Start difference. First operand 9117 states and 14021 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2024-12-02 05:58:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:21,943 INFO L93 Difference]: Finished difference Result 25718 states and 39434 transitions. [2024-12-02 05:58:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:58:21,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 312 [2024-12-02 05:58:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:21,975 INFO L225 Difference]: With dead ends: 25718 [2024-12-02 05:58:21,975 INFO L226 Difference]: Without dead ends: 16842 [2024-12-02 05:58:21,987 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 [2024-12-02 05:58:21,987 INFO L435 NwaCegarLoop]: 2941 mSDtfsCounter, 1385 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 4394 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:21,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 4394 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:58:22,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16842 states. [2024-12-02 05:58:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16842 to 16671. [2024-12-02 05:58:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16671 states, 16659 states have (on average 1.529083378354043) internal successors, (25473), 16670 states have internal predecessors, (25473), 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) [2024-12-02 05:58:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16671 states to 16671 states and 25473 transitions. [2024-12-02 05:58:22,289 INFO L78 Accepts]: Start accepts. Automaton has 16671 states and 25473 transitions. Word has length 312 [2024-12-02 05:58:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:22,290 INFO L471 AbstractCegarLoop]: Abstraction has 16671 states and 25473 transitions. [2024-12-02 05:58:22,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2024-12-02 05:58:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 16671 states and 25473 transitions. [2024-12-02 05:58:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-12-02 05:58:22,320 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:22,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:22,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 05:58:22,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:22,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:22,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1031936087, now seen corresponding path program 1 times [2024-12-02 05:58:22,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:22,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071980925] [2024-12-02 05:58:22,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:22,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:23,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:23,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071980925] [2024-12-02 05:58:23,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071980925] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:23,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:23,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 05:58:23,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622150801] [2024-12-02 05:58:23,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:23,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 05:58:23,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:23,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 05:58:23,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:58:23,325 INFO L87 Difference]: Start difference. First operand 16671 states and 25473 transitions. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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) [2024-12-02 05:58:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:23,434 INFO L93 Difference]: Finished difference Result 49080 states and 74784 transitions. [2024-12-02 05:58:23,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 05:58:23,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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 312 [2024-12-02 05:58:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:23,473 INFO L225 Difference]: With dead ends: 49080 [2024-12-02 05:58:23,473 INFO L226 Difference]: Without dead ends: 32945 [2024-12-02 05:58:23,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:58:23,486 INFO L435 NwaCegarLoop]: 2820 mSDtfsCounter, 1476 mSDsluCounter, 4328 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 7148 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:23,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 7148 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:58:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32945 states. [2024-12-02 05:58:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32945 to 16906. [2024-12-02 05:58:23,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16906 states, 16894 states have (on average 1.5308393512489642) internal successors, (25862), 16905 states have internal predecessors, (25862), 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) [2024-12-02 05:58:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16906 states to 16906 states and 25862 transitions. [2024-12-02 05:58:23,713 INFO L78 Accepts]: Start accepts. Automaton has 16906 states and 25862 transitions. Word has length 312 [2024-12-02 05:58:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:23,713 INFO L471 AbstractCegarLoop]: Abstraction has 16906 states and 25862 transitions. [2024-12-02 05:58:23,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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) [2024-12-02 05:58:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 16906 states and 25862 transitions. [2024-12-02 05:58:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-12-02 05:58:23,725 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:23,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:23,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 05:58:23,725 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:23,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:23,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1069242614, now seen corresponding path program 1 times [2024-12-02 05:58:23,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:23,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004832019] [2024-12-02 05:58:23,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:23,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004832019] [2024-12-02 05:58:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004832019] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:23,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:58:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676899708] [2024-12-02 05:58:23,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:23,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:58:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:23,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:58:23,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:58:23,831 INFO L87 Difference]: Start difference. First operand 16906 states and 25862 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) [2024-12-02 05:58:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:23,916 INFO L93 Difference]: Finished difference Result 49156 states and 74863 transitions. [2024-12-02 05:58:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:58:23,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 314 [2024-12-02 05:58:23,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:23,944 INFO L225 Difference]: With dead ends: 49156 [2024-12-02 05:58:23,944 INFO L226 Difference]: Without dead ends: 33049 [2024-12-02 05:58:23,956 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 [2024-12-02 05:58:23,957 INFO L435 NwaCegarLoop]: 2888 mSDtfsCounter, 1375 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 4395 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 [2024-12-02 05:58:23,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 4395 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:58:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33049 states. [2024-12-02 05:58:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33049 to 17010. [2024-12-02 05:58:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17010 states, 16998 states have (on average 1.529885868925756) internal successors, (26005), 17009 states have internal predecessors, (26005), 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) [2024-12-02 05:58:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17010 states to 17010 states and 26005 transitions. [2024-12-02 05:58:24,319 INFO L78 Accepts]: Start accepts. Automaton has 17010 states and 26005 transitions. Word has length 314 [2024-12-02 05:58:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:24,320 INFO L471 AbstractCegarLoop]: Abstraction has 17010 states and 26005 transitions. [2024-12-02 05:58:24,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) [2024-12-02 05:58:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 17010 states and 26005 transitions. [2024-12-02 05:58:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-12-02 05:58:24,339 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:24,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:24,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 05:58:24,339 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:24,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash -379462261, now seen corresponding path program 1 times [2024-12-02 05:58:24,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:24,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078550685] [2024-12-02 05:58:24,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:24,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:24,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:24,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078550685] [2024-12-02 05:58:24,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078550685] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:24,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:24,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:58:24,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108054390] [2024-12-02 05:58:24,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:24,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:58:24,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:24,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:58:24,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:58:24,517 INFO L87 Difference]: Start difference. First operand 17010 states and 26005 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) [2024-12-02 05:58:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:24,674 INFO L93 Difference]: Finished difference Result 41181 states and 63266 transitions. [2024-12-02 05:58:24,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:58:24,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 314 [2024-12-02 05:58:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:24,705 INFO L225 Difference]: With dead ends: 41181 [2024-12-02 05:58:24,705 INFO L226 Difference]: Without dead ends: 25930 [2024-12-02 05:58:24,715 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 [2024-12-02 05:58:24,716 INFO L435 NwaCegarLoop]: 2009 mSDtfsCounter, 695 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 3291 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:24,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 3291 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:58:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25930 states. [2024-12-02 05:58:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25930 to 20838. [2024-12-02 05:58:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20838 states, 20826 states have (on average 1.550561797752809) internal successors, (32292), 20837 states have internal predecessors, (32292), 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) [2024-12-02 05:58:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20838 states to 20838 states and 32292 transitions. [2024-12-02 05:58:24,990 INFO L78 Accepts]: Start accepts. Automaton has 20838 states and 32292 transitions. Word has length 314 [2024-12-02 05:58:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:24,990 INFO L471 AbstractCegarLoop]: Abstraction has 20838 states and 32292 transitions. [2024-12-02 05:58:24,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) [2024-12-02 05:58:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 20838 states and 32292 transitions. [2024-12-02 05:58:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-12-02 05:58:25,000 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:25,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:25,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 05:58:25,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:25,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1866511943, now seen corresponding path program 1 times [2024-12-02 05:58:25,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:25,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129619110] [2024-12-02 05:58:25,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:25,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:25,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:25,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129619110] [2024-12-02 05:58:25,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129619110] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:25,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:25,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:58:25,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560471019] [2024-12-02 05:58:25,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:25,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:58:25,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:25,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:58:25,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:58:25,117 INFO L87 Difference]: Start difference. First operand 20838 states and 32292 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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) [2024-12-02 05:58:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:25,194 INFO L93 Difference]: Finished difference Result 40905 states and 63242 transitions. [2024-12-02 05:58:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:58:25,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 315 [2024-12-02 05:58:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:25,211 INFO L225 Difference]: With dead ends: 40905 [2024-12-02 05:58:25,211 INFO L226 Difference]: Without dead ends: 20963 [2024-12-02 05:58:25,221 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 [2024-12-02 05:58:25,222 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 5 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3040 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 [2024-12-02 05:58:25,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3040 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:58:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20963 states. [2024-12-02 05:58:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20963 to 20963. [2024-12-02 05:58:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20963 states, 20951 states have (on average 1.5482793184096224) internal successors, (32438), 20962 states have internal predecessors, (32438), 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) [2024-12-02 05:58:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20963 states to 20963 states and 32438 transitions. [2024-12-02 05:58:25,513 INFO L78 Accepts]: Start accepts. Automaton has 20963 states and 32438 transitions. Word has length 315 [2024-12-02 05:58:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:25,513 INFO L471 AbstractCegarLoop]: Abstraction has 20963 states and 32438 transitions. [2024-12-02 05:58:25,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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) [2024-12-02 05:58:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 20963 states and 32438 transitions. [2024-12-02 05:58:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-12-02 05:58:25,526 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:25,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:25,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 05:58:25,526 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:25,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:25,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1264402421, now seen corresponding path program 1 times [2024-12-02 05:58:25,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:25,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40238034] [2024-12-02 05:58:25,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:25,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:25,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:25,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40238034] [2024-12-02 05:58:25,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40238034] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:25,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:25,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:58:25,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550095444] [2024-12-02 05:58:25,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:25,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:58:25,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:25,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:58:25,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:58:25,713 INFO L87 Difference]: Start difference. First operand 20963 states and 32438 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 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) [2024-12-02 05:58:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:25,901 INFO L93 Difference]: Finished difference Result 51114 states and 79613 transitions. [2024-12-02 05:58:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:58:25,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 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) Word has length 316 [2024-12-02 05:58:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:25,937 INFO L225 Difference]: With dead ends: 51114 [2024-12-02 05:58:25,937 INFO L226 Difference]: Without dead ends: 32347 [2024-12-02 05:58:25,953 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 [2024-12-02 05:58:25,953 INFO L435 NwaCegarLoop]: 2005 mSDtfsCounter, 707 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:25,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 3254 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:58:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32347 states. [2024-12-02 05:58:26,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32347 to 27799. [2024-12-02 05:58:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27799 states, 27787 states have (on average 1.5697268506855724) internal successors, (43618), 27798 states have internal predecessors, (43618), 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) [2024-12-02 05:58:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27799 states to 27799 states and 43618 transitions. [2024-12-02 05:58:26,375 INFO L78 Accepts]: Start accepts. Automaton has 27799 states and 43618 transitions. Word has length 316 [2024-12-02 05:58:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:26,376 INFO L471 AbstractCegarLoop]: Abstraction has 27799 states and 43618 transitions. [2024-12-02 05:58:26,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 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) [2024-12-02 05:58:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 27799 states and 43618 transitions. [2024-12-02 05:58:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-12-02 05:58:26,385 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:26,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:26,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 05:58:26,385 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:26,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1673802775, now seen corresponding path program 1 times [2024-12-02 05:58:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:26,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378847100] [2024-12-02 05:58:26,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:27,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:27,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378847100] [2024-12-02 05:58:27,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378847100] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:27,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:27,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 05:58:27,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507348603] [2024-12-02 05:58:27,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:27,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 05:58:27,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:27,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 05:58:27,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 05:58:27,346 INFO L87 Difference]: Start difference. First operand 27799 states and 43618 transitions. Second operand has 5 states, 5 states have (on average 63.2) internal successors, (316), 5 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) [2024-12-02 05:58:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:27,992 INFO L93 Difference]: Finished difference Result 136309 states and 213748 transitions. [2024-12-02 05:58:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 05:58:27,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 63.2) internal successors, (316), 5 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) Word has length 316 [2024-12-02 05:58:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:28,094 INFO L225 Difference]: With dead ends: 136309 [2024-12-02 05:58:28,094 INFO L226 Difference]: Without dead ends: 108578 [2024-12-02 05:58:28,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 05:58:28,126 INFO L435 NwaCegarLoop]: 2562 mSDtfsCounter, 4290 mSDsluCounter, 6908 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4290 SdHoareTripleChecker+Valid, 9470 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:28,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4290 Valid, 9470 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 05:58:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108578 states. [2024-12-02 05:58:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108578 to 54187. [2024-12-02 05:58:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54187 states, 54175 states have (on average 1.5613105676049839) internal successors, (84584), 54186 states have internal predecessors, (84584), 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) [2024-12-02 05:58:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54187 states to 54187 states and 84584 transitions. [2024-12-02 05:58:29,118 INFO L78 Accepts]: Start accepts. Automaton has 54187 states and 84584 transitions. Word has length 316 [2024-12-02 05:58:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:29,119 INFO L471 AbstractCegarLoop]: Abstraction has 54187 states and 84584 transitions. [2024-12-02 05:58:29,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.2) internal successors, (316), 5 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) [2024-12-02 05:58:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 54187 states and 84584 transitions. [2024-12-02 05:58:29,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-12-02 05:58:29,138 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:29,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:29,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 05:58:29,138 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:29,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1495914519, now seen corresponding path program 1 times [2024-12-02 05:58:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226059853] [2024-12-02 05:58:29,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:29,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:29,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226059853] [2024-12-02 05:58:29,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226059853] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:29,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:29,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:58:29,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620304585] [2024-12-02 05:58:29,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:29,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:58:29,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:29,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:58:29,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:58:29,319 INFO L87 Difference]: Start difference. First operand 54187 states and 84584 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2024-12-02 05:58:29,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:29,636 INFO L93 Difference]: Finished difference Result 159517 states and 248673 transitions. [2024-12-02 05:58:29,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:58:29,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 318 [2024-12-02 05:58:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:29,733 INFO L225 Difference]: With dead ends: 159517 [2024-12-02 05:58:29,733 INFO L226 Difference]: Without dead ends: 106023 [2024-12-02 05:58:29,767 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 [2024-12-02 05:58:29,768 INFO L435 NwaCegarLoop]: 2901 mSDtfsCounter, 1357 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 4340 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:29,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 4340 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:58:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106023 states. [2024-12-02 05:58:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106023 to 105874. [2024-12-02 05:58:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105874 states, 105862 states have (on average 1.5526251157166877) internal successors, (164364), 105873 states have internal predecessors, (164364), 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) [2024-12-02 05:58:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105874 states to 105874 states and 164364 transitions. [2024-12-02 05:58:31,004 INFO L78 Accepts]: Start accepts. Automaton has 105874 states and 164364 transitions. Word has length 318 [2024-12-02 05:58:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:31,004 INFO L471 AbstractCegarLoop]: Abstraction has 105874 states and 164364 transitions. [2024-12-02 05:58:31,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2024-12-02 05:58:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 105874 states and 164364 transitions. [2024-12-02 05:58:31,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-12-02 05:58:31,037 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:31,037 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:31,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 05:58:31,037 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:31,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:31,038 INFO L85 PathProgramCache]: Analyzing trace with hash -518650060, now seen corresponding path program 1 times [2024-12-02 05:58:31,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:31,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117569680] [2024-12-02 05:58:31,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:31,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:31,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117569680] [2024-12-02 05:58:31,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117569680] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:31,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:31,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 05:58:31,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095353453] [2024-12-02 05:58:31,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:31,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 05:58:31,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:31,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 05:58:31,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:58:31,942 INFO L87 Difference]: Start difference. First operand 105874 states and 164364 transitions. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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) [2024-12-02 05:58:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:32,760 INFO L93 Difference]: Finished difference Result 313499 states and 486309 transitions. [2024-12-02 05:58:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 05:58:32,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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 318 [2024-12-02 05:58:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:32,933 INFO L225 Difference]: With dead ends: 313499 [2024-12-02 05:58:32,933 INFO L226 Difference]: Without dead ends: 210020 [2024-12-02 05:58:32,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:58:32,979 INFO L435 NwaCegarLoop]: 2990 mSDtfsCounter, 1461 mSDsluCounter, 4492 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 7482 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:32,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 7482 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:58:33,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210020 states. [2024-12-02 05:58:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210020 to 106787. [2024-12-02 05:58:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106787 states, 106775 states have (on average 1.5537625848747365) internal successors, (165903), 106786 states have internal predecessors, (165903), 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) [2024-12-02 05:58:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106787 states to 106787 states and 165903 transitions. [2024-12-02 05:58:34,757 INFO L78 Accepts]: Start accepts. Automaton has 106787 states and 165903 transitions. Word has length 318 [2024-12-02 05:58:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:34,757 INFO L471 AbstractCegarLoop]: Abstraction has 106787 states and 165903 transitions. [2024-12-02 05:58:34,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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) [2024-12-02 05:58:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 106787 states and 165903 transitions. [2024-12-02 05:58:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-12-02 05:58:34,789 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:34,790 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:34,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 05:58:34,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:34,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash 381216095, now seen corresponding path program 1 times [2024-12-02 05:58:34,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:34,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035460090] [2024-12-02 05:58:34,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:34,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:34,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:34,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035460090] [2024-12-02 05:58:34,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035460090] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:34,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:34,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:58:34,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306661346] [2024-12-02 05:58:34,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:34,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:58:34,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:34,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:58:34,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:58:34,912 INFO L87 Difference]: Start difference. First operand 106787 states and 165903 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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) [2024-12-02 05:58:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:35,958 INFO L93 Difference]: Finished difference Result 309695 states and 479794 transitions. [2024-12-02 05:58:35,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:58:35,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 319 [2024-12-02 05:58:35,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:36,171 INFO L225 Difference]: With dead ends: 309695 [2024-12-02 05:58:36,171 INFO L226 Difference]: Without dead ends: 206820 [2024-12-02 05:58:36,233 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 [2024-12-02 05:58:36,233 INFO L435 NwaCegarLoop]: 2806 mSDtfsCounter, 1369 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 4245 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:36,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 4245 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 05:58:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206820 states. [2024-12-02 05:58:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206820 to 206665. [2024-12-02 05:58:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206665 states, 206653 states have (on average 1.5424600659075842) internal successors, (318754), 206664 states have internal predecessors, (318754), 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) [2024-12-02 05:58:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206665 states to 206665 states and 318754 transitions. [2024-12-02 05:58:39,020 INFO L78 Accepts]: Start accepts. Automaton has 206665 states and 318754 transitions. Word has length 319 [2024-12-02 05:58:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:39,021 INFO L471 AbstractCegarLoop]: Abstraction has 206665 states and 318754 transitions. [2024-12-02 05:58:39,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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) [2024-12-02 05:58:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 206665 states and 318754 transitions. [2024-12-02 05:58:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-12-02 05:58:39,107 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:39,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 05:58:39,108 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:39,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:39,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1223392099, now seen corresponding path program 1 times [2024-12-02 05:58:39,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:39,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090989509] [2024-12-02 05:58:39,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:39,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:40,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:40,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090989509] [2024-12-02 05:58:40,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090989509] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:40,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:40,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 05:58:40,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167123726] [2024-12-02 05:58:40,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:40,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 05:58:40,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:40,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 05:58:40,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 05:58:40,074 INFO L87 Difference]: Start difference. First operand 206665 states and 318754 transitions. Second operand has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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) [2024-12-02 05:58:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:41,483 INFO L93 Difference]: Finished difference Result 598850 states and 921551 transitions. [2024-12-02 05:58:41,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 05:58:41,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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 320 [2024-12-02 05:58:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:41,811 INFO L225 Difference]: With dead ends: 598850 [2024-12-02 05:58:41,811 INFO L226 Difference]: Without dead ends: 392399 [2024-12-02 05:58:41,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 05:58:41,961 INFO L435 NwaCegarLoop]: 2626 mSDtfsCounter, 1382 mSDsluCounter, 6558 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 9184 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:41,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 9184 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:58:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392399 states. [2024-12-02 05:58:46,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392399 to 392288. [2024-12-02 05:58:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392288 states, 392276 states have (on average 1.5272563195301267) internal successors, (599106), 392287 states have internal predecessors, (599106), 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) [2024-12-02 05:58:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392288 states to 392288 states and 599106 transitions. [2024-12-02 05:58:47,091 INFO L78 Accepts]: Start accepts. Automaton has 392288 states and 599106 transitions. Word has length 320 [2024-12-02 05:58:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:47,091 INFO L471 AbstractCegarLoop]: Abstraction has 392288 states and 599106 transitions. [2024-12-02 05:58:47,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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) [2024-12-02 05:58:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 392288 states and 599106 transitions. [2024-12-02 05:58:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-12-02 05:58:47,213 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:47,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:47,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 05:58:47,213 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:47,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:47,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1245602206, now seen corresponding path program 1 times [2024-12-02 05:58:47,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:47,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115032869] [2024-12-02 05:58:47,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:47,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:47,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:47,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115032869] [2024-12-02 05:58:47,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115032869] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:47,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:47,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 05:58:47,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82940901] [2024-12-02 05:58:47,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:47,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 05:58:47,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:47,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 05:58:47,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:58:47,978 INFO L87 Difference]: Start difference. First operand 392288 states and 599106 transitions. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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) [2024-12-02 05:58:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:58:49,822 INFO L93 Difference]: Finished difference Result 783115 states and 1195582 transitions. [2024-12-02 05:58:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 05:58:49,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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 320 [2024-12-02 05:58:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:58:50,263 INFO L225 Difference]: With dead ends: 783115 [2024-12-02 05:58:50,264 INFO L226 Difference]: Without dead ends: 399308 [2024-12-02 05:58:50,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:58:50,370 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 95 mSDsluCounter, 3132 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 4762 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:58:50,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 4762 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:58:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399308 states. [2024-12-02 05:58:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399308 to 397212. [2024-12-02 05:58:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397212 states, 397200 states have (on average 1.5280840886203424) internal successors, (606955), 397211 states have internal predecessors, (606955), 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) [2024-12-02 05:58:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397212 states to 397212 states and 606955 transitions. [2024-12-02 05:58:55,846 INFO L78 Accepts]: Start accepts. Automaton has 397212 states and 606955 transitions. Word has length 320 [2024-12-02 05:58:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:58:55,847 INFO L471 AbstractCegarLoop]: Abstraction has 397212 states and 606955 transitions. [2024-12-02 05:58:55,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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) [2024-12-02 05:58:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 397212 states and 606955 transitions. [2024-12-02 05:58:55,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-12-02 05:58:55,971 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:58:55,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:58:55,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 05:58:55,971 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:58:55,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:58:55,972 INFO L85 PathProgramCache]: Analyzing trace with hash -989037387, now seen corresponding path program 1 times [2024-12-02 05:58:55,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:58:55,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427562983] [2024-12-02 05:58:55,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:58:55,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:58:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:58:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:58:56,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:58:56,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427562983] [2024-12-02 05:58:56,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427562983] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:58:56,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:58:56,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 05:58:56,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851615428] [2024-12-02 05:58:56,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:58:56,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 05:58:56,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:58:56,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 05:58:56,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:58:56,401 INFO L87 Difference]: Start difference. First operand 397212 states and 606955 transitions. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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) [2024-12-02 05:59:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:59:00,502 INFO L93 Difference]: Finished difference Result 1548378 states and 2360742 transitions. [2024-12-02 05:59:00,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 05:59:00,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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 320 [2024-12-02 05:59:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:59:01,669 INFO L225 Difference]: With dead ends: 1548378 [2024-12-02 05:59:01,669 INFO L226 Difference]: Without dead ends: 1152689 [2024-12-02 05:59:02,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:59:02,426 INFO L435 NwaCegarLoop]: 2416 mSDtfsCounter, 3257 mSDsluCounter, 2827 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3257 SdHoareTripleChecker+Valid, 5243 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 05:59:02,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3257 Valid, 5243 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 05:59:02,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152689 states. [2024-12-02 05:59:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152689 to 774785. [2024-12-02 05:59:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774785 states, 774773 states have (on average 1.518005919153094) internal successors, (1176110), 774784 states have internal predecessors, (1176110), 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) [2024-12-02 05:59:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774785 states to 774785 states and 1176110 transitions. [2024-12-02 05:59:14,892 INFO L78 Accepts]: Start accepts. Automaton has 774785 states and 1176110 transitions. Word has length 320 [2024-12-02 05:59:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:59:14,893 INFO L471 AbstractCegarLoop]: Abstraction has 774785 states and 1176110 transitions. [2024-12-02 05:59:14,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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) [2024-12-02 05:59:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 774785 states and 1176110 transitions. [2024-12-02 05:59:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-12-02 05:59:15,251 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:59:15,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:59:15,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 05:59:15,252 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:59:15,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:59:15,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1929700625, now seen corresponding path program 1 times [2024-12-02 05:59:15,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:59:15,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585105401] [2024-12-02 05:59:15,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:59:15,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:59:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:59:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:59:15,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:59:15,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585105401] [2024-12-02 05:59:15,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585105401] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:59:15,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:59:15,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:59:15,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119223754] [2024-12-02 05:59:15,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:59:15,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:59:15,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:59:15,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:59:15,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:59:15,370 INFO L87 Difference]: Start difference. First operand 774785 states and 1176110 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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) [2024-12-02 05:59:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:59:21,349 INFO L93 Difference]: Finished difference Result 2321174 states and 3522830 transitions. [2024-12-02 05:59:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:59:21,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 322 [2024-12-02 05:59:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:59:23,535 INFO L225 Difference]: With dead ends: 2321174 [2024-12-02 05:59:23,535 INFO L226 Difference]: Without dead ends: 1547997 [2024-12-02 05:59:24,623 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 [2024-12-02 05:59:24,623 INFO L435 NwaCegarLoop]: 2975 mSDtfsCounter, 1468 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 4477 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:59:24,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 4477 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:59:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547997 states. [2024-12-02 05:59:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547997 to 775155. [2024-12-02 05:59:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775155 states, 775143 states have (on average 1.5178528348962708) internal successors, (1176553), 775154 states have internal predecessors, (1176553), 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) [2024-12-02 05:59:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775155 states to 775155 states and 1176553 transitions. [2024-12-02 05:59:38,855 INFO L78 Accepts]: Start accepts. Automaton has 775155 states and 1176553 transitions. Word has length 322 [2024-12-02 05:59:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:59:38,855 INFO L471 AbstractCegarLoop]: Abstraction has 775155 states and 1176553 transitions. [2024-12-02 05:59:38,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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) [2024-12-02 05:59:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 775155 states and 1176553 transitions. [2024-12-02 05:59:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-12-02 05:59:39,576 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:59:39,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:59:39,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 05:59:39,576 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-12-02 05:59:39,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:59:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash 659255274, now seen corresponding path program 1 times [2024-12-02 05:59:39,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:59:39,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367636143] [2024-12-02 05:59:39,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:59:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:59:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:59:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:59:39,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:59:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367636143] [2024-12-02 05:59:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367636143] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:59:39,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:59:39,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 05:59:39,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276554922] [2024-12-02 05:59:39,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:59:39,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 05:59:39,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:59:39,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 05:59:39,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 05:59:39,687 INFO L87 Difference]: Start difference. First operand 775155 states and 1176553 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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) [2024-12-02 05:59:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:59:45,079 INFO L93 Difference]: Finished difference Result 2285778 states and 3465916 transitions. [2024-12-02 05:59:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 05:59:45,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 322 [2024-12-02 05:59:45,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:59:47,201 INFO L225 Difference]: With dead ends: 2285778 [2024-12-02 05:59:47,201 INFO L226 Difference]: Without dead ends: 1518959 [2024-12-02 05:59:47,423 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 [2024-12-02 05:59:47,424 INFO L435 NwaCegarLoop]: 2923 mSDtfsCounter, 1354 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 4375 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:59:47,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 4375 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:59:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518959 states.