./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.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_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 05:49:56,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 05:49:57,010 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 05:49:57,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 05:49:57,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 05:49:57,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 05:49:57,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 05:49:57,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 05:49:57,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 05:49:57,036 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 05:49:57,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 05:49:57,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 05:49:57,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 05:49:57,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 05:49:57,037 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 05:49:57,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 05:49:57,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 05:49:57,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 05:49:57,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 05:49:57,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 05:49:57,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 05:49:57,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 05:49:57,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 05:49:57,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 05:49:57,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 05:49:57,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 05:49:57,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 05:49:57,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 05:49:57,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 05:49:57,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 05:49:57,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 05:49:57,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 05:49:57,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 05:49:57,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 05:49:57,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 05:49:57,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 05:49:57,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 05:49:57,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 05:49:57,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 05:49:57,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 05:49:57,039 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 05:49:57,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 05:49:57,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 05:49:57,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 05:49:57,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 05:49:57,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 05:49:57,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 05:49:57,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 05:49:57,040 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_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 [2024-12-02 05:49:57,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 05:49:57,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 05:49:57,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 05:49:57,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 05:49:57,281 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 05:49:57,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2024-12-02 05:50:00,029 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/data/8e2e92c2f/95d83284efb442749980d0540a8cb423/FLAGa5eaf11c7 [2024-12-02 05:50:00,207 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 05:50:00,208 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2024-12-02 05:50:00,215 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/data/8e2e92c2f/95d83284efb442749980d0540a8cb423/FLAGa5eaf11c7 [2024-12-02 05:50:00,230 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/data/8e2e92c2f/95d83284efb442749980d0540a8cb423 [2024-12-02 05:50:00,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 05:50:00,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 05:50:00,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 05:50:00,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 05:50:00,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 05:50:00,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e6a008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00, skipping insertion in model container [2024-12-02 05:50:00,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 05:50:00,419 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2024-12-02 05:50:00,424 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2024-12-02 05:50:00,426 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2024-12-02 05:50:00,429 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2024-12-02 05:50:00,431 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2024-12-02 05:50:00,433 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2024-12-02 05:50:00,434 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2024-12-02 05:50:00,436 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2024-12-02 05:50:00,438 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2024-12-02 05:50:00,441 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2024-12-02 05:50:00,442 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2024-12-02 05:50:00,445 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2024-12-02 05:50:00,447 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2024-12-02 05:50:00,449 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2024-12-02 05:50:00,451 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2024-12-02 05:50:00,452 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2024-12-02 05:50:00,454 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2024-12-02 05:50:00,455 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2024-12-02 05:50:00,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 05:50:00,469 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 05:50:00,485 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2024-12-02 05:50:00,487 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2024-12-02 05:50:00,488 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2024-12-02 05:50:00,491 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2024-12-02 05:50:00,492 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2024-12-02 05:50:00,494 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2024-12-02 05:50:00,495 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2024-12-02 05:50:00,497 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2024-12-02 05:50:00,498 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2024-12-02 05:50:00,501 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2024-12-02 05:50:00,502 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2024-12-02 05:50:00,506 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2024-12-02 05:50:00,508 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2024-12-02 05:50:00,509 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2024-12-02 05:50:00,512 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2024-12-02 05:50:00,513 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2024-12-02 05:50:00,514 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2024-12-02 05:50:00,516 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_57d75f9c-d2e0-428a-9111-068130fb30d7/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2024-12-02 05:50:00,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 05:50:00,537 INFO L204 MainTranslator]: Completed translation [2024-12-02 05:50:00,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00 WrapperNode [2024-12-02 05:50:00,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 05:50:00,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 05:50:00,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 05:50:00,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 05:50:00,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,582 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 278 [2024-12-02 05:50:00,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 05:50:00,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 05:50:00,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 05:50:00,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 05:50:00,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,613 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 05:50:00,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,618 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,620 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 05:50:00,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 05:50:00,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 05:50:00,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 05:50:00,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (1/1) ... [2024-12-02 05:50:00,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 05:50:00,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 05:50:00,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 05:50:00,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 05:50:00,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 05:50:00,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 05:50:00,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 05:50:00,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 05:50:00,753 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 05:50:00,755 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 05:50:00,982 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-12-02 05:50:00,982 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 05:50:00,993 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 05:50:00,993 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 05:50:00,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:50:00 BoogieIcfgContainer [2024-12-02 05:50:00,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 05:50:00,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 05:50:00,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 05:50:01,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 05:50:01,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:50:00" (1/3) ... [2024-12-02 05:50:01,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d7639e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:50:01, skipping insertion in model container [2024-12-02 05:50:01,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:50:00" (2/3) ... [2024-12-02 05:50:01,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d7639e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:50:01, skipping insertion in model container [2024-12-02 05:50:01,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:50:00" (3/3) ... [2024-12-02 05:50:01,003 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2024-12-02 05:50:01,017 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 05:50:01,018 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-get-tag.i.v+lhb-reducer.c that has 1 procedures, 75 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2024-12-02 05:50:01,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 05:50:01,087 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;@6bf79d69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 05:50:01,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-12-02 05:50:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-02 05:50:01,097 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:01,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:01,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:01,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash 123910062, now seen corresponding path program 1 times [2024-12-02 05:50:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:01,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489421710] [2024-12-02 05:50:01,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:01,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:01,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:01,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489421710] [2024-12-02 05:50:01,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489421710] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:01,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:01,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 05:50:01,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683509148] [2024-12-02 05:50:01,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:01,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 05:50:01,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:01,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 05:50:01,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:50:01,411 INFO L87 Difference]: Start difference. First operand has 75 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 0 states have call successors, (0), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:01,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:01,510 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2024-12-02 05:50:01,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 05:50:01,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-12-02 05:50:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:01,518 INFO L225 Difference]: With dead ends: 81 [2024-12-02 05:50:01,519 INFO L226 Difference]: Without dead ends: 71 [2024-12-02 05:50:01,521 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-12-02 05:50:01,524 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 9 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:01,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 194 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:01,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-12-02 05:50:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-12-02 05:50:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-12-02 05:50:01,553 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2024-12-02 05:50:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:01,553 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-12-02 05:50:01,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-12-02 05:50:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-02 05:50:01,554 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:01,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:01,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 05:50:01,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:01,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:01,555 INFO L85 PathProgramCache]: Analyzing trace with hash 120339118, now seen corresponding path program 1 times [2024-12-02 05:50:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:01,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098557551] [2024-12-02 05:50:01,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:01,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:01,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:01,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098557551] [2024-12-02 05:50:01,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098557551] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:01,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:01,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 05:50:01,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906511233] [2024-12-02 05:50:01,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:01,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 05:50:01,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:01,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 05:50:01,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:50:01,663 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:01,727 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-12-02 05:50:01,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 05:50:01,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-12-02 05:50:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:01,728 INFO L225 Difference]: With dead ends: 71 [2024-12-02 05:50:01,728 INFO L226 Difference]: Without dead ends: 69 [2024-12-02 05:50:01,728 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-12-02 05:50:01,729 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:01,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 164 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:50:01,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-12-02 05:50:01,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-12-02 05:50:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.392156862745098) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-12-02 05:50:01,734 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2024-12-02 05:50:01,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:01,734 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-12-02 05:50:01,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-12-02 05:50:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-02 05:50:01,735 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:01,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:01,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 05:50:01,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:01,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:01,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2031737892, now seen corresponding path program 1 times [2024-12-02 05:50:01,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:01,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867624958] [2024-12-02 05:50:01,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:01,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:01,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:01,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867624958] [2024-12-02 05:50:01,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867624958] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:01,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:01,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 05:50:01,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763912696] [2024-12-02 05:50:01,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:01,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 05:50:01,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:01,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 05:50:01,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 05:50:01,825 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:01,926 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-12-02 05:50:01,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 05:50:01,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-12-02 05:50:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:01,927 INFO L225 Difference]: With dead ends: 69 [2024-12-02 05:50:01,928 INFO L226 Difference]: Without dead ends: 67 [2024-12-02 05:50:01,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:01,929 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:01,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 129 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-12-02 05:50:01,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2024-12-02 05:50:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.38) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-12-02 05:50:01,934 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2024-12-02 05:50:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:01,934 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-12-02 05:50:01,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-12-02 05:50:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-02 05:50:01,935 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:01,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:01,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 05:50:01,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:01,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1271153903, now seen corresponding path program 1 times [2024-12-02 05:50:01,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:01,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167241628] [2024-12-02 05:50:01,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:01,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:02,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:02,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167241628] [2024-12-02 05:50:02,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167241628] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:02,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:02,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 05:50:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684748856] [2024-12-02 05:50:02,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:02,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 05:50:02,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:02,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 05:50:02,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 05:50:02,006 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:02,101 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-12-02 05:50:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 05:50:02,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-12-02 05:50:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:02,103 INFO L225 Difference]: With dead ends: 67 [2024-12-02 05:50:02,103 INFO L226 Difference]: Without dead ends: 65 [2024-12-02 05:50:02,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:02,104 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 44 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:02,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 123 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-12-02 05:50:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-12-02 05:50:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-12-02 05:50:02,108 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2024-12-02 05:50:02,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:02,109 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-12-02 05:50:02,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,109 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-12-02 05:50:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-02 05:50:02,109 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:02,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:02,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 05:50:02,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:02,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:02,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1440630601, now seen corresponding path program 1 times [2024-12-02 05:50:02,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:02,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941290142] [2024-12-02 05:50:02,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:02,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:02,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941290142] [2024-12-02 05:50:02,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941290142] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:02,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:02,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 05:50:02,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124062868] [2024-12-02 05:50:02,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:02,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 05:50:02,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:02,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 05:50:02,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:50:02,167 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:02,216 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-12-02 05:50:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 05:50:02,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-12-02 05:50:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:02,217 INFO L225 Difference]: With dead ends: 65 [2024-12-02 05:50:02,218 INFO L226 Difference]: Without dead ends: 61 [2024-12-02 05:50:02,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:50:02,219 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:02,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 140 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:50:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-12-02 05:50:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2024-12-02 05:50:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-12-02 05:50:02,223 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2024-12-02 05:50:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:02,223 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-12-02 05:50:02,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-12-02 05:50:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-02 05:50:02,224 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:02,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:02,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 05:50:02,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:02,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:02,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1440142029, now seen corresponding path program 1 times [2024-12-02 05:50:02,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:02,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014696276] [2024-12-02 05:50:02,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:02,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:02,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:02,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014696276] [2024-12-02 05:50:02,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014696276] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:02,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:02,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 05:50:02,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603621206] [2024-12-02 05:50:02,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:02,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 05:50:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:02,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 05:50:02,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 05:50:02,287 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:02,361 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-12-02 05:50:02,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 05:50:02,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-12-02 05:50:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:02,362 INFO L225 Difference]: With dead ends: 61 [2024-12-02 05:50:02,362 INFO L226 Difference]: Without dead ends: 59 [2024-12-02 05:50:02,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:02,363 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:02,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 109 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-12-02 05:50:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-12-02 05:50:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-12-02 05:50:02,367 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2024-12-02 05:50:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:02,367 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-12-02 05:50:02,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-12-02 05:50:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-02 05:50:02,368 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:02,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:02,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 05:50:02,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:02,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:02,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1440126141, now seen corresponding path program 1 times [2024-12-02 05:50:02,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:02,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41510176] [2024-12-02 05:50:02,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:02,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:02,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:02,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41510176] [2024-12-02 05:50:02,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41510176] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:02,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:02,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 05:50:02,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117145638] [2024-12-02 05:50:02,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:02,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 05:50:02,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:02,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 05:50:02,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 05:50:02,429 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:02,500 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2024-12-02 05:50:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 05:50:02,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-12-02 05:50:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:02,501 INFO L225 Difference]: With dead ends: 59 [2024-12-02 05:50:02,501 INFO L226 Difference]: Without dead ends: 57 [2024-12-02 05:50:02,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:02,502 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 38 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:02,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 103 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-12-02 05:50:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-12-02 05:50:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-12-02 05:50:02,505 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2024-12-02 05:50:02,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:02,505 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-12-02 05:50:02,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-12-02 05:50:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-02 05:50:02,506 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:02,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:02,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 05:50:02,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:02,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:02,507 INFO L85 PathProgramCache]: Analyzing trace with hash -751061257, now seen corresponding path program 1 times [2024-12-02 05:50:02,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:02,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556239988] [2024-12-02 05:50:02,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:02,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:02,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556239988] [2024-12-02 05:50:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556239988] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:02,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:02,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 05:50:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628364707] [2024-12-02 05:50:02,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:02,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 05:50:02,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:02,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 05:50:02,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:50:02,564 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:02,602 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2024-12-02 05:50:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 05:50:02,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-12-02 05:50:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:02,603 INFO L225 Difference]: With dead ends: 57 [2024-12-02 05:50:02,603 INFO L226 Difference]: Without dead ends: 53 [2024-12-02 05:50:02,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:50:02,603 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:02,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 120 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:50:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-12-02 05:50:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-12-02 05:50:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-12-02 05:50:02,607 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2024-12-02 05:50:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:02,607 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-12-02 05:50:02,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-12-02 05:50:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-02 05:50:02,608 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:02,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:02,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 05:50:02,608 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:02,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:02,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1694725733, now seen corresponding path program 1 times [2024-12-02 05:50:02,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:02,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069302717] [2024-12-02 05:50:02,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:02,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:02,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:02,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069302717] [2024-12-02 05:50:02,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069302717] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:02,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:02,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 05:50:02,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992078109] [2024-12-02 05:50:02,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:02,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 05:50:02,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:02,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 05:50:02,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:02,750 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:02,831 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-12-02 05:50:02,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 05:50:02,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-12-02 05:50:02,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:02,833 INFO L225 Difference]: With dead ends: 85 [2024-12-02 05:50:02,833 INFO L226 Difference]: Without dead ends: 83 [2024-12-02 05:50:02,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 05:50:02,834 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:02,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 117 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-12-02 05:50:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2024-12-02 05:50:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-12-02 05:50:02,839 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2024-12-02 05:50:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:02,839 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-12-02 05:50:02,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-12-02 05:50:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-02 05:50:02,840 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:02,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:02,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 05:50:02,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:02,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:02,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1694233189, now seen corresponding path program 1 times [2024-12-02 05:50:02,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:02,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117465869] [2024-12-02 05:50:02,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:02,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:02,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:02,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117465869] [2024-12-02 05:50:02,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117465869] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:02,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:02,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 05:50:02,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422844830] [2024-12-02 05:50:02,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:02,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 05:50:02,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:02,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 05:50:02,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:02,963 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:03,046 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2024-12-02 05:50:03,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 05:50:03,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-12-02 05:50:03,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:03,048 INFO L225 Difference]: With dead ends: 83 [2024-12-02 05:50:03,048 INFO L226 Difference]: Without dead ends: 81 [2024-12-02 05:50:03,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 05:50:03,049 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:03,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 117 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-12-02 05:50:03,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 58. [2024-12-02 05:50:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-12-02 05:50:03,053 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 13 [2024-12-02 05:50:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:03,053 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-12-02 05:50:03,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-12-02 05:50:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-02 05:50:03,053 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:03,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:03,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 05:50:03,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:03,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:03,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1791008026, now seen corresponding path program 1 times [2024-12-02 05:50:03,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:03,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812718629] [2024-12-02 05:50:03,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:03,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:03,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:03,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812718629] [2024-12-02 05:50:03,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812718629] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:03,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:03,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 05:50:03,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078554988] [2024-12-02 05:50:03,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:03,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 05:50:03,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:03,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 05:50:03,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 05:50:03,112 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:03,182 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-12-02 05:50:03,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 05:50:03,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-12-02 05:50:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:03,183 INFO L225 Difference]: With dead ends: 59 [2024-12-02 05:50:03,183 INFO L226 Difference]: Without dead ends: 57 [2024-12-02 05:50:03,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:03,184 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:03,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 89 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-12-02 05:50:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2024-12-02 05:50:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-12-02 05:50:03,187 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2024-12-02 05:50:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:03,187 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-12-02 05:50:03,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-12-02 05:50:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-02 05:50:03,188 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:03,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:03,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 05:50:03,188 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:03,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1789284122, now seen corresponding path program 1 times [2024-12-02 05:50:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63101157] [2024-12-02 05:50:03,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:03,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:03,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63101157] [2024-12-02 05:50:03,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63101157] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:03,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:03,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 05:50:03,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729793245] [2024-12-02 05:50:03,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:03,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 05:50:03,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:03,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 05:50:03,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 05:50:03,254 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:03,313 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-12-02 05:50:03,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 05:50:03,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-12-02 05:50:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:03,313 INFO L225 Difference]: With dead ends: 57 [2024-12-02 05:50:03,313 INFO L226 Difference]: Without dead ends: 55 [2024-12-02 05:50:03,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:03,314 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:03,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 83 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:50:03,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-12-02 05:50:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-12-02 05:50:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2024-12-02 05:50:03,317 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2024-12-02 05:50:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:03,317 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2024-12-02 05:50:03,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2024-12-02 05:50:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-02 05:50:03,318 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:03,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:03,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 05:50:03,318 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:03,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash 313330138, now seen corresponding path program 1 times [2024-12-02 05:50:03,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:03,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139088377] [2024-12-02 05:50:03,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:03,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:03,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:03,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139088377] [2024-12-02 05:50:03,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139088377] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:03,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:03,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 05:50:03,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081413369] [2024-12-02 05:50:03,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:03,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 05:50:03,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:03,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 05:50:03,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:03,430 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:03,499 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2024-12-02 05:50:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 05:50:03,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-12-02 05:50:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:03,500 INFO L225 Difference]: With dead ends: 73 [2024-12-02 05:50:03,500 INFO L226 Difference]: Without dead ends: 71 [2024-12-02 05:50:03,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 05:50:03,501 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:03,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 104 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-12-02 05:50:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2024-12-02 05:50:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-12-02 05:50:03,504 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 14 [2024-12-02 05:50:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:03,504 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-12-02 05:50:03,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-12-02 05:50:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-02 05:50:03,505 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:03,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:03,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 05:50:03,505 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:03,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:03,505 INFO L85 PathProgramCache]: Analyzing trace with hash 314877283, now seen corresponding path program 1 times [2024-12-02 05:50:03,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:03,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777457669] [2024-12-02 05:50:03,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:03,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:03,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:03,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777457669] [2024-12-02 05:50:03,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777457669] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:03,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:03,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 05:50:03,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421852742] [2024-12-02 05:50:03,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:03,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 05:50:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:03,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 05:50:03,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 05:50:03,556 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:03,609 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2024-12-02 05:50:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 05:50:03,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-12-02 05:50:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:03,609 INFO L225 Difference]: With dead ends: 60 [2024-12-02 05:50:03,609 INFO L226 Difference]: Without dead ends: 58 [2024-12-02 05:50:03,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:03,610 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:03,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 77 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:50:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-12-02 05:50:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-12-02 05:50:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-12-02 05:50:03,613 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 14 [2024-12-02 05:50:03,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:03,613 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-12-02 05:50:03,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2024-12-02 05:50:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-02 05:50:03,613 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:03,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:03,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 05:50:03,614 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:03,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:03,614 INFO L85 PathProgramCache]: Analyzing trace with hash 366771218, now seen corresponding path program 1 times [2024-12-02 05:50:03,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:03,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579093349] [2024-12-02 05:50:03,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:03,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:03,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579093349] [2024-12-02 05:50:03,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579093349] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:03,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:03,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 05:50:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768677728] [2024-12-02 05:50:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:03,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 05:50:03,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:03,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 05:50:03,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:03,734 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:03,800 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-12-02 05:50:03,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 05:50:03,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-12-02 05:50:03,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:03,801 INFO L225 Difference]: With dead ends: 70 [2024-12-02 05:50:03,801 INFO L226 Difference]: Without dead ends: 66 [2024-12-02 05:50:03,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:03,801 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:03,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 96 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:03,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-12-02 05:50:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2024-12-02 05:50:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-12-02 05:50:03,806 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2024-12-02 05:50:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:03,806 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-12-02 05:50:03,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-12-02 05:50:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-02 05:50:03,807 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:03,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:03,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 05:50:03,808 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:03,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:03,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1171265312, now seen corresponding path program 1 times [2024-12-02 05:50:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:03,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265455285] [2024-12-02 05:50:03,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:03,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:03,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:03,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265455285] [2024-12-02 05:50:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265455285] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:03,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:03,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 05:50:03,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178839975] [2024-12-02 05:50:03,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:03,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 05:50:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:03,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 05:50:03,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:03,933 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:04,009 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-12-02 05:50:04,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 05:50:04,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-12-02 05:50:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:04,010 INFO L225 Difference]: With dead ends: 66 [2024-12-02 05:50:04,010 INFO L226 Difference]: Without dead ends: 64 [2024-12-02 05:50:04,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 05:50:04,011 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:04,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 100 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-12-02 05:50:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-12-02 05:50:04,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 61 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-12-02 05:50:04,014 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 15 [2024-12-02 05:50:04,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:04,014 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-12-02 05:50:04,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-12-02 05:50:04,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-02 05:50:04,015 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:04,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:04,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 05:50:04,015 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:04,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:04,016 INFO L85 PathProgramCache]: Analyzing trace with hash 462679229, now seen corresponding path program 1 times [2024-12-02 05:50:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:04,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899249024] [2024-12-02 05:50:04,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:04,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:04,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899249024] [2024-12-02 05:50:04,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899249024] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:04,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:04,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 05:50:04,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296022726] [2024-12-02 05:50:04,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:04,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 05:50:04,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:04,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 05:50:04,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:50:04,067 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:04,098 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2024-12-02 05:50:04,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 05:50:04,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-12-02 05:50:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:04,099 INFO L225 Difference]: With dead ends: 62 [2024-12-02 05:50:04,099 INFO L226 Difference]: Without dead ends: 60 [2024-12-02 05:50:04,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 05:50:04,100 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 28 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:04,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 72 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:50:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-12-02 05:50:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-12-02 05:50:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-12-02 05:50:04,103 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 16 [2024-12-02 05:50:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:04,103 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-12-02 05:50:04,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-12-02 05:50:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-02 05:50:04,103 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:04,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:04,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 05:50:04,104 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:04,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:04,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1458158324, now seen corresponding path program 1 times [2024-12-02 05:50:04,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:04,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204561660] [2024-12-02 05:50:04,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:04,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:04,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:04,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204561660] [2024-12-02 05:50:04,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204561660] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:04,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:04,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 05:50:04,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526189893] [2024-12-02 05:50:04,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:04,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 05:50:04,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:04,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 05:50:04,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:50:04,155 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:04,187 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2024-12-02 05:50:04,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 05:50:04,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-12-02 05:50:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:04,188 INFO L225 Difference]: With dead ends: 60 [2024-12-02 05:50:04,188 INFO L226 Difference]: Without dead ends: 56 [2024-12-02 05:50:04,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 05:50:04,189 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:04,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 90 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:50:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-12-02 05:50:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-12-02 05:50:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-12-02 05:50:04,191 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 17 [2024-12-02 05:50:04,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:04,191 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-12-02 05:50:04,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-12-02 05:50:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-02 05:50:04,192 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:04,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:04,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 05:50:04,192 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:04,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:04,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1747922500, now seen corresponding path program 1 times [2024-12-02 05:50:04,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:04,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130720786] [2024-12-02 05:50:04,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:04,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:04,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:04,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130720786] [2024-12-02 05:50:04,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130720786] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 05:50:04,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151047882] [2024-12-02 05:50:04,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:04,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 05:50:04,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 05:50:04,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 05:50:04,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 05:50:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:04,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 05:50:04,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 05:50:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:04,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 05:50:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 05:50:04,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151047882] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 05:50:04,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 05:50:04,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2024-12-02 05:50:04,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720289036] [2024-12-02 05:50:04,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 05:50:04,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 05:50:04,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:04,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 05:50:04,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-12-02 05:50:04,754 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:04,930 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2024-12-02 05:50:04,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 05:50:04,931 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 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 18 [2024-12-02 05:50:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:04,931 INFO L225 Difference]: With dead ends: 83 [2024-12-02 05:50:04,931 INFO L226 Difference]: Without dead ends: 81 [2024-12-02 05:50:04,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2024-12-02 05:50:04,932 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 101 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:04,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 101 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-12-02 05:50:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 52. [2024-12-02 05:50:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-12-02 05:50:04,934 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 18 [2024-12-02 05:50:04,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:04,934 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-12-02 05:50:04,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-12-02 05:50:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-02 05:50:04,935 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:04,935 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:04,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 05:50:05,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 05:50:05,135 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:05,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:05,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1748415044, now seen corresponding path program 1 times [2024-12-02 05:50:05,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:05,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000220263] [2024-12-02 05:50:05,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:05,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:05,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000220263] [2024-12-02 05:50:05,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000220263] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 05:50:05,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22834708] [2024-12-02 05:50:05,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:05,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 05:50:05,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 05:50:05,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 05:50:05,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 05:50:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:05,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 05:50:05,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 05:50:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:05,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 05:50:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 05:50:05,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22834708] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 05:50:05,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 05:50:05,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2024-12-02 05:50:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137400698] [2024-12-02 05:50:05,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 05:50:05,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 05:50:05,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:05,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 05:50:05,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-12-02 05:50:05,563 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:05,741 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2024-12-02 05:50:05,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 05:50:05,741 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 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 18 [2024-12-02 05:50:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:05,742 INFO L225 Difference]: With dead ends: 79 [2024-12-02 05:50:05,742 INFO L226 Difference]: Without dead ends: 77 [2024-12-02 05:50:05,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2024-12-02 05:50:05,743 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 209 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:05,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 108 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 05:50:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-12-02 05:50:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 45. [2024-12-02 05:50:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-12-02 05:50:05,746 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2024-12-02 05:50:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:05,746 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-12-02 05:50:05,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-12-02 05:50:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-02 05:50:05,747 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:05,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:05,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 05:50:05,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 05:50:05,947 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:05,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2026613132, now seen corresponding path program 1 times [2024-12-02 05:50:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:05,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76129956] [2024-12-02 05:50:05,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:05,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:06,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:06,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76129956] [2024-12-02 05:50:06,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76129956] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:06,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:06,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 05:50:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785448536] [2024-12-02 05:50:06,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:06,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 05:50:06,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:06,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 05:50:06,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 05:50:06,026 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:06,083 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-12-02 05:50:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 05:50:06,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-12-02 05:50:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:06,084 INFO L225 Difference]: With dead ends: 45 [2024-12-02 05:50:06,084 INFO L226 Difference]: Without dead ends: 43 [2024-12-02 05:50:06,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-12-02 05:50:06,085 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 47 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:06,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 38 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:50:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-12-02 05:50:06,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-12-02 05:50:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-12-02 05:50:06,087 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2024-12-02 05:50:06,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:06,088 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-12-02 05:50:06,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-12-02 05:50:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-02 05:50:06,088 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:06,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:06,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 05:50:06,088 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:06,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:06,089 INFO L85 PathProgramCache]: Analyzing trace with hash -684716563, now seen corresponding path program 1 times [2024-12-02 05:50:06,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:06,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987642341] [2024-12-02 05:50:06,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:06,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:06,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987642341] [2024-12-02 05:50:06,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987642341] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:06,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:06,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 05:50:06,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554830329] [2024-12-02 05:50:06,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:06,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 05:50:06,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:06,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 05:50:06,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 05:50:06,185 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:06,235 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-12-02 05:50:06,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 05:50:06,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-12-02 05:50:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:06,236 INFO L225 Difference]: With dead ends: 40 [2024-12-02 05:50:06,236 INFO L226 Difference]: Without dead ends: 38 [2024-12-02 05:50:06,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-12-02 05:50:06,238 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:06,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 31 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:50:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-12-02 05:50:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-12-02 05:50:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-12-02 05:50:06,240 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2024-12-02 05:50:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:06,241 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-12-02 05:50:06,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-12-02 05:50:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-02 05:50:06,241 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 05:50:06,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:06,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 05:50:06,241 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-12-02 05:50:06,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 05:50:06,242 INFO L85 PathProgramCache]: Analyzing trace with hash -631275483, now seen corresponding path program 1 times [2024-12-02 05:50:06,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 05:50:06,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397972275] [2024-12-02 05:50:06,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 05:50:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 05:50:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 05:50:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 05:50:06,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 05:50:06,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397972275] [2024-12-02 05:50:06,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397972275] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 05:50:06,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 05:50:06,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 05:50:06,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878067911] [2024-12-02 05:50:06,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 05:50:06,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 05:50:06,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 05:50:06,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 05:50:06,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 05:50:06,343 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 05:50:06,392 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-12-02 05:50:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 05:50:06,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-12-02 05:50:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 05:50:06,393 INFO L225 Difference]: With dead ends: 35 [2024-12-02 05:50:06,393 INFO L226 Difference]: Without dead ends: 0 [2024-12-02 05:50:06,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 05:50:06,394 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 05:50:06,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 25 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 05:50:06,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-12-02 05:50:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-12-02 05:50:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-12-02 05:50:06,395 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2024-12-02 05:50:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 05:50:06,395 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-12-02 05:50:06,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 05:50:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-12-02 05:50:06,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-02 05:50:06,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2024-12-02 05:50:06,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2024-12-02 05:50:06,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2024-12-02 05:50:06,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2024-12-02 05:50:06,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2024-12-02 05:50:06,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2024-12-02 05:50:06,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2024-12-02 05:50:06,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2024-12-02 05:50:06,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2024-12-02 05:50:06,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2024-12-02 05:50:06,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2024-12-02 05:50:06,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2024-12-02 05:50:06,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2024-12-02 05:50:06,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2024-12-02 05:50:06,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2024-12-02 05:50:06,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2024-12-02 05:50:06,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2024-12-02 05:50:06,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2024-12-02 05:50:06,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 05:50:06,403 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 05:50:06,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-12-02 05:50:06,409 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 05:50:06,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:50:06 BoogieIcfgContainer [2024-12-02 05:50:06,415 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 05:50:06,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 05:50:06,416 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 05:50:06,416 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 05:50:06,417 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:50:00" (3/4) ... [2024-12-02 05:50:06,419 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-02 05:50:06,429 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-12-02 05:50:06,429 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-02 05:50:06,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-02 05:50:06,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-02 05:50:06,506 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 05:50:06,506 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 05:50:06,507 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 05:50:06,507 INFO L158 Benchmark]: Toolchain (without parser) took 6273.66ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 117.1MB in the beginning and 104.2MB in the end (delta: 12.9MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2024-12-02 05:50:06,508 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 72.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 05:50:06,508 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.90ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 103.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 05:50:06,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.79ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 101.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 05:50:06,509 INFO L158 Benchmark]: Boogie Preprocessor took 44.80ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 99.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 05:50:06,509 INFO L158 Benchmark]: RCFGBuilder took 364.88ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 82.0MB in the end (delta: 17.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 05:50:06,509 INFO L158 Benchmark]: TraceAbstraction took 5420.14ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 81.5MB in the beginning and 109.6MB in the end (delta: -28.1MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-12-02 05:50:06,509 INFO L158 Benchmark]: Witness Printer took 90.57ms. Allocated memory is still 176.2MB. Free memory was 109.6MB in the beginning and 104.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 05:50:06,511 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 72.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.90ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 103.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.79ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 101.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.80ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 99.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 364.88ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 82.0MB in the end (delta: 17.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5420.14ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 81.5MB in the beginning and 109.6MB in the end (delta: -28.1MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Witness Printer took 90.57ms. Allocated memory is still 176.2MB. Free memory was 109.6MB in the beginning and 104.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 52]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 72]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 84]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 114]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 126]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 142]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 154]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 176]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 188]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 224]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 236]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 278]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 297]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 309]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 333]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 345]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 366]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 378]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 75 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 919 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 919 mSDsluCounter, 2330 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1561 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1799 IncrementalHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 769 mSDtfsCounter, 1799 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 155 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 1472 SizeOfPredicates, 6 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-12-02 05:50:06,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d75f9c-d2e0-428a-9111-068130fb30d7/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE