./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB --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 617ae1489f29e51da3460fb942a43857fe18868baaa99bec3acd2e44a9429941 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:38:38,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:38:38,682 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:38:38,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:38:38,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:38:38,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:38:38,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:38:38,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:38:38,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:38:38,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:38:38,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:38:38,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:38:38,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:38:38,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:38:38,725 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:38:38,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:38:38,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:38:38,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:38:38,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:38:38,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:38:38,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:38:38,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:38:38,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:38:38,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:38:38,727 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:38:38,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:38:38,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:38:38,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:38:38,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:38:38,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:38:38,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:38:38,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:38:38,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:38:38,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:38:38,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:38:38,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:38:38,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:38:38,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:38:38,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:38:38,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:38:38,729 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:38:38,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:38:38,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:38:38,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:38:38,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:38:38,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:38:38,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:38:38,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:38:38,730 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 617ae1489f29e51da3460fb942a43857fe18868baaa99bec3acd2e44a9429941 [2024-11-28 02:38:39,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:38:39,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:38:39,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:38:39,106 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:38:39,107 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:38:39,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-28 02:38:42,856 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/data/40240d0e2/85401eddfe604372a000f28fc3bf1735/FLAGd95e18561 [2024-11-28 02:38:43,629 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:38:43,633 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-28 02:38:43,680 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/data/40240d0e2/85401eddfe604372a000f28fc3bf1735/FLAGd95e18561 [2024-11-28 02:38:43,712 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/data/40240d0e2/85401eddfe604372a000f28fc3bf1735 [2024-11-28 02:38:43,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:38:43,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:38:43,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:38:43,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:38:43,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:38:43,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:38:43" (1/1) ... [2024-11-28 02:38:43,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717fef59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:43, skipping insertion in model container [2024-11-28 02:38:43,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:38:43" (1/1) ... [2024-11-28 02:38:43,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:38:44,699 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[34295,34308] [2024-11-28 02:38:44,722 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[35185,35198] [2024-11-28 02:38:44,761 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[36972,36985] [2024-11-28 02:38:44,781 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[37862,37875] [2024-11-28 02:38:44,829 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[40549,40562] [2024-11-28 02:38:44,847 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[41442,41455] [2024-11-28 02:38:44,882 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[43232,43245] [2024-11-28 02:38:44,909 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[44593,44606] [2024-11-28 02:38:45,120 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[60061,60074] [2024-11-28 02:38:45,139 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[60954,60967] [2024-11-28 02:38:45,178 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[62744,62757] [2024-11-28 02:38:45,255 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[67157,67170] [2024-11-28 02:38:45,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:38:45,445 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:38:45,785 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[34295,34308] [2024-11-28 02:38:45,801 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[35185,35198] [2024-11-28 02:38:45,836 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[36972,36985] [2024-11-28 02:38:45,856 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[37862,37875] [2024-11-28 02:38:45,935 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[40549,40562] [2024-11-28 02:38:45,952 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[41442,41455] [2024-11-28 02:38:45,980 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[43232,43245] [2024-11-28 02:38:46,003 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[44593,44606] [2024-11-28 02:38:46,163 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[60061,60074] [2024-11-28 02:38:46,180 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[60954,60967] [2024-11-28 02:38:46,207 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[62744,62757] [2024-11-28 02:38:46,271 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_edea1587-dfd6-44e4-91a1-36c95e7bfa35/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[67157,67170] [2024-11-28 02:38:46,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:38:46,413 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:38:46,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46 WrapperNode [2024-11-28 02:38:46,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:38:46,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:38:46,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:38:46,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:38:46,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,595 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4262 [2024-11-28 02:38:46,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:38:46,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:38:46,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:38:46,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:38:46,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,694 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-11-28 02:38:46,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,805 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:38:46,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:38:46,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:38:46,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:38:46,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (1/1) ... [2024-11-28 02:38:46,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:38:46,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:46,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:38:46,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edea1587-dfd6-44e4-91a1-36c95e7bfa35/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:38:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:38:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:38:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:38:46,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:38:47,267 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:38:47,269 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:38:52,465 INFO L? ?]: Removed 293 outVars from TransFormulas that were not future-live. [2024-11-28 02:38:52,465 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:38:52,525 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:38:52,525 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 02:38:52,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:38:52 BoogieIcfgContainer [2024-11-28 02:38:52,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:38:52,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:38:52,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:38:52,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:38:52,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:38:43" (1/3) ... [2024-11-28 02:38:52,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262715b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:38:52, skipping insertion in model container [2024-11-28 02:38:52,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:46" (2/3) ... [2024-11-28 02:38:52,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262715b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:38:52, skipping insertion in model container [2024-11-28 02:38:52,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:38:52" (3/3) ... [2024-11-28 02:38:52,544 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-28 02:38:52,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:38:52,570 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 968 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2024-11-28 02:38:52,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:38:52,735 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;@2a1ee41c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:38:52,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-28 02:38:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 968 states, 955 states have (on average 1.817801047120419) internal successors, (1736), 967 states have internal predecessors, (1736), 0 states have call successors, (0), 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-11-28 02:38:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-11-28 02:38:52,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:52,792 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-11-28 02:38:52,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-28 02:38:52,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1381939308, now seen corresponding path program 1 times [2024-11-28 02:38:52,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:52,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634163974] [2024-11-28 02:38:52,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:52,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:54,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-11-28 02:38:54,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:54,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634163974] [2024-11-28 02:38:54,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634163974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:38:54,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:38:54,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:38:54,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026306782] [2024-11-28 02:38:54,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:38:54,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:38:54,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:54,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:38:54,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:38:54,655 INFO L87 Difference]: Start difference. First operand has 968 states, 955 states have (on average 1.817801047120419) internal successors, (1736), 967 states have internal predecessors, (1736), 0 states have call successors, (0), 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 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-11-28 02:38:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:55,375 INFO L93 Difference]: Finished difference Result 1724 states and 3072 transitions. [2024-11-28 02:38:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:38:55,378 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-11-28 02:38:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:55,408 INFO L225 Difference]: With dead ends: 1724 [2024-11-28 02:38:55,408 INFO L226 Difference]: Without dead ends: 1505 [2024-11-28 02:38:55,413 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-11-28 02:38:55,420 INFO L435 NwaCegarLoop]: 1863 mSDtfsCounter, 1018 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:55,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 3147 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:38:55,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-11-28 02:38:55,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2024-11-28 02:38:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1491 states have (on average 1.5586854460093897) internal successors, (2324), 1502 states have internal predecessors, (2324), 0 states have call successors, (0), 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-11-28 02:38:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2324 transitions. [2024-11-28 02:38:55,583 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2324 transitions. Word has length 310 [2024-11-28 02:38:55,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:55,585 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 2324 transitions. [2024-11-28 02:38:55,586 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-11-28 02:38:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2324 transitions. [2024-11-28 02:38:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-11-28 02:38:55,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:55,601 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-11-28 02:38:55,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:38:55,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-28 02:38:55,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:55,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1382370284, now seen corresponding path program 1 times [2024-11-28 02:38:55,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:55,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678151709] [2024-11-28 02:38:55,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:55,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:38:58,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:58,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678151709] [2024-11-28 02:38:58,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678151709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:38:58,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:38:58,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:38:58,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425103401] [2024-11-28 02:38:58,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:38:58,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:38:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:58,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:38:58,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:38:58,115 INFO L87 Difference]: Start difference. First operand 1503 states and 2324 transitions. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 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-11-28 02:38:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:58,571 INFO L93 Difference]: Finished difference Result 7389 states and 11401 transitions. [2024-11-28 02:38:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:38:58,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 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-11-28 02:38:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:58,607 INFO L225 Difference]: With dead ends: 7389 [2024-11-28 02:38:58,608 INFO L226 Difference]: Without dead ends: 5897 [2024-11-28 02:38:58,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:38:58,616 INFO L435 NwaCegarLoop]: 2352 mSDtfsCounter, 4642 mSDsluCounter, 3736 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4642 SdHoareTripleChecker+Valid, 6088 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:58,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4642 Valid, 6088 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:38:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5897 states. [2024-11-28 02:38:58,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5897 to 2808. [2024-11-28 02:38:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2808 states, 2796 states have (on average 1.554005722460658) internal successors, (4345), 2807 states have internal predecessors, (4345), 0 states have call successors, (0), 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-11-28 02:38:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4345 transitions. [2024-11-28 02:38:58,797 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4345 transitions. Word has length 310 [2024-11-28 02:38:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:58,799 INFO L471 AbstractCegarLoop]: Abstraction has 2808 states and 4345 transitions. [2024-11-28 02:38:58,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 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-11-28 02:38:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4345 transitions. [2024-11-28 02:38:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-28 02:38:58,814 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:58,814 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-11-28 02:38:58,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:38:58,815 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-11-28 02:38:58,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1703579982, now seen corresponding path program 1 times [2024-11-28 02:38:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:58,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842375450] [2024-11-28 02:38:58,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:38:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842375450] [2024-11-28 02:38:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842375450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:38:59,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:38:59,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:38:59,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020966266] [2024-11-28 02:38:59,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:38:59,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:38:59,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:38:59,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:38:59,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:38:59,242 INFO L87 Difference]: Start difference. First operand 2808 states and 4345 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-11-28 02:38:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:59,529 INFO L93 Difference]: Finished difference Result 8201 states and 12647 transitions. [2024-11-28 02:38:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:38:59,531 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-11-28 02:38:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:59,555 INFO L225 Difference]: With dead ends: 8201 [2024-11-28 02:38:59,555 INFO L226 Difference]: Without dead ends: 5518 [2024-11-28 02:38:59,559 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-11-28 02:38:59,560 INFO L435 NwaCegarLoop]: 2867 mSDtfsCounter, 1330 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 4273 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.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:59,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 4273 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:38:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2024-11-28 02:38:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 5363. [2024-11-28 02:38:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5363 states, 5351 states have (on average 1.547187441599701) internal successors, (8279), 5362 states have internal predecessors, (8279), 0 states have call successors, (0), 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-11-28 02:38:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5363 states to 5363 states and 8279 transitions. [2024-11-28 02:38:59,758 INFO L78 Accepts]: Start accepts. Automaton has 5363 states and 8279 transitions. Word has length 312 [2024-11-28 02:38:59,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:59,758 INFO L471 AbstractCegarLoop]: Abstraction has 5363 states and 8279 transitions. [2024-11-28 02:38:59,758 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-11-28 02:38:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 5363 states and 8279 transitions. [2024-11-28 02:38:59,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-28 02:38:59,773 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:59,773 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-11-28 02:38:59,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:38:59,774 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-11-28 02:38:59,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash 503025427, now seen corresponding path program 1 times [2024-11-28 02:38:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:59,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525669740] [2024-11-28 02:38:59,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:00,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525669740] [2024-11-28 02:39:00,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525669740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:00,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:00,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950711236] [2024-11-28 02:39:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:00,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:00,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:00,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:00,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:00,094 INFO L87 Difference]: Start difference. First operand 5363 states and 8279 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-11-28 02:39:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:00,295 INFO L93 Difference]: Finished difference Result 16022 states and 24721 transitions. [2024-11-28 02:39:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:00,296 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-11-28 02:39:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:00,348 INFO L225 Difference]: With dead ends: 16022 [2024-11-28 02:39:00,348 INFO L226 Difference]: Without dead ends: 10697 [2024-11-28 02:39:00,358 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-11-28 02:39:00,359 INFO L435 NwaCegarLoop]: 2926 mSDtfsCounter, 1460 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 4387 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-11-28 02:39:00,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 4387 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10697 states. [2024-11-28 02:39:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10697 to 5382. [2024-11-28 02:39:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5382 states, 5370 states have (on average 1.546927374301676) internal successors, (8307), 5381 states have internal predecessors, (8307), 0 states have call successors, (0), 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-11-28 02:39:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5382 states to 5382 states and 8307 transitions. [2024-11-28 02:39:00,631 INFO L78 Accepts]: Start accepts. Automaton has 5382 states and 8307 transitions. Word has length 312 [2024-11-28 02:39:00,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:00,632 INFO L471 AbstractCegarLoop]: Abstraction has 5382 states and 8307 transitions. [2024-11-28 02:39:00,632 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-11-28 02:39:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 5382 states and 8307 transitions. [2024-11-28 02:39:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-28 02:39:00,646 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:00,647 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] [2024-11-28 02:39:00,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:39:00,647 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-11-28 02:39:00,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:00,648 INFO L85 PathProgramCache]: Analyzing trace with hash -906849756, now seen corresponding path program 1 times [2024-11-28 02:39:00,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:00,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608716725] [2024-11-28 02:39:00,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:00,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:00,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:00,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608716725] [2024-11-28 02:39:00,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608716725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:00,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:00,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:00,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96379111] [2024-11-28 02:39:00,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:00,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:00,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:00,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:00,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:00,982 INFO L87 Difference]: Start difference. First operand 5382 states and 8307 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-11-28 02:39:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:01,125 INFO L93 Difference]: Finished difference Result 10726 states and 16547 transitions. [2024-11-28 02:39:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:01,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 313 [2024-11-28 02:39:01,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:01,171 INFO L225 Difference]: With dead ends: 10726 [2024-11-28 02:39:01,171 INFO L226 Difference]: Without dead ends: 5400 [2024-11-28 02:39:01,177 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-11-28 02:39:01,179 INFO L435 NwaCegarLoop]: 1484 mSDtfsCounter, 5 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2953 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-11-28 02:39:01,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2953 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5400 states. [2024-11-28 02:39:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5400 to 5400. [2024-11-28 02:39:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5400 states, 5388 states have (on average 1.5456570155902005) internal successors, (8328), 5399 states have internal predecessors, (8328), 0 states have call successors, (0), 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-11-28 02:39:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5400 states to 5400 states and 8328 transitions. [2024-11-28 02:39:01,367 INFO L78 Accepts]: Start accepts. Automaton has 5400 states and 8328 transitions. Word has length 313 [2024-11-28 02:39:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:01,367 INFO L471 AbstractCegarLoop]: Abstraction has 5400 states and 8328 transitions. [2024-11-28 02:39:01,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-11-28 02:39:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 5400 states and 8328 transitions. [2024-11-28 02:39:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-28 02:39:01,380 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:01,381 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-11-28 02:39:01,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:39:01,381 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-11-28 02:39:01,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash 850090281, now seen corresponding path program 1 times [2024-11-28 02:39:01,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:01,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277800770] [2024-11-28 02:39:01,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:01,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:01,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:01,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277800770] [2024-11-28 02:39:01,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277800770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:01,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:01,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:01,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185961202] [2024-11-28 02:39:01,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:01,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:01,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:01,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:01,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:01,736 INFO L87 Difference]: Start difference. First operand 5400 states and 8328 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-11-28 02:39:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:02,002 INFO L93 Difference]: Finished difference Result 15669 states and 24081 transitions. [2024-11-28 02:39:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:02,003 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-11-28 02:39:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:02,095 INFO L225 Difference]: With dead ends: 15669 [2024-11-28 02:39:02,097 INFO L226 Difference]: Without dead ends: 10510 [2024-11-28 02:39:02,102 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-11-28 02:39:02,104 INFO L435 NwaCegarLoop]: 2874 mSDtfsCounter, 1324 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 4280 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-11-28 02:39:02,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 4280 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:39:02,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10510 states. [2024-11-28 02:39:02,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10510 to 10355. [2024-11-28 02:39:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10355 states, 10343 states have (on average 1.5357246446872281) internal successors, (15884), 10354 states have internal predecessors, (15884), 0 states have call successors, (0), 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-11-28 02:39:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10355 states to 10355 states and 15884 transitions. [2024-11-28 02:39:02,543 INFO L78 Accepts]: Start accepts. Automaton has 10355 states and 15884 transitions. Word has length 314 [2024-11-28 02:39:02,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:02,545 INFO L471 AbstractCegarLoop]: Abstraction has 10355 states and 15884 transitions. [2024-11-28 02:39:02,547 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-11-28 02:39:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 10355 states and 15884 transitions. [2024-11-28 02:39:02,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-28 02:39:02,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:02,575 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-11-28 02:39:02,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:39:02,576 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-11-28 02:39:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1164474298, now seen corresponding path program 1 times [2024-11-28 02:39:02,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:02,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036126323] [2024-11-28 02:39:02,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:02,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:04,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036126323] [2024-11-28 02:39:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036126323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:04,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:04,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:39:04,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402582051] [2024-11-28 02:39:04,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:04,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:39:04,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:04,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:39:04,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:39:04,201 INFO L87 Difference]: Start difference. First operand 10355 states and 15884 transitions. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 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-11-28 02:39:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:04,502 INFO L93 Difference]: Finished difference Result 30132 states and 46026 transitions. [2024-11-28 02:39:04,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:39:04,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 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-11-28 02:39:04,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:04,552 INFO L225 Difference]: With dead ends: 30132 [2024-11-28 02:39:04,553 INFO L226 Difference]: Without dead ends: 20313 [2024-11-28 02:39:04,567 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-11-28 02:39:04,568 INFO L435 NwaCegarLoop]: 2921 mSDtfsCounter, 1429 mSDsluCounter, 4382 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1429 SdHoareTripleChecker+Valid, 7303 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:04,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1429 Valid, 7303 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:39:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20313 states. [2024-11-28 02:39:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20313 to 10590. [2024-11-28 02:39:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10590 states, 10578 states have (on average 1.5382870107770845) internal successors, (16272), 10589 states have internal predecessors, (16272), 0 states have call successors, (0), 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-11-28 02:39:05,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10590 states to 10590 states and 16272 transitions. [2024-11-28 02:39:05,068 INFO L78 Accepts]: Start accepts. Automaton has 10590 states and 16272 transitions. Word has length 314 [2024-11-28 02:39:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:05,069 INFO L471 AbstractCegarLoop]: Abstraction has 10590 states and 16272 transitions. [2024-11-28 02:39:05,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 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-11-28 02:39:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10590 states and 16272 transitions. [2024-11-28 02:39:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-28 02:39:05,090 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:05,091 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-11-28 02:39:05,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:39:05,091 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-11-28 02:39:05,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:05,092 INFO L85 PathProgramCache]: Analyzing trace with hash 111018808, now seen corresponding path program 1 times [2024-11-28 02:39:05,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:05,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559430851] [2024-11-28 02:39:05,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:05,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:05,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:05,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559430851] [2024-11-28 02:39:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559430851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:05,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:05,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:05,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251919213] [2024-11-28 02:39:05,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:05,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:05,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:05,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:05,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:05,392 INFO L87 Difference]: Start difference. First operand 10590 states and 16272 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-11-28 02:39:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:05,685 INFO L93 Difference]: Finished difference Result 22719 states and 35102 transitions. [2024-11-28 02:39:05,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:05,686 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-11-28 02:39:05,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:05,723 INFO L225 Difference]: With dead ends: 22719 [2024-11-28 02:39:05,723 INFO L226 Difference]: Without dead ends: 13888 [2024-11-28 02:39:05,736 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-11-28 02:39:05,737 INFO L435 NwaCegarLoop]: 1820 mSDtfsCounter, 536 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:05,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 3078 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:39:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13888 states. [2024-11-28 02:39:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13888 to 12494. [2024-11-28 02:39:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12494 states, 12482 states have (on average 1.5551994872616568) internal successors, (19412), 12493 states have internal predecessors, (19412), 0 states have call successors, (0), 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-11-28 02:39:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12494 states to 12494 states and 19412 transitions. [2024-11-28 02:39:06,161 INFO L78 Accepts]: Start accepts. Automaton has 12494 states and 19412 transitions. Word has length 315 [2024-11-28 02:39:06,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:06,163 INFO L471 AbstractCegarLoop]: Abstraction has 12494 states and 19412 transitions. [2024-11-28 02:39:06,164 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-11-28 02:39:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 12494 states and 19412 transitions. [2024-11-28 02:39:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-28 02:39:06,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:06,188 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-11-28 02:39:06,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:39:06,188 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-11-28 02:39:06,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1009554271, now seen corresponding path program 1 times [2024-11-28 02:39:06,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:06,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467602168] [2024-11-28 02:39:06,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:06,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:06,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:06,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467602168] [2024-11-28 02:39:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467602168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:06,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:06,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:06,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283615302] [2024-11-28 02:39:06,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:06,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:06,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:06,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:06,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:06,469 INFO L87 Difference]: Start difference. First operand 12494 states and 19412 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-11-28 02:39:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:06,679 INFO L93 Difference]: Finished difference Result 35920 states and 55525 transitions. [2024-11-28 02:39:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:06,680 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-11-28 02:39:06,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:06,742 INFO L225 Difference]: With dead ends: 35920 [2024-11-28 02:39:06,742 INFO L226 Difference]: Without dead ends: 24225 [2024-11-28 02:39:06,761 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-11-28 02:39:06,764 INFO L435 NwaCegarLoop]: 2788 mSDtfsCounter, 1325 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 4245 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:06,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 4245 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:39:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24225 states. [2024-11-28 02:39:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24225 to 12598. [2024-11-28 02:39:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12598 states, 12586 states have (on average 1.5537104719529635) internal successors, (19555), 12597 states have internal predecessors, (19555), 0 states have call successors, (0), 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-11-28 02:39:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12598 states to 12598 states and 19555 transitions. [2024-11-28 02:39:07,280 INFO L78 Accepts]: Start accepts. Automaton has 12598 states and 19555 transitions. Word has length 316 [2024-11-28 02:39:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:07,280 INFO L471 AbstractCegarLoop]: Abstraction has 12598 states and 19555 transitions. [2024-11-28 02:39:07,281 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-11-28 02:39:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 12598 states and 19555 transitions. [2024-11-28 02:39:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-11-28 02:39:07,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:07,306 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] [2024-11-28 02:39:07,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:39:07,307 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-11-28 02:39:07,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash 81682878, now seen corresponding path program 1 times [2024-11-28 02:39:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:07,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982713395] [2024-11-28 02:39:07,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:07,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:07,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:07,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982713395] [2024-11-28 02:39:07,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982713395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:07,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:07,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:07,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114837543] [2024-11-28 02:39:07,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:07,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:07,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:07,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:07,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:07,623 INFO L87 Difference]: Start difference. First operand 12598 states and 19555 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-11-28 02:39:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:07,754 INFO L93 Difference]: Finished difference Result 24425 states and 37774 transitions. [2024-11-28 02:39:07,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:07,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 317 [2024-11-28 02:39:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:07,788 INFO L225 Difference]: With dead ends: 24425 [2024-11-28 02:39:07,788 INFO L226 Difference]: Without dead ends: 12723 [2024-11-28 02:39:07,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-11-28 02:39:07,807 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 5 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2946 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-11-28 02:39:07,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2946 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:39:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12723 states. [2024-11-28 02:39:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12723 to 12723. [2024-11-28 02:39:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12723 states, 12711 states have (on average 1.549917394382818) internal successors, (19701), 12722 states have internal predecessors, (19701), 0 states have call successors, (0), 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-11-28 02:39:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12723 states to 12723 states and 19701 transitions. [2024-11-28 02:39:08,132 INFO L78 Accepts]: Start accepts. Automaton has 12723 states and 19701 transitions. Word has length 317 [2024-11-28 02:39:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:08,132 INFO L471 AbstractCegarLoop]: Abstraction has 12723 states and 19701 transitions. [2024-11-28 02:39:08,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-11-28 02:39:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 12723 states and 19701 transitions. [2024-11-28 02:39:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-28 02:39:08,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:08,162 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-11-28 02:39:08,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:39:08,163 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-11-28 02:39:08,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:08,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1501227270, now seen corresponding path program 1 times [2024-11-28 02:39:08,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:08,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820759288] [2024-11-28 02:39:08,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:08,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:08,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820759288] [2024-11-28 02:39:08,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820759288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:08,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:08,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:39:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927601438] [2024-11-28 02:39:08,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:08,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:39:08,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:08,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:39:08,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:08,912 INFO L87 Difference]: Start difference. First operand 12723 states and 19701 transitions. Second operand has 5 states, 5 states have (on average 63.6) 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-11-28 02:39:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:09,686 INFO L93 Difference]: Finished difference Result 23474 states and 36374 transitions. [2024-11-28 02:39:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:39:09,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 63.6) 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-11-28 02:39:09,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:09,721 INFO L225 Difference]: With dead ends: 23474 [2024-11-28 02:39:09,721 INFO L226 Difference]: Without dead ends: 12723 [2024-11-28 02:39:09,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:39:09,733 INFO L435 NwaCegarLoop]: 1160 mSDtfsCounter, 3714 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3714 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:09,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3714 Valid, 1717 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:39:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12723 states. [2024-11-28 02:39:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12723 to 12723. [2024-11-28 02:39:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12723 states, 12711 states have (on average 1.54205019274644) internal successors, (19601), 12722 states have internal predecessors, (19601), 0 states have call successors, (0), 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-11-28 02:39:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12723 states to 12723 states and 19601 transitions. [2024-11-28 02:39:09,972 INFO L78 Accepts]: Start accepts. Automaton has 12723 states and 19601 transitions. Word has length 318 [2024-11-28 02:39:09,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:09,972 INFO L471 AbstractCegarLoop]: Abstraction has 12723 states and 19601 transitions. [2024-11-28 02:39:09,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.6) 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-11-28 02:39:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 12723 states and 19601 transitions. [2024-11-28 02:39:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-28 02:39:09,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:09,995 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-11-28 02:39:09,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:39:09,996 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-11-28 02:39:09,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1324084639, now seen corresponding path program 1 times [2024-11-28 02:39:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:09,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805907066] [2024-11-28 02:39:09,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:09,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:11,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:11,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805907066] [2024-11-28 02:39:11,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805907066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:11,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:11,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:39:11,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198648480] [2024-11-28 02:39:11,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:11,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:39:11,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:11,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:39:11,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:39:11,561 INFO L87 Difference]: Start difference. First operand 12723 states and 19601 transitions. Second operand has 9 states, 9 states have (on average 35.333333333333336) internal successors, (318), 8 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-11-28 02:39:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:15,863 INFO L93 Difference]: Finished difference Result 48084 states and 75073 transitions. [2024-11-28 02:39:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:39:15,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 35.333333333333336) internal successors, (318), 8 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-11-28 02:39:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:15,971 INFO L225 Difference]: With dead ends: 48084 [2024-11-28 02:39:15,972 INFO L226 Difference]: Without dead ends: 37477 [2024-11-28 02:39:15,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:39:15,988 INFO L435 NwaCegarLoop]: 1571 mSDtfsCounter, 11505 mSDsluCounter, 7677 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11505 SdHoareTripleChecker+Valid, 9248 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:15,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11505 Valid, 9248 Invalid, 2716 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [156 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-28 02:39:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37477 states. [2024-11-28 02:39:16,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37477 to 27000. [2024-11-28 02:39:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27000 states, 26988 states have (on average 1.5375722543352601) internal successors, (41496), 26999 states have internal predecessors, (41496), 0 states have call successors, (0), 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-11-28 02:39:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27000 states to 27000 states and 41496 transitions. [2024-11-28 02:39:16,566 INFO L78 Accepts]: Start accepts. Automaton has 27000 states and 41496 transitions. Word has length 318 [2024-11-28 02:39:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:16,568 INFO L471 AbstractCegarLoop]: Abstraction has 27000 states and 41496 transitions. [2024-11-28 02:39:16,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.333333333333336) internal successors, (318), 8 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-11-28 02:39:16,569 INFO L276 IsEmpty]: Start isEmpty. Operand 27000 states and 41496 transitions. [2024-11-28 02:39:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-28 02:39:16,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:16,599 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-11-28 02:39:16,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:39:16,600 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-11-28 02:39:16,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2063846249, now seen corresponding path program 1 times [2024-11-28 02:39:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:16,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094254062] [2024-11-28 02:39:16,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:16,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:17,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:17,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094254062] [2024-11-28 02:39:17,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094254062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:17,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:17,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:39:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619895945] [2024-11-28 02:39:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:17,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:39:17,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:17,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:39:17,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:39:17,992 INFO L87 Difference]: Start difference. First operand 27000 states and 41496 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-11-28 02:39:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:18,481 INFO L93 Difference]: Finished difference Result 42111 states and 66167 transitions. [2024-11-28 02:39:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:39:18,482 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-11-28 02:39:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:18,576 INFO L225 Difference]: With dead ends: 42111 [2024-11-28 02:39:18,576 INFO L226 Difference]: Without dead ends: 30334 [2024-11-28 02:39:18,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-28 02:39:18,597 INFO L435 NwaCegarLoop]: 1689 mSDtfsCounter, 1571 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 3188 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:18,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 3188 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:39:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30334 states. [2024-11-28 02:39:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30334 to 30332. [2024-11-28 02:39:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30332 states, 30320 states have (on average 1.5443931398416886) internal successors, (46826), 30331 states have internal predecessors, (46826), 0 states have call successors, (0), 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-11-28 02:39:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30332 states to 30332 states and 46826 transitions. [2024-11-28 02:39:19,360 INFO L78 Accepts]: Start accepts. Automaton has 30332 states and 46826 transitions. Word has length 318 [2024-11-28 02:39:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:19,361 INFO L471 AbstractCegarLoop]: Abstraction has 30332 states and 46826 transitions. [2024-11-28 02:39:19,361 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-11-28 02:39:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 30332 states and 46826 transitions. [2024-11-28 02:39:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-28 02:39:19,397 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:19,398 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-11-28 02:39:19,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:39:19,398 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-28 02:39:19,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:19,400 INFO L85 PathProgramCache]: Analyzing trace with hash -263589182, now seen corresponding path program 1 times [2024-11-28 02:39:19,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:19,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241505739] [2024-11-28 02:39:19,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:19,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:19,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:19,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241505739] [2024-11-28 02:39:19,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241505739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:19,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:19,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:19,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315323138] [2024-11-28 02:39:19,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:19,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:19,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:19,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:19,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:19,761 INFO L87 Difference]: Start difference. First operand 30332 states and 46826 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-11-28 02:39:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:20,231 INFO L93 Difference]: Finished difference Result 72069 states and 112662 transitions. [2024-11-28 02:39:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:20,231 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-11-28 02:39:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:20,381 INFO L225 Difference]: With dead ends: 72069 [2024-11-28 02:39:20,382 INFO L226 Difference]: Without dead ends: 55227 [2024-11-28 02:39:20,407 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-11-28 02:39:20,407 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 763 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:20,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 2682 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:39:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55227 states. [2024-11-28 02:39:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55227 to 55057. [2024-11-28 02:39:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55057 states, 55045 states have (on average 1.546098646561904) internal successors, (85105), 55056 states have internal predecessors, (85105), 0 states have call successors, (0), 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-11-28 02:39:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55057 states to 55057 states and 85105 transitions. [2024-11-28 02:39:21,785 INFO L78 Accepts]: Start accepts. Automaton has 55057 states and 85105 transitions. Word has length 318 [2024-11-28 02:39:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:21,787 INFO L471 AbstractCegarLoop]: Abstraction has 55057 states and 85105 transitions. [2024-11-28 02:39:21,789 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-11-28 02:39:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 55057 states and 85105 transitions. [2024-11-28 02:39:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-28 02:39:21,821 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:21,822 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-11-28 02:39:21,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:39:21,822 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-28 02:39:21,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:21,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1325725144, now seen corresponding path program 1 times [2024-11-28 02:39:21,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:21,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776134011] [2024-11-28 02:39:21,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:21,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:23,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:23,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776134011] [2024-11-28 02:39:23,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776134011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:23,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:23,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:39:23,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727031424] [2024-11-28 02:39:23,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:23,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:39:23,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:23,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:39:23,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:39:23,466 INFO L87 Difference]: Start difference. First operand 55057 states and 85105 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-11-28 02:39:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:25,157 INFO L93 Difference]: Finished difference Result 270491 states and 418109 transitions. [2024-11-28 02:39:25,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:39:25,158 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-11-28 02:39:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:26,011 INFO L225 Difference]: With dead ends: 270491 [2024-11-28 02:39:26,011 INFO L226 Difference]: Without dead ends: 215502 [2024-11-28 02:39:26,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:26,059 INFO L435 NwaCegarLoop]: 2496 mSDtfsCounter, 4348 mSDsluCounter, 3844 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4348 SdHoareTripleChecker+Valid, 6340 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:26,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4348 Valid, 6340 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:39:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215502 states. [2024-11-28 02:39:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215502 to 107631. [2024-11-28 02:39:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107631 states, 107619 states have (on average 1.5377860786664066) internal successors, (165495), 107630 states have internal predecessors, (165495), 0 states have call successors, (0), 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-11-28 02:39:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107631 states to 107631 states and 165495 transitions. [2024-11-28 02:39:29,079 INFO L78 Accepts]: Start accepts. Automaton has 107631 states and 165495 transitions. Word has length 318 [2024-11-28 02:39:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:29,079 INFO L471 AbstractCegarLoop]: Abstraction has 107631 states and 165495 transitions. [2024-11-28 02:39:29,080 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-11-28 02:39:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 107631 states and 165495 transitions. [2024-11-28 02:39:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-11-28 02:39:29,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:29,140 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-11-28 02:39:29,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:39:29,141 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2024-11-28 02:39:29,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:29,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2001261169, now seen corresponding path program 1 times [2024-11-28 02:39:29,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:29,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057053696] [2024-11-28 02:39:29,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:29,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:29,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:29,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057053696] [2024-11-28 02:39:29,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057053696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:29,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414200670] [2024-11-28 02:39:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:29,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:29,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:29,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:29,729 INFO L87 Difference]: Start difference. First operand 107631 states and 165495 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 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-11-28 02:39:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:31,619 INFO L93 Difference]: Finished difference Result 316306 states and 486003 transitions. [2024-11-28 02:39:31,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:31,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 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-11-28 02:39:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:31,976 INFO L225 Difference]: With dead ends: 316306 [2024-11-28 02:39:31,976 INFO L226 Difference]: Without dead ends: 210160 [2024-11-28 02:39:32,040 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-11-28 02:39:32,042 INFO L435 NwaCegarLoop]: 2432 mSDtfsCounter, 1293 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 3810 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-11-28 02:39:32,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 3810 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:39:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210160 states. [2024-11-28 02:39:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210160 to 209993. [2024-11-28 02:39:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209993 states, 209981 states have (on average 1.5285668703358875) internal successors, (320970), 209992 states have internal predecessors, (320970), 0 states have call successors, (0), 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-11-28 02:39:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209993 states to 209993 states and 320970 transitions. [2024-11-28 02:39:36,146 INFO L78 Accepts]: Start accepts. Automaton has 209993 states and 320970 transitions. Word has length 320 [2024-11-28 02:39:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:36,147 INFO L471 AbstractCegarLoop]: Abstraction has 209993 states and 320970 transitions. [2024-11-28 02:39:36,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 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-11-28 02:39:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 209993 states and 320970 transitions. [2024-11-28 02:39:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-11-28 02:39:36,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:36,294 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-11-28 02:39:36,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 02:39:36,296 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-11-28 02:39:36,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:36,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1556297757, now seen corresponding path program 1 times [2024-11-28 02:39:36,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:36,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563991213] [2024-11-28 02:39:36,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:36,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:37,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:37,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563991213] [2024-11-28 02:39:37,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563991213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:37,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:37,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:39:37,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35446323] [2024-11-28 02:39:37,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:37,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:39:37,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:37,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:39:37,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:37,839 INFO L87 Difference]: Start difference. First operand 209993 states and 320970 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-11-28 02:39:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:39:39,988 INFO L93 Difference]: Finished difference Result 610038 states and 931166 transitions. [2024-11-28 02:39:39,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:39:39,989 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-11-28 02:39:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:39:41,399 INFO L225 Difference]: With dead ends: 610038 [2024-11-28 02:39:41,399 INFO L226 Difference]: Without dead ends: 400215 [2024-11-28 02:39:41,547 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-11-28 02:39:41,548 INFO L435 NwaCegarLoop]: 2499 mSDtfsCounter, 1314 mSDsluCounter, 5184 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 7683 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:39:41,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 7683 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:39:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400215 states. [2024-11-28 02:39:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400215 to 400104. [2024-11-28 02:39:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400104 states, 400092 states have (on average 1.5166161782789958) internal successors, (606786), 400103 states have internal predecessors, (606786), 0 states have call successors, (0), 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-11-28 02:39:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400104 states to 400104 states and 606786 transitions. [2024-11-28 02:39:50,911 INFO L78 Accepts]: Start accepts. Automaton has 400104 states and 606786 transitions. Word has length 320 [2024-11-28 02:39:50,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:39:50,912 INFO L471 AbstractCegarLoop]: Abstraction has 400104 states and 606786 transitions. [2024-11-28 02:39:50,912 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-11-28 02:39:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 400104 states and 606786 transitions. [2024-11-28 02:39:51,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-11-28 02:39:51,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:39:51,128 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-11-28 02:39:51,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 02:39:51,128 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-11-28 02:39:51,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:51,129 INFO L85 PathProgramCache]: Analyzing trace with hash 188018774, now seen corresponding path program 1 times [2024-11-28 02:39:51,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:51,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763443853] [2024-11-28 02:39:51,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:51,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:53,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763443853] [2024-11-28 02:39:53,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763443853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:53,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:53,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:39:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916221405] [2024-11-28 02:39:53,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:53,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:39:53,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:53,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:39:53,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:39:53,014 INFO L87 Difference]: Start difference. First operand 400104 states and 606786 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)