./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c74f92ba3d978b3a2efb098ebc8eb373bc42abebaabf8c6efaf148fbe05036e0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:48:39,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:48:39,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:48:39,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:48:39,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:48:39,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:48:39,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:48:39,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:48:39,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:48:39,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:48:39,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:48:39,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:48:39,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:48:39,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:48:39,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:48:39,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:48:39,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:48:39,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:48:39,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:48:39,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:48:39,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:48:39,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:48:39,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:48:39,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:48:39,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:48:39,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:48:39,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:48:39,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:48:39,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:48:39,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:48:39,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:48:39,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:48:39,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:48:39,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:48:39,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:48:39,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:48:39,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:48:39,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:48:39,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:48:39,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:48:39,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:48:39,599 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:48:39,636 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:48:39,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:48:39,638 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:48:39,638 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:48:39,639 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:48:39,639 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:48:39,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:48:39,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:48:39,640 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:48:39,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:48:39,642 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:48:39,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:48:39,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:48:39,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:48:39,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:48:39,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:48:39,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:48:39,643 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:48:39,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:48:39,643 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:48:39,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:48:39,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:48:39,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:48:39,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:48:39,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:48:39,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:48:39,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:48:39,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:48:39,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:48:39,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:48:39,645 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:48:39,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:48:39,646 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:48:39,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:48:39,646 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c74f92ba3d978b3a2efb098ebc8eb373bc42abebaabf8c6efaf148fbe05036e0 [2022-11-25 16:48:39,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:48:40,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:48:40,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:48:40,005 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:48:40,006 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:48:40,007 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2022-11-25 16:48:43,013 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:48:43,412 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:48:43,413 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2022-11-25 16:48:43,431 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/data/4511a4947/e36ad6dabc954b3b8ddbf94e7ccf9ae9/FLAG35939f414 [2022-11-25 16:48:43,445 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/data/4511a4947/e36ad6dabc954b3b8ddbf94e7ccf9ae9 [2022-11-25 16:48:43,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:48:43,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:48:43,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:48:43,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:48:43,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:48:43,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:48:43" (1/1) ... [2022-11-25 16:48:43,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20913f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:43, skipping insertion in model container [2022-11-25 16:48:43,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:48:43" (1/1) ... [2022-11-25 16:48:43,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:48:43,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:48:43,940 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18857,18870] [2022-11-25 16:48:43,983 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25957,25970] [2022-11-25 16:48:44,004 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29482,29495] [2022-11-25 16:48:44,022 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32880,32893] [2022-11-25 16:48:44,041 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36938,36951] [2022-11-25 16:48:44,058 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40412,40425] [2022-11-25 16:48:44,088 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43977,43990] [2022-11-25 16:48:44,110 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47412,47425] [2022-11-25 16:48:44,146 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[51091,51104] [2022-11-25 16:48:44,169 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54693,54706] [2022-11-25 16:48:44,195 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58222,58235] [2022-11-25 16:48:44,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:48:44,290 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:48:44,478 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18857,18870] [2022-11-25 16:48:44,526 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25957,25970] [2022-11-25 16:48:44,552 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29482,29495] [2022-11-25 16:48:44,582 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32880,32893] [2022-11-25 16:48:44,613 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36938,36951] [2022-11-25 16:48:44,634 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40412,40425] [2022-11-25 16:48:44,656 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43977,43990] [2022-11-25 16:48:44,678 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47412,47425] [2022-11-25 16:48:44,690 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[51091,51104] [2022-11-25 16:48:44,704 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54693,54706] [2022-11-25 16:48:44,715 WARN L237 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_c5bbeac8-2019-417f-8a98-725c72a280a8/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58222,58235] [2022-11-25 16:48:44,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:48:44,764 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:48:44,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44 WrapperNode [2022-11-25 16:48:44,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:48:44,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:48:44,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:48:44,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:48:44,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44" (1/1) ... [2022-11-25 16:48:44,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44" (1/1) ... [2022-11-25 16:48:44,904 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2770 [2022-11-25 16:48:44,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:48:44,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:48:44,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:48:44,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:48:44,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44" (1/1) ... [2022-11-25 16:48:44,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44" (1/1) ... [2022-11-25 16:48:44,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44" (1/1) ... [2022-11-25 16:48:44,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44" (1/1) ... [2022-11-25 16:48:44,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44" (1/1) ... [2022-11-25 16:48:44,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44" (1/1) ... [2022-11-25 16:48:44,964 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44" (1/1) ... [2022-11-25 16:48:44,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44" (1/1) ... [2022-11-25 16:48:44,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:48:44,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:48:44,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:48:44,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:48:44,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44" (1/1) ... [2022-11-25 16:48:44,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:48:45,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:48:45,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:48:45,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:48:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:48:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:48:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:48:45,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:48:45,352 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:48:45,355 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:48:47,136 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:48:47,163 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:48:47,163 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:48:47,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:48:47 BoogieIcfgContainer [2022-11-25 16:48:47,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:48:47,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:48:47,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:48:47,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:48:47,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:48:43" (1/3) ... [2022-11-25 16:48:47,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50baa7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:48:47, skipping insertion in model container [2022-11-25 16:48:47,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:44" (2/3) ... [2022-11-25 16:48:47,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50baa7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:48:47, skipping insertion in model container [2022-11-25 16:48:47,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:48:47" (3/3) ... [2022-11-25 16:48:47,194 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2022-11-25 16:48:47,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:48:47,217 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 16:48:47,316 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:48:47,328 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@42c8a7a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:48:47,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-25 16:48:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 570 states, 558 states have (on average 1.7831541218637992) internal successors, (995), 569 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 16:48:47,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:48:47,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:47,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:48:47,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash 646480323, now seen corresponding path program 1 times [2022-11-25 16:48:47,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:47,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977891536] [2022-11-25 16:48:47,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:47,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:48,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:48,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977891536] [2022-11-25 16:48:48,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977891536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:48,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:48,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:48:48,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583864966] [2022-11-25 16:48:48,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:48,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:48:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:48,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:48:48,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:48:48,118 INFO L87 Difference]: Start difference. First operand has 570 states, 558 states have (on average 1.7831541218637992) internal successors, (995), 569 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:48:48,911 INFO L93 Difference]: Finished difference Result 785 states and 1334 transitions. [2022-11-25 16:48:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:48:48,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-11-25 16:48:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:48:48,937 INFO L225 Difference]: With dead ends: 785 [2022-11-25 16:48:48,937 INFO L226 Difference]: Without dead ends: 503 [2022-11-25 16:48:48,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:48:48,949 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 2434 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:48:48,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2434 Valid, 551 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:48:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-11-25 16:48:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2022-11-25 16:48:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 492 states have (on average 1.274390243902439) internal successors, (627), 502 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 627 transitions. [2022-11-25 16:48:49,058 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 627 transitions. Word has length 60 [2022-11-25 16:48:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:48:49,059 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 627 transitions. [2022-11-25 16:48:49,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 627 transitions. [2022-11-25 16:48:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 16:48:49,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:48:49,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:49,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:48:49,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:48:49,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:49,073 INFO L85 PathProgramCache]: Analyzing trace with hash 221242932, now seen corresponding path program 1 times [2022-11-25 16:48:49,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:49,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916614524] [2022-11-25 16:48:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:49,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:49,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:49,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916614524] [2022-11-25 16:48:49,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916614524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:49,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:49,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:48:49,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624836534] [2022-11-25 16:48:49,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:49,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:48:49,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:49,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:48:49,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:48:49,301 INFO L87 Difference]: Start difference. First operand 503 states and 627 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:48:49,694 INFO L93 Difference]: Finished difference Result 637 states and 796 transitions. [2022-11-25 16:48:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:48:49,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-11-25 16:48:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:48:49,698 INFO L225 Difference]: With dead ends: 637 [2022-11-25 16:48:49,698 INFO L226 Difference]: Without dead ends: 381 [2022-11-25 16:48:49,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:48:49,703 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 1376 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:48:49,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 266 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:48:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-11-25 16:48:49,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-11-25 16:48:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 370 states have (on average 1.2864864864864864) internal successors, (476), 380 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 476 transitions. [2022-11-25 16:48:49,742 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 476 transitions. Word has length 60 [2022-11-25 16:48:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:48:49,743 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 476 transitions. [2022-11-25 16:48:49,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2022-11-25 16:48:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 16:48:49,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:48:49,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:49,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:48:49,746 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:48:49,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:49,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2147344789, now seen corresponding path program 1 times [2022-11-25 16:48:49,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:49,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350891981] [2022-11-25 16:48:49,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:49,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:49,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350891981] [2022-11-25 16:48:49,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350891981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:49,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:49,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:48:49,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866768416] [2022-11-25 16:48:49,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:49,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:48:49,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:49,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:48:49,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:48:49,996 INFO L87 Difference]: Start difference. First operand 381 states and 476 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:48:50,437 INFO L93 Difference]: Finished difference Result 713 states and 908 transitions. [2022-11-25 16:48:50,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:48:50,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-11-25 16:48:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:48:50,440 INFO L225 Difference]: With dead ends: 713 [2022-11-25 16:48:50,440 INFO L226 Difference]: Without dead ends: 509 [2022-11-25 16:48:50,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:48:50,441 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 1673 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:48:50,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 371 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:48:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-11-25 16:48:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 450. [2022-11-25 16:48:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 439 states have (on average 1.3416856492027336) internal successors, (589), 449 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 589 transitions. [2022-11-25 16:48:50,517 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 589 transitions. Word has length 60 [2022-11-25 16:48:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:48:50,519 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 589 transitions. [2022-11-25 16:48:50,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 589 transitions. [2022-11-25 16:48:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 16:48:50,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:48:50,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:50,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:48:50,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:48:50,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash 604643521, now seen corresponding path program 1 times [2022-11-25 16:48:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:50,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622271650] [2022-11-25 16:48:50,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:50,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:50,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:50,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622271650] [2022-11-25 16:48:50,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622271650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:50,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:50,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:48:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579228333] [2022-11-25 16:48:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:50,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:48:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:48:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:48:50,738 INFO L87 Difference]: Start difference. First operand 450 states and 589 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:48:50,970 INFO L93 Difference]: Finished difference Result 606 states and 794 transitions. [2022-11-25 16:48:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:48:50,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-11-25 16:48:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:48:50,972 INFO L225 Difference]: With dead ends: 606 [2022-11-25 16:48:50,972 INFO L226 Difference]: Without dead ends: 357 [2022-11-25 16:48:50,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:48:50,974 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 912 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:48:50,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 209 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:48:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-11-25 16:48:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2022-11-25 16:48:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.346820809248555) internal successors, (466), 356 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 466 transitions. [2022-11-25 16:48:51,006 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 466 transitions. Word has length 62 [2022-11-25 16:48:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:48:51,007 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 466 transitions. [2022-11-25 16:48:51,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 466 transitions. [2022-11-25 16:48:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 16:48:51,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:48:51,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:51,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:48:51,009 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:48:51,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash -699288056, now seen corresponding path program 1 times [2022-11-25 16:48:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:51,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886396336] [2022-11-25 16:48:51,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:51,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:51,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:51,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886396336] [2022-11-25 16:48:51,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886396336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:51,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:51,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:48:51,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210433482] [2022-11-25 16:48:51,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:51,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:48:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:51,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:48:51,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:48:51,494 INFO L87 Difference]: Start difference. First operand 357 states and 466 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:48:52,330 INFO L93 Difference]: Finished difference Result 810 states and 1097 transitions. [2022-11-25 16:48:52,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:48:52,331 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-11-25 16:48:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:48:52,335 INFO L225 Difference]: With dead ends: 810 [2022-11-25 16:48:52,335 INFO L226 Difference]: Without dead ends: 666 [2022-11-25 16:48:52,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:48:52,338 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 2139 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2139 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:48:52,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2139 Valid, 923 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:48:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-11-25 16:48:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 357. [2022-11-25 16:48:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3439306358381502) internal successors, (465), 356 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 465 transitions. [2022-11-25 16:48:52,417 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 465 transitions. Word has length 64 [2022-11-25 16:48:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:48:52,417 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 465 transitions. [2022-11-25 16:48:52,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 465 transitions. [2022-11-25 16:48:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 16:48:52,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:48:52,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:52,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:48:52,419 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:48:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:52,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1796013608, now seen corresponding path program 1 times [2022-11-25 16:48:52,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:52,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338027845] [2022-11-25 16:48:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:52,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:52,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:52,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338027845] [2022-11-25 16:48:52,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338027845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:52,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:52,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:48:52,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014885522] [2022-11-25 16:48:52,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:52,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:48:52,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:52,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:48:52,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:48:52,787 INFO L87 Difference]: Start difference. First operand 357 states and 465 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:48:53,823 INFO L93 Difference]: Finished difference Result 915 states and 1258 transitions. [2022-11-25 16:48:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:48:53,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-11-25 16:48:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:48:53,827 INFO L225 Difference]: With dead ends: 915 [2022-11-25 16:48:53,827 INFO L226 Difference]: Without dead ends: 795 [2022-11-25 16:48:53,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-11-25 16:48:53,829 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 1963 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1963 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:48:53,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1963 Valid, 1070 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:48:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-11-25 16:48:53,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 357. [2022-11-25 16:48:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3410404624277457) internal successors, (464), 356 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 464 transitions. [2022-11-25 16:48:53,894 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 464 transitions. Word has length 64 [2022-11-25 16:48:53,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:48:53,895 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 464 transitions. [2022-11-25 16:48:53,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 464 transitions. [2022-11-25 16:48:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 16:48:53,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:48:53,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:53,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:48:53,897 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:48:53,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:53,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1577721816, now seen corresponding path program 1 times [2022-11-25 16:48:53,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:53,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217183205] [2022-11-25 16:48:53,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:53,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:54,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:54,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217183205] [2022-11-25 16:48:54,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217183205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:54,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:54,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:48:54,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121172888] [2022-11-25 16:48:54,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:54,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:48:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:48:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:48:54,364 INFO L87 Difference]: Start difference. First operand 357 states and 464 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:48:54,955 INFO L93 Difference]: Finished difference Result 724 states and 946 transitions. [2022-11-25 16:48:54,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:48:54,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-11-25 16:48:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:48:54,959 INFO L225 Difference]: With dead ends: 724 [2022-11-25 16:48:54,959 INFO L226 Difference]: Without dead ends: 531 [2022-11-25 16:48:54,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:48:54,961 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 1744 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:48:54,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1744 Valid, 673 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:48:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-11-25 16:48:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 357. [2022-11-25 16:48:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3381502890173411) internal successors, (463), 356 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 463 transitions. [2022-11-25 16:48:55,047 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 463 transitions. Word has length 64 [2022-11-25 16:48:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:48:55,048 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 463 transitions. [2022-11-25 16:48:55,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 463 transitions. [2022-11-25 16:48:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 16:48:55,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:48:55,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:55,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:48:55,050 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:48:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:55,051 INFO L85 PathProgramCache]: Analyzing trace with hash -295025225, now seen corresponding path program 1 times [2022-11-25 16:48:55,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:55,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195809214] [2022-11-25 16:48:55,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:55,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:55,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:55,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195809214] [2022-11-25 16:48:55,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195809214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:55,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:55,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:48:55,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116352791] [2022-11-25 16:48:55,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:55,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:48:55,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:48:55,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:48:55,422 INFO L87 Difference]: Start difference. First operand 357 states and 463 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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) [2022-11-25 16:48:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:48:56,355 INFO L93 Difference]: Finished difference Result 883 states and 1207 transitions. [2022-11-25 16:48:56,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:48:56,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-25 16:48:56,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:48:56,358 INFO L225 Difference]: With dead ends: 883 [2022-11-25 16:48:56,362 INFO L226 Difference]: Without dead ends: 774 [2022-11-25 16:48:56,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-11-25 16:48:56,365 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 1976 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1976 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:48:56,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1976 Valid, 985 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:48:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-11-25 16:48:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 357. [2022-11-25 16:48:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3352601156069364) internal successors, (462), 356 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 462 transitions. [2022-11-25 16:48:56,425 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 462 transitions. Word has length 65 [2022-11-25 16:48:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:48:56,426 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 462 transitions. [2022-11-25 16:48:56,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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) [2022-11-25 16:48:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 462 transitions. [2022-11-25 16:48:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 16:48:56,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:48:56,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:56,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:48:56,434 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:48:56,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:56,434 INFO L85 PathProgramCache]: Analyzing trace with hash -168692467, now seen corresponding path program 1 times [2022-11-25 16:48:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:56,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659512412] [2022-11-25 16:48:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:56,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:56,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659512412] [2022-11-25 16:48:56,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659512412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:56,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:56,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:48:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776577383] [2022-11-25 16:48:56,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:56,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:48:56,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:56,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:48:56,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:48:56,832 INFO L87 Difference]: Start difference. First operand 357 states and 462 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) [2022-11-25 16:48:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:48:57,778 INFO L93 Difference]: Finished difference Result 814 states and 1101 transitions. [2022-11-25 16:48:57,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:48:57,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-11-25 16:48:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:48:57,782 INFO L225 Difference]: With dead ends: 814 [2022-11-25 16:48:57,782 INFO L226 Difference]: Without dead ends: 795 [2022-11-25 16:48:57,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-11-25 16:48:57,785 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 1895 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:48:57,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 1103 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:48:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-11-25 16:48:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 357. [2022-11-25 16:48:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.329479768786127) internal successors, (460), 356 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 460 transitions. [2022-11-25 16:48:57,893 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 460 transitions. Word has length 66 [2022-11-25 16:48:57,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:48:57,894 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 460 transitions. [2022-11-25 16:48:57,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) [2022-11-25 16:48:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 460 transitions. [2022-11-25 16:48:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 16:48:57,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:48:57,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:57,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:48:57,896 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:48:57,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:57,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1424145869, now seen corresponding path program 1 times [2022-11-25 16:48:57,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:57,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009452669] [2022-11-25 16:48:57,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:57,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:58,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:58,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009452669] [2022-11-25 16:48:58,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009452669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:58,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:58,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:48:58,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793494430] [2022-11-25 16:48:58,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:58,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:48:58,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:58,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:48:58,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:48:58,212 INFO L87 Difference]: Start difference. First operand 357 states and 460 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) [2022-11-25 16:48:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:48:59,146 INFO L93 Difference]: Finished difference Result 780 states and 1048 transitions. [2022-11-25 16:48:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:48:59,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-11-25 16:48:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:48:59,149 INFO L225 Difference]: With dead ends: 780 [2022-11-25 16:48:59,150 INFO L226 Difference]: Without dead ends: 774 [2022-11-25 16:48:59,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:48:59,151 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 994 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:48:59,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1061 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:48:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-11-25 16:48:59,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 357. [2022-11-25 16:48:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.323699421965318) internal successors, (458), 356 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:48:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 458 transitions. [2022-11-25 16:48:59,226 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 458 transitions. Word has length 66 [2022-11-25 16:48:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:48:59,226 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 458 transitions. [2022-11-25 16:48:59,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) [2022-11-25 16:48:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 458 transitions. [2022-11-25 16:48:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 16:48:59,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:48:59,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:48:59,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:48:59,228 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:48:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:48:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash -155488627, now seen corresponding path program 1 times [2022-11-25 16:48:59,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:48:59,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863004816] [2022-11-25 16:48:59,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:48:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:48:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:48:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:48:59,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:48:59,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863004816] [2022-11-25 16:48:59,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863004816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:48:59,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:48:59,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:48:59,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933963875] [2022-11-25 16:48:59,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:48:59,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:48:59,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:48:59,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:48:59,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:48:59,477 INFO L87 Difference]: Start difference. First operand 357 states and 458 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) [2022-11-25 16:49:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:00,161 INFO L93 Difference]: Finished difference Result 701 states and 948 transitions. [2022-11-25 16:49:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:49:00,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-11-25 16:49:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:00,163 INFO L225 Difference]: With dead ends: 701 [2022-11-25 16:49:00,163 INFO L226 Difference]: Without dead ends: 524 [2022-11-25 16:49:00,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-11-25 16:49:00,165 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 1361 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:00,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 909 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:49:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-11-25 16:49:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 357. [2022-11-25 16:49:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3179190751445087) internal successors, (456), 356 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 456 transitions. [2022-11-25 16:49:00,251 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 456 transitions. Word has length 66 [2022-11-25 16:49:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:00,251 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 456 transitions. [2022-11-25 16:49:00,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) [2022-11-25 16:49:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 456 transitions. [2022-11-25 16:49:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 16:49:00,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:00,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:00,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:49:00,254 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash -131812051, now seen corresponding path program 1 times [2022-11-25 16:49:00,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:00,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537806342] [2022-11-25 16:49:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:00,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:00,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537806342] [2022-11-25 16:49:00,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537806342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:00,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:00,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:49:00,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354909550] [2022-11-25 16:49:00,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:00,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:49:00,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:00,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:49:00,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:00,524 INFO L87 Difference]: Start difference. First operand 357 states and 456 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) [2022-11-25 16:49:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:01,427 INFO L93 Difference]: Finished difference Result 886 states and 1203 transitions. [2022-11-25 16:49:01,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:49:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-11-25 16:49:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:01,431 INFO L225 Difference]: With dead ends: 886 [2022-11-25 16:49:01,431 INFO L226 Difference]: Without dead ends: 774 [2022-11-25 16:49:01,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:49:01,432 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 1409 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:01,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 1072 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:49:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-11-25 16:49:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 357. [2022-11-25 16:49:01,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3150289017341041) internal successors, (455), 356 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 455 transitions. [2022-11-25 16:49:01,540 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 455 transitions. Word has length 66 [2022-11-25 16:49:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:01,540 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 455 transitions. [2022-11-25 16:49:01,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) [2022-11-25 16:49:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 455 transitions. [2022-11-25 16:49:01,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 16:49:01,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:01,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:01,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:49:01,543 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:01,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:01,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2058619373, now seen corresponding path program 1 times [2022-11-25 16:49:01,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:01,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814200853] [2022-11-25 16:49:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:01,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:01,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:01,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814200853] [2022-11-25 16:49:01,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814200853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:01,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:01,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:49:01,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414897077] [2022-11-25 16:49:01,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:01,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:49:01,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:01,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:49:01,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:01,848 INFO L87 Difference]: Start difference. First operand 357 states and 455 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) [2022-11-25 16:49:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:02,792 INFO L93 Difference]: Finished difference Result 920 states and 1252 transitions. [2022-11-25 16:49:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:49:02,792 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-11-25 16:49:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:02,795 INFO L225 Difference]: With dead ends: 920 [2022-11-25 16:49:02,795 INFO L226 Difference]: Without dead ends: 795 [2022-11-25 16:49:02,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:49:02,797 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 1661 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:02,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 1297 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:49:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-11-25 16:49:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 357. [2022-11-25 16:49:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3121387283236994) internal successors, (454), 356 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 454 transitions. [2022-11-25 16:49:02,880 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 454 transitions. Word has length 66 [2022-11-25 16:49:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:02,880 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 454 transitions. [2022-11-25 16:49:02,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) [2022-11-25 16:49:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 454 transitions. [2022-11-25 16:49:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 16:49:02,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:02,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:02,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:49:02,882 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:02,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1833305997, now seen corresponding path program 1 times [2022-11-25 16:49:02,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:02,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585983708] [2022-11-25 16:49:02,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:02,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:03,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:03,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585983708] [2022-11-25 16:49:03,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585983708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:03,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:03,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:49:03,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707816152] [2022-11-25 16:49:03,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:03,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:49:03,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:03,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:49:03,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:03,136 INFO L87 Difference]: Start difference. First operand 357 states and 454 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) [2022-11-25 16:49:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:04,033 INFO L93 Difference]: Finished difference Result 780 states and 1042 transitions. [2022-11-25 16:49:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:49:04,034 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-11-25 16:49:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:04,036 INFO L225 Difference]: With dead ends: 780 [2022-11-25 16:49:04,037 INFO L226 Difference]: Without dead ends: 774 [2022-11-25 16:49:04,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:49:04,038 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 1897 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:04,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 1201 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:49:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-11-25 16:49:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 357. [2022-11-25 16:49:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3092485549132948) internal successors, (453), 356 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 453 transitions. [2022-11-25 16:49:04,131 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 453 transitions. Word has length 66 [2022-11-25 16:49:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:04,131 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 453 transitions. [2022-11-25 16:49:04,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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) [2022-11-25 16:49:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 453 transitions. [2022-11-25 16:49:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 16:49:04,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:04,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:04,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:49:04,133 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:04,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:04,133 INFO L85 PathProgramCache]: Analyzing trace with hash 817551922, now seen corresponding path program 1 times [2022-11-25 16:49:04,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:04,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723877606] [2022-11-25 16:49:04,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:04,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:04,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723877606] [2022-11-25 16:49:04,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723877606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:04,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:04,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 16:49:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115271928] [2022-11-25 16:49:04,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:04,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 16:49:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:04,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 16:49:04,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-25 16:49:04,980 INFO L87 Difference]: Start difference. First operand 357 states and 453 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:06,149 INFO L93 Difference]: Finished difference Result 701 states and 925 transitions. [2022-11-25 16:49:06,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 16:49:06,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-11-25 16:49:06,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:06,152 INFO L225 Difference]: With dead ends: 701 [2022-11-25 16:49:06,152 INFO L226 Difference]: Without dead ends: 578 [2022-11-25 16:49:06,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:49:06,155 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 1242 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:06,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 2428 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:49:06,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-11-25 16:49:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 336. [2022-11-25 16:49:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 326 states have (on average 1.3067484662576687) internal successors, (426), 335 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 426 transitions. [2022-11-25 16:49:06,267 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 426 transitions. Word has length 67 [2022-11-25 16:49:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:06,267 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 426 transitions. [2022-11-25 16:49:06,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:06,268 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 426 transitions. [2022-11-25 16:49:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 16:49:06,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:06,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:06,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 16:49:06,269 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:06,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:06,270 INFO L85 PathProgramCache]: Analyzing trace with hash 167509874, now seen corresponding path program 1 times [2022-11-25 16:49:06,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:06,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76835165] [2022-11-25 16:49:06,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:06,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:06,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76835165] [2022-11-25 16:49:06,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76835165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:06,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:06,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 16:49:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910573493] [2022-11-25 16:49:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:06,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 16:49:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:06,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 16:49:06,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:49:06,888 INFO L87 Difference]: Start difference. First operand 336 states and 426 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 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) [2022-11-25 16:49:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:08,046 INFO L93 Difference]: Finished difference Result 853 states and 1146 transitions. [2022-11-25 16:49:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:49:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-11-25 16:49:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:08,049 INFO L225 Difference]: With dead ends: 853 [2022-11-25 16:49:08,050 INFO L226 Difference]: Without dead ends: 677 [2022-11-25 16:49:08,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2022-11-25 16:49:08,051 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 1566 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:08,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 1306 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:49:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-11-25 16:49:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 266. [2022-11-25 16:49:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 260 states have (on average 1.3153846153846154) internal successors, (342), 265 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 342 transitions. [2022-11-25 16:49:08,131 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 342 transitions. Word has length 67 [2022-11-25 16:49:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:08,132 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 342 transitions. [2022-11-25 16:49:08,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 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) [2022-11-25 16:49:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 342 transitions. [2022-11-25 16:49:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 16:49:08,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:08,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:08,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 16:49:08,134 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1968382194, now seen corresponding path program 1 times [2022-11-25 16:49:08,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:08,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052305043] [2022-11-25 16:49:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:09,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:09,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052305043] [2022-11-25 16:49:09,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052305043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:09,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:09,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-25 16:49:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494548803] [2022-11-25 16:49:09,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:09,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 16:49:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:09,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 16:49:09,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:49:09,541 INFO L87 Difference]: Start difference. First operand 266 states and 342 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:11,805 INFO L93 Difference]: Finished difference Result 416 states and 549 transitions. [2022-11-25 16:49:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 16:49:11,805 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-25 16:49:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:11,808 INFO L225 Difference]: With dead ends: 416 [2022-11-25 16:49:11,808 INFO L226 Difference]: Without dead ends: 306 [2022-11-25 16:49:11,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 16:49:11,810 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 508 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:11,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2147 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 16:49:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-25 16:49:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 277. [2022-11-25 16:49:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 271 states have (on average 1.3210332103321034) internal successors, (358), 276 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 358 transitions. [2022-11-25 16:49:11,890 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 358 transitions. Word has length 68 [2022-11-25 16:49:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:11,890 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 358 transitions. [2022-11-25 16:49:11,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 358 transitions. [2022-11-25 16:49:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 16:49:11,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:11,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:11,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 16:49:11,892 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:11,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1424994738, now seen corresponding path program 1 times [2022-11-25 16:49:11,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:11,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043829336] [2022-11-25 16:49:11,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:11,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:13,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:13,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043829336] [2022-11-25 16:49:13,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043829336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:13,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:13,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-25 16:49:13,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709614412] [2022-11-25 16:49:13,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:13,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 16:49:13,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:13,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 16:49:13,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:49:13,093 INFO L87 Difference]: Start difference. First operand 277 states and 358 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:15,335 INFO L93 Difference]: Finished difference Result 314 states and 396 transitions. [2022-11-25 16:49:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 16:49:15,336 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-25 16:49:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:15,338 INFO L225 Difference]: With dead ends: 314 [2022-11-25 16:49:15,338 INFO L226 Difference]: Without dead ends: 301 [2022-11-25 16:49:15,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=243, Invalid=1239, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 16:49:15,339 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 460 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:15,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 2430 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 16:49:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-25 16:49:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 287. [2022-11-25 16:49:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 281 states have (on average 1.3167259786476868) internal successors, (370), 286 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 370 transitions. [2022-11-25 16:49:15,430 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 370 transitions. Word has length 68 [2022-11-25 16:49:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:15,430 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 370 transitions. [2022-11-25 16:49:15,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 370 transitions. [2022-11-25 16:49:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 16:49:15,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:15,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:15,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 16:49:15,432 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:15,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:15,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1394723840, now seen corresponding path program 1 times [2022-11-25 16:49:15,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:15,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747884454] [2022-11-25 16:49:15,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:15,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:15,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747884454] [2022-11-25 16:49:15,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747884454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:15,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:15,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 16:49:15,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889176211] [2022-11-25 16:49:15,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:15,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 16:49:15,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:15,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 16:49:15,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:49:15,863 INFO L87 Difference]: Start difference. First operand 287 states and 370 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 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) [2022-11-25 16:49:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:16,786 INFO L93 Difference]: Finished difference Result 826 states and 1135 transitions. [2022-11-25 16:49:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:49:16,787 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-11-25 16:49:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:16,790 INFO L225 Difference]: With dead ends: 826 [2022-11-25 16:49:16,790 INFO L226 Difference]: Without dead ends: 693 [2022-11-25 16:49:16,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-11-25 16:49:16,792 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 920 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:16,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 2129 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:49:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-11-25 16:49:16,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 253. [2022-11-25 16:49:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 249 states have (on average 1.2971887550200802) internal successors, (323), 252 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:16,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 323 transitions. [2022-11-25 16:49:16,902 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 323 transitions. Word has length 69 [2022-11-25 16:49:16,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:16,902 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 323 transitions. [2022-11-25 16:49:16,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 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) [2022-11-25 16:49:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 323 transitions. [2022-11-25 16:49:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 16:49:16,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:16,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:16,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 16:49:16,904 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:16,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash 308538022, now seen corresponding path program 1 times [2022-11-25 16:49:16,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:16,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217016368] [2022-11-25 16:49:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:16,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:17,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:17,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217016368] [2022-11-25 16:49:17,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217016368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:17,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:17,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 16:49:17,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519552850] [2022-11-25 16:49:17,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:17,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 16:49:17,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 16:49:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 16:49:17,491 INFO L87 Difference]: Start difference. First operand 253 states and 323 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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) [2022-11-25 16:49:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:18,785 INFO L93 Difference]: Finished difference Result 689 states and 918 transitions. [2022-11-25 16:49:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 16:49:18,786 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-11-25 16:49:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:18,788 INFO L225 Difference]: With dead ends: 689 [2022-11-25 16:49:18,789 INFO L226 Difference]: Without dead ends: 685 [2022-11-25 16:49:18,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2022-11-25 16:49:18,790 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 1469 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:18,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1274 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:49:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-11-25 16:49:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 248. [2022-11-25 16:49:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 245 states have (on average 1.2979591836734694) internal successors, (318), 247 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 318 transitions. [2022-11-25 16:49:18,897 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 318 transitions. Word has length 69 [2022-11-25 16:49:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:18,898 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 318 transitions. [2022-11-25 16:49:18,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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) [2022-11-25 16:49:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 318 transitions. [2022-11-25 16:49:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 16:49:18,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:18,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:18,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 16:49:18,900 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:18,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:18,900 INFO L85 PathProgramCache]: Analyzing trace with hash -957086542, now seen corresponding path program 1 times [2022-11-25 16:49:18,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:18,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454274411] [2022-11-25 16:49:18,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:18,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:19,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:19,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454274411] [2022-11-25 16:49:19,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454274411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:19,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:19,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:49:19,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377524592] [2022-11-25 16:49:19,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:19,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:49:19,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:19,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:49:19,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:19,127 INFO L87 Difference]: Start difference. First operand 248 states and 318 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:19,850 INFO L93 Difference]: Finished difference Result 548 states and 736 transitions. [2022-11-25 16:49:19,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:49:19,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-11-25 16:49:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:19,853 INFO L225 Difference]: With dead ends: 548 [2022-11-25 16:49:19,853 INFO L226 Difference]: Without dead ends: 408 [2022-11-25 16:49:19,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-11-25 16:49:19,855 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 685 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:19,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 604 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:49:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-11-25 16:49:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 248. [2022-11-25 16:49:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 245 states have (on average 1.2897959183673469) internal successors, (316), 247 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2022-11-25 16:49:20,009 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 70 [2022-11-25 16:49:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:20,010 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2022-11-25 16:49:20,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2022-11-25 16:49:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 16:49:20,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:20,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:20,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 16:49:20,011 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:20,012 INFO L85 PathProgramCache]: Analyzing trace with hash -776449806, now seen corresponding path program 1 times [2022-11-25 16:49:20,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:20,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380148569] [2022-11-25 16:49:20,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:20,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:20,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380148569] [2022-11-25 16:49:20,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380148569] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:20,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:20,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:49:20,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892034536] [2022-11-25 16:49:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:20,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:49:20,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:20,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:49:20,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:20,244 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:20,958 INFO L93 Difference]: Finished difference Result 418 states and 543 transitions. [2022-11-25 16:49:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:49:20,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-11-25 16:49:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:20,961 INFO L225 Difference]: With dead ends: 418 [2022-11-25 16:49:20,961 INFO L226 Difference]: Without dead ends: 410 [2022-11-25 16:49:20,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-11-25 16:49:20,964 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 590 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:20,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 739 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:49:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-25 16:49:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 248. [2022-11-25 16:49:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 247 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 314 transitions. [2022-11-25 16:49:21,109 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 314 transitions. Word has length 70 [2022-11-25 16:49:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:21,110 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 314 transitions. [2022-11-25 16:49:21,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 314 transitions. [2022-11-25 16:49:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-25 16:49:21,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:21,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:21,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 16:49:21,112 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:21,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash -918116841, now seen corresponding path program 1 times [2022-11-25 16:49:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:21,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304534406] [2022-11-25 16:49:21,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:21,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:22,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:22,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304534406] [2022-11-25 16:49:22,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304534406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:22,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:22,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-25 16:49:22,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941555824] [2022-11-25 16:49:22,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:22,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 16:49:22,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:22,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 16:49:22,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-11-25 16:49:22,472 INFO L87 Difference]: Start difference. First operand 248 states and 314 transitions. Second operand has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:25,333 INFO L93 Difference]: Finished difference Result 850 states and 1178 transitions. [2022-11-25 16:49:25,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 16:49:25,335 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-11-25 16:49:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:25,338 INFO L225 Difference]: With dead ends: 850 [2022-11-25 16:49:25,339 INFO L226 Difference]: Without dead ends: 844 [2022-11-25 16:49:25,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=299, Invalid=1423, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 16:49:25,340 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 1089 mSDsluCounter, 2776 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 2995 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:25,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 2995 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 16:49:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2022-11-25 16:49:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 261. [2022-11-25 16:49:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 258 states have (on average 1.2790697674418605) internal successors, (330), 260 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 330 transitions. [2022-11-25 16:49:25,473 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 330 transitions. Word has length 72 [2022-11-25 16:49:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:25,473 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 330 transitions. [2022-11-25 16:49:25,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 330 transitions. [2022-11-25 16:49:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 16:49:25,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:25,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:25,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 16:49:25,475 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash 370177890, now seen corresponding path program 1 times [2022-11-25 16:49:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:25,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245901329] [2022-11-25 16:49:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:26,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:26,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245901329] [2022-11-25 16:49:26,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245901329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:26,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:26,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 16:49:26,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684985223] [2022-11-25 16:49:26,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:26,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 16:49:26,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:26,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 16:49:26,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-25 16:49:26,509 INFO L87 Difference]: Start difference. First operand 261 states and 330 transitions. Second operand has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 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) [2022-11-25 16:49:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:30,459 INFO L93 Difference]: Finished difference Result 1225 states and 1713 transitions. [2022-11-25 16:49:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 16:49:30,460 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 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) Word has length 73 [2022-11-25 16:49:30,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:30,464 INFO L225 Difference]: With dead ends: 1225 [2022-11-25 16:49:30,464 INFO L226 Difference]: Without dead ends: 1219 [2022-11-25 16:49:30,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2022-11-25 16:49:30,466 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 1881 mSDsluCounter, 3019 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 3399 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:30,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1881 Valid, 3399 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 16:49:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2022-11-25 16:49:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 248. [2022-11-25 16:49:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 245 states have (on average 1.2775510204081633) internal successors, (313), 247 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 313 transitions. [2022-11-25 16:49:30,606 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 313 transitions. Word has length 73 [2022-11-25 16:49:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:30,606 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 313 transitions. [2022-11-25 16:49:30,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 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) [2022-11-25 16:49:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 313 transitions. [2022-11-25 16:49:30,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 16:49:30,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:30,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:30,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 16:49:30,608 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:30,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2116165432, now seen corresponding path program 1 times [2022-11-25 16:49:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:30,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937790077] [2022-11-25 16:49:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:31,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:31,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937790077] [2022-11-25 16:49:31,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937790077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:31,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:31,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-25 16:49:31,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004677259] [2022-11-25 16:49:31,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:31,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 16:49:31,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:31,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 16:49:31,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-11-25 16:49:31,578 INFO L87 Difference]: Start difference. First operand 248 states and 313 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 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) [2022-11-25 16:49:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:32,810 INFO L93 Difference]: Finished difference Result 272 states and 337 transitions. [2022-11-25 16:49:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 16:49:32,810 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 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) Word has length 73 [2022-11-25 16:49:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:32,812 INFO L225 Difference]: With dead ends: 272 [2022-11-25 16:49:32,812 INFO L226 Difference]: Without dead ends: 250 [2022-11-25 16:49:32,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2022-11-25 16:49:32,813 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 528 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:32,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1692 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:49:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-25 16:49:32,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 239. [2022-11-25 16:49:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 236 states have (on average 1.2796610169491525) internal successors, (302), 238 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 302 transitions. [2022-11-25 16:49:33,001 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 302 transitions. Word has length 73 [2022-11-25 16:49:33,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:33,001 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 302 transitions. [2022-11-25 16:49:33,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 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) [2022-11-25 16:49:33,002 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 302 transitions. [2022-11-25 16:49:33,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 16:49:33,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:33,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:33,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 16:49:33,004 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:33,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:33,004 INFO L85 PathProgramCache]: Analyzing trace with hash 581450123, now seen corresponding path program 1 times [2022-11-25 16:49:33,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:33,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611554656] [2022-11-25 16:49:33,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:33,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:33,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:33,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611554656] [2022-11-25 16:49:33,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611554656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:33,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:33,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 16:49:33,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64540952] [2022-11-25 16:49:33,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:33,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 16:49:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:33,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 16:49:33,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-25 16:49:33,527 INFO L87 Difference]: Start difference. First operand 239 states and 302 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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) [2022-11-25 16:49:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:34,383 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2022-11-25 16:49:34,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 16:49:34,384 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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) Word has length 73 [2022-11-25 16:49:34,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:34,385 INFO L225 Difference]: With dead ends: 395 [2022-11-25 16:49:34,386 INFO L226 Difference]: Without dead ends: 375 [2022-11-25 16:49:34,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:49:34,387 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 622 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:34,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1486 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:49:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-25 16:49:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 219. [2022-11-25 16:49:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 217 states have (on average 1.2903225806451613) internal successors, (280), 218 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 280 transitions. [2022-11-25 16:49:34,547 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 280 transitions. Word has length 73 [2022-11-25 16:49:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:34,547 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 280 transitions. [2022-11-25 16:49:34,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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) [2022-11-25 16:49:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 280 transitions. [2022-11-25 16:49:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 16:49:34,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:34,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:34,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 16:49:34,549 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:34,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1832673344, now seen corresponding path program 1 times [2022-11-25 16:49:34,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:34,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290303227] [2022-11-25 16:49:34,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:34,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:35,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:35,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290303227] [2022-11-25 16:49:35,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290303227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:35,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:35,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 16:49:35,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955604538] [2022-11-25 16:49:35,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:35,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 16:49:35,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:35,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 16:49:35,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-25 16:49:35,095 INFO L87 Difference]: Start difference. First operand 219 states and 280 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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) [2022-11-25 16:49:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:36,412 INFO L93 Difference]: Finished difference Result 599 states and 821 transitions. [2022-11-25 16:49:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 16:49:36,412 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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) Word has length 73 [2022-11-25 16:49:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:36,414 INFO L225 Difference]: With dead ends: 599 [2022-11-25 16:49:36,415 INFO L226 Difference]: Without dead ends: 593 [2022-11-25 16:49:36,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2022-11-25 16:49:36,416 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 887 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:36,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1928 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:49:36,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-11-25 16:49:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 213. [2022-11-25 16:49:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.2924528301886793) internal successors, (274), 212 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2022-11-25 16:49:36,546 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 73 [2022-11-25 16:49:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:36,546 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2022-11-25 16:49:36,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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) [2022-11-25 16:49:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2022-11-25 16:49:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-25 16:49:36,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:36,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:36,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 16:49:36,548 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1364481581, now seen corresponding path program 1 times [2022-11-25 16:49:36,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:36,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305995511] [2022-11-25 16:49:36,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:36,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:36,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:36,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305995511] [2022-11-25 16:49:36,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305995511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:36,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:36,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:49:36,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604775405] [2022-11-25 16:49:36,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:36,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:49:36,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:36,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:49:36,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:49:36,688 INFO L87 Difference]: Start difference. First operand 213 states and 274 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:37,480 INFO L93 Difference]: Finished difference Result 1061 states and 1538 transitions. [2022-11-25 16:49:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:49:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-11-25 16:49:37,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:37,484 INFO L225 Difference]: With dead ends: 1061 [2022-11-25 16:49:37,484 INFO L226 Difference]: Without dead ends: 955 [2022-11-25 16:49:37,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:49:37,485 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 906 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:37,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 955 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:49:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-11-25 16:49:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 317. [2022-11-25 16:49:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.3512658227848102) internal successors, (427), 316 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 427 transitions. [2022-11-25 16:49:37,736 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 427 transitions. Word has length 96 [2022-11-25 16:49:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:37,736 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 427 transitions. [2022-11-25 16:49:37,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 427 transitions. [2022-11-25 16:49:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-25 16:49:37,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:37,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:37,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 16:49:37,738 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:37,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:37,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1426852022, now seen corresponding path program 1 times [2022-11-25 16:49:37,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:37,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771808515] [2022-11-25 16:49:37,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:37,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:37,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771808515] [2022-11-25 16:49:37,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771808515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:37,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:37,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:49:37,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542415857] [2022-11-25 16:49:37,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:37,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:49:37,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:37,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:49:37,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:49:37,871 INFO L87 Difference]: Start difference. First operand 317 states and 427 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:38,922 INFO L93 Difference]: Finished difference Result 1263 states and 1825 transitions. [2022-11-25 16:49:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:49:38,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-11-25 16:49:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:38,927 INFO L225 Difference]: With dead ends: 1263 [2022-11-25 16:49:38,928 INFO L226 Difference]: Without dead ends: 1053 [2022-11-25 16:49:38,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:38,929 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 655 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:38,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 670 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:49:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2022-11-25 16:49:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 525. [2022-11-25 16:49:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.4026717557251909) internal successors, (735), 524 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 735 transitions. [2022-11-25 16:49:39,285 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 735 transitions. Word has length 98 [2022-11-25 16:49:39,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:39,285 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 735 transitions. [2022-11-25 16:49:39,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 735 transitions. [2022-11-25 16:49:39,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-25 16:49:39,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:39,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:39,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 16:49:39,287 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:39,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash 645902315, now seen corresponding path program 1 times [2022-11-25 16:49:39,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:39,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079541088] [2022-11-25 16:49:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:39,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:39,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:39,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079541088] [2022-11-25 16:49:39,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079541088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:39,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:39,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:49:39,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303347229] [2022-11-25 16:49:39,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:39,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:49:39,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:39,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:49:39,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:49:39,510 INFO L87 Difference]: Start difference. First operand 525 states and 735 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:39,969 INFO L93 Difference]: Finished difference Result 945 states and 1355 transitions. [2022-11-25 16:49:39,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:49:39,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-11-25 16:49:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:39,971 INFO L225 Difference]: With dead ends: 945 [2022-11-25 16:49:39,971 INFO L226 Difference]: Without dead ends: 527 [2022-11-25 16:49:39,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:49:39,972 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 264 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:39,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 381 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-11-25 16:49:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2022-11-25 16:49:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.3950381679389312) internal successors, (731), 524 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 731 transitions. [2022-11-25 16:49:40,491 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 731 transitions. Word has length 98 [2022-11-25 16:49:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:40,491 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 731 transitions. [2022-11-25 16:49:40,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 731 transitions. [2022-11-25 16:49:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-25 16:49:40,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:40,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:40,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-25 16:49:40,493 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:40,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash 579408803, now seen corresponding path program 1 times [2022-11-25 16:49:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:40,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748364001] [2022-11-25 16:49:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:40,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:40,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748364001] [2022-11-25 16:49:40,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748364001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:40,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:40,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:40,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665844474] [2022-11-25 16:49:40,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:40,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:49:40,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:40,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:49:40,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:40,551 INFO L87 Difference]: Start difference. First operand 525 states and 731 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:41,259 INFO L93 Difference]: Finished difference Result 1309 states and 1873 transitions. [2022-11-25 16:49:41,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:49:41,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-11-25 16:49:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:41,263 INFO L225 Difference]: With dead ends: 1309 [2022-11-25 16:49:41,263 INFO L226 Difference]: Without dead ends: 891 [2022-11-25 16:49:41,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:41,264 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 67 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:41,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 374 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-11-25 16:49:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2022-11-25 16:49:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.3975225225225225) internal successors, (1241), 888 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1241 transitions. [2022-11-25 16:49:41,952 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1241 transitions. Word has length 98 [2022-11-25 16:49:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:41,952 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1241 transitions. [2022-11-25 16:49:41,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1241 transitions. [2022-11-25 16:49:41,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-25 16:49:41,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:41,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:41,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 16:49:41,954 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:41,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash 628880202, now seen corresponding path program 1 times [2022-11-25 16:49:41,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:41,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289616116] [2022-11-25 16:49:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:42,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:42,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289616116] [2022-11-25 16:49:42,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289616116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:42,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:42,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:49:42,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218253733] [2022-11-25 16:49:42,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:42,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:49:42,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:42,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:49:42,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:49:42,101 INFO L87 Difference]: Start difference. First operand 889 states and 1241 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:43,962 INFO L93 Difference]: Finished difference Result 2655 states and 3782 transitions. [2022-11-25 16:49:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:49:43,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-11-25 16:49:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:43,972 INFO L225 Difference]: With dead ends: 2655 [2022-11-25 16:49:43,972 INFO L226 Difference]: Without dead ends: 2263 [2022-11-25 16:49:43,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:43,973 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 622 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:43,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 684 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:49:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2022-11-25 16:49:45,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1475. [2022-11-25 16:49:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 1.4118046132971507) internal successors, (2081), 1474 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2081 transitions. [2022-11-25 16:49:45,130 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2081 transitions. Word has length 98 [2022-11-25 16:49:45,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:45,131 INFO L495 AbstractCegarLoop]: Abstraction has 1475 states and 2081 transitions. [2022-11-25 16:49:45,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2081 transitions. [2022-11-25 16:49:45,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-25 16:49:45,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:45,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:45,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 16:49:45,133 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:45,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1790937782, now seen corresponding path program 1 times [2022-11-25 16:49:45,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:45,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582695189] [2022-11-25 16:49:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:45,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:45,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582695189] [2022-11-25 16:49:45,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582695189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:45,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:45,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:49:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498395500] [2022-11-25 16:49:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:45,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:49:45,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:45,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:49:45,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:49:45,260 INFO L87 Difference]: Start difference. First operand 1475 states and 2081 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:47,664 INFO L93 Difference]: Finished difference Result 3045 states and 4342 transitions. [2022-11-25 16:49:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:49:47,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-11-25 16:49:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:47,673 INFO L225 Difference]: With dead ends: 3045 [2022-11-25 16:49:47,673 INFO L226 Difference]: Without dead ends: 2653 [2022-11-25 16:49:47,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:47,675 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 589 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:47,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 759 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:49:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2022-11-25 16:49:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1865. [2022-11-25 16:49:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1864 states have (on average 1.4168454935622317) internal successors, (2641), 1864 states have internal predecessors, (2641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2641 transitions. [2022-11-25 16:49:49,219 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2641 transitions. Word has length 98 [2022-11-25 16:49:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:49,219 INFO L495 AbstractCegarLoop]: Abstraction has 1865 states and 2641 transitions. [2022-11-25 16:49:49,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2641 transitions. [2022-11-25 16:49:49,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-25 16:49:49,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:49,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:49,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 16:49:49,221 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:49,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:49,222 INFO L85 PathProgramCache]: Analyzing trace with hash -686393014, now seen corresponding path program 1 times [2022-11-25 16:49:49,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:49,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254572529] [2022-11-25 16:49:49,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:49,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:49,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:49,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254572529] [2022-11-25 16:49:49,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254572529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:49,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:49,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:49:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963650666] [2022-11-25 16:49:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:49,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:49:49,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:49,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:49:49,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:49:49,350 INFO L87 Difference]: Start difference. First operand 1865 states and 2641 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:52,133 INFO L93 Difference]: Finished difference Result 3435 states and 4902 transitions. [2022-11-25 16:49:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:49:52,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-11-25 16:49:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:52,143 INFO L225 Difference]: With dead ends: 3435 [2022-11-25 16:49:52,143 INFO L226 Difference]: Without dead ends: 3043 [2022-11-25 16:49:52,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:52,145 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 650 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:52,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 762 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:49:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2022-11-25 16:49:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2255. [2022-11-25 16:49:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 2254 states have (on average 1.4201419698314108) internal successors, (3201), 2254 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3201 transitions. [2022-11-25 16:49:54,231 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3201 transitions. Word has length 98 [2022-11-25 16:49:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:54,232 INFO L495 AbstractCegarLoop]: Abstraction has 2255 states and 3201 transitions. [2022-11-25 16:49:54,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3201 transitions. [2022-11-25 16:49:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-25 16:49:54,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:54,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:54,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 16:49:54,234 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:49:54,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:54,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1897778033, now seen corresponding path program 1 times [2022-11-25 16:49:54,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:54,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440537725] [2022-11-25 16:49:54,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:54,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:49:54,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:54,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440537725] [2022-11-25 16:49:54,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440537725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:54,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:54,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:54,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817902451] [2022-11-25 16:49:54,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:54,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:49:54,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:54,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:49:54,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:54,352 INFO L87 Difference]: Start difference. First operand 2255 states and 3201 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:49:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:57,491 INFO L93 Difference]: Finished difference Result 5715 states and 8137 transitions. [2022-11-25 16:49:57,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:49:57,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-11-25 16:49:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:57,502 INFO L225 Difference]: With dead ends: 5715 [2022-11-25 16:49:57,502 INFO L226 Difference]: Without dead ends: 3567 [2022-11-25 16:49:57,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:57,505 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 78 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:57,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 345 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2022-11-25 16:50:00,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3389. [2022-11-25 16:50:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3389 states, 3388 states have (on average 1.406434474616293) internal successors, (4765), 3388 states have internal predecessors, (4765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 4765 transitions. [2022-11-25 16:50:00,548 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 4765 transitions. Word has length 99 [2022-11-25 16:50:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:00,548 INFO L495 AbstractCegarLoop]: Abstraction has 3389 states and 4765 transitions. [2022-11-25 16:50:00,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 4765 transitions. [2022-11-25 16:50:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-25 16:50:00,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:00,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:00,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-25 16:50:00,551 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:50:00,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash 642959826, now seen corresponding path program 1 times [2022-11-25 16:50:00,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:00,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033420825] [2022-11-25 16:50:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:00,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:00,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033420825] [2022-11-25 16:50:00,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033420825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:00,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:00,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:50:00,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561737474] [2022-11-25 16:50:00,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:00,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:50:00,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:00,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:00,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:00,662 INFO L87 Difference]: Start difference. First operand 3389 states and 4765 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:05,712 INFO L93 Difference]: Finished difference Result 9689 states and 13601 transitions. [2022-11-25 16:50:05,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:05,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-11-25 16:50:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:05,726 INFO L225 Difference]: With dead ends: 9689 [2022-11-25 16:50:05,727 INFO L226 Difference]: Without dead ends: 6407 [2022-11-25 16:50:05,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:05,734 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 71 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:05,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 346 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:50:05,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2022-11-25 16:50:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 6141. [2022-11-25 16:50:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6141 states, 6140 states have (on average 1.3933224755700326) internal successors, (8555), 6140 states have internal predecessors, (8555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 8555 transitions. [2022-11-25 16:50:10,855 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 8555 transitions. Word has length 100 [2022-11-25 16:50:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:10,856 INFO L495 AbstractCegarLoop]: Abstraction has 6141 states and 8555 transitions. [2022-11-25 16:50:10,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 8555 transitions. [2022-11-25 16:50:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-25 16:50:10,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:10,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:10,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-25 16:50:10,858 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:50:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:10,858 INFO L85 PathProgramCache]: Analyzing trace with hash -563977445, now seen corresponding path program 1 times [2022-11-25 16:50:10,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:10,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945375186] [2022-11-25 16:50:10,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:10,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:10,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:10,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945375186] [2022-11-25 16:50:10,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945375186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:10,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:10,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:50:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336885588] [2022-11-25 16:50:10,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:10,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:50:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:10,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:10,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:10,975 INFO L87 Difference]: Start difference. First operand 6141 states and 8555 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:21,589 INFO L93 Difference]: Finished difference Result 17681 states and 24509 transitions. [2022-11-25 16:50:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:21,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-11-25 16:50:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:21,613 INFO L225 Difference]: With dead ends: 17681 [2022-11-25 16:50:21,613 INFO L226 Difference]: Without dead ends: 11647 [2022-11-25 16:50:21,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:21,620 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 64 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:21,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 346 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:50:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11647 states. [2022-11-25 16:50:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11647 to 11117. [2022-11-25 16:50:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11117 states, 11116 states have (on average 1.3743252968693775) internal successors, (15277), 11116 states have internal predecessors, (15277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11117 states to 11117 states and 15277 transitions. [2022-11-25 16:50:32,399 INFO L78 Accepts]: Start accepts. Automaton has 11117 states and 15277 transitions. Word has length 101 [2022-11-25 16:50:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:32,400 INFO L495 AbstractCegarLoop]: Abstraction has 11117 states and 15277 transitions. [2022-11-25 16:50:32,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 11117 states and 15277 transitions. [2022-11-25 16:50:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-25 16:50:32,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:32,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:32,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-25 16:50:32,402 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:50:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:32,402 INFO L85 PathProgramCache]: Analyzing trace with hash 573353758, now seen corresponding path program 1 times [2022-11-25 16:50:32,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:32,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104453470] [2022-11-25 16:50:32,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:32,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:32,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:32,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104453470] [2022-11-25 16:50:32,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104453470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:32,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:32,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:50:32,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485587892] [2022-11-25 16:50:32,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:32,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:50:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:32,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:32,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:32,559 INFO L87 Difference]: Start difference. First operand 11117 states and 15277 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:51,110 INFO L93 Difference]: Finished difference Result 32081 states and 43751 transitions. [2022-11-25 16:50:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:51,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-11-25 16:50:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:51,163 INFO L225 Difference]: With dead ends: 32081 [2022-11-25 16:50:51,163 INFO L226 Difference]: Without dead ends: 21071 [2022-11-25 16:50:51,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:51,176 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 54 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:51,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 345 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:50:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21071 states. [2022-11-25 16:51:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21071 to 20013. [2022-11-25 16:51:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20013 states, 20012 states have (on average 1.349440335798521) internal successors, (27005), 20012 states have internal predecessors, (27005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20013 states to 20013 states and 27005 transitions. [2022-11-25 16:51:12,010 INFO L78 Accepts]: Start accepts. Automaton has 20013 states and 27005 transitions. Word has length 102 [2022-11-25 16:51:12,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:12,011 INFO L495 AbstractCegarLoop]: Abstraction has 20013 states and 27005 transitions. [2022-11-25 16:51:12,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 20013 states and 27005 transitions. [2022-11-25 16:51:12,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-25 16:51:12,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:12,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:12,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-25 16:51:12,013 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:51:12,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:12,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1488377255, now seen corresponding path program 1 times [2022-11-25 16:51:12,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:12,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203226349] [2022-11-25 16:51:12,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:12,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:12,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:12,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203226349] [2022-11-25 16:51:12,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203226349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:12,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:12,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:51:12,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249654721] [2022-11-25 16:51:12,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:12,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:51:12,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:12,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:51:12,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:51:12,220 INFO L87 Difference]: Start difference. First operand 20013 states and 27005 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:42,915 INFO L93 Difference]: Finished difference Result 31023 states and 41659 transitions. [2022-11-25 16:51:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:51:42,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-11-25 16:51:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:42,974 INFO L225 Difference]: With dead ends: 31023 [2022-11-25 16:51:42,975 INFO L226 Difference]: Without dead ends: 31021 [2022-11-25 16:51:42,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:51:42,982 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 262 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:42,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 822 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:51:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31021 states. [2022-11-25 16:52:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31021 to 20493. [2022-11-25 16:52:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20493 states, 20492 states have (on average 1.3318856138981066) internal successors, (27293), 20492 states have internal predecessors, (27293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:52:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20493 states to 20493 states and 27293 transitions. [2022-11-25 16:52:02,189 INFO L78 Accepts]: Start accepts. Automaton has 20493 states and 27293 transitions. Word has length 103 [2022-11-25 16:52:02,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:52:02,189 INFO L495 AbstractCegarLoop]: Abstraction has 20493 states and 27293 transitions. [2022-11-25 16:52:02,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:52:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 20493 states and 27293 transitions. [2022-11-25 16:52:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-25 16:52:02,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:52:02,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:52:02,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-25 16:52:02,191 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:52:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:52:02,191 INFO L85 PathProgramCache]: Analyzing trace with hash -108390554, now seen corresponding path program 1 times [2022-11-25 16:52:02,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:52:02,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778747013] [2022-11-25 16:52:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:52:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:52:02,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:52:02,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778747013] [2022-11-25 16:52:02,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778747013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:52:02,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:52:02,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:52:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610613020] [2022-11-25 16:52:02,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:52:02,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:52:02,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:52:02,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:52:02,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:52:02,262 INFO L87 Difference]: Start difference. First operand 20493 states and 27293 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:52:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:52:20,903 INFO L93 Difference]: Finished difference Result 41521 states and 55335 transitions. [2022-11-25 16:52:20,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:52:20,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-11-25 16:52:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:52:20,928 INFO L225 Difference]: With dead ends: 41521 [2022-11-25 16:52:20,928 INFO L226 Difference]: Without dead ends: 21135 [2022-11-25 16:52:20,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:52:20,942 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 86 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:52:20,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 289 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:52:20,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21135 states. [2022-11-25 16:52:39,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21135 to 21133. [2022-11-25 16:52:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21133 states, 21132 states have (on average 1.3150198750709825) internal successors, (27789), 21132 states have internal predecessors, (27789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:52:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21133 states to 21133 states and 27789 transitions. [2022-11-25 16:52:39,776 INFO L78 Accepts]: Start accepts. Automaton has 21133 states and 27789 transitions. Word has length 103 [2022-11-25 16:52:39,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:52:39,776 INFO L495 AbstractCegarLoop]: Abstraction has 21133 states and 27789 transitions. [2022-11-25 16:52:39,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:52:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 21133 states and 27789 transitions. [2022-11-25 16:52:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-25 16:52:39,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:52:39,780 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:52:39,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-25 16:52:39,781 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 16:52:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:52:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1221771837, now seen corresponding path program 1 times [2022-11-25 16:52:39,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:52:39,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284256022] [2022-11-25 16:52:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:39,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:52:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:52:40,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:52:40,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284256022] [2022-11-25 16:52:40,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284256022] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:52:40,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881074] [2022-11-25 16:52:40,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:40,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:52:40,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:52:40,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:52:40,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5bbeac8-2019-417f-8a98-725c72a280a8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:52:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:40,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 16:52:40,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:52:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:52:41,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:52:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:52:43,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881074] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:52:43,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:52:43,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-11-25 16:52:43,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991056360] [2022-11-25 16:52:43,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:52:43,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 16:52:43,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:52:43,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 16:52:43,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-11-25 16:52:43,063 INFO L87 Difference]: Start difference. First operand 21133 states and 27789 transitions. Second operand has 27 states, 27 states have (on average 11.481481481481481) internal successors, (310), 26 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:50,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:50,811 INFO L93 Difference]: Finished difference Result 339943 states and 435923 transitions. [2022-11-25 16:58:50,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 364 states. [2022-11-25 16:58:50,811 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 11.481481481481481) internal successors, (310), 26 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-11-25 16:58:50,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:51,595 INFO L225 Difference]: With dead ends: 339943 [2022-11-25 16:58:51,595 INFO L226 Difference]: Without dead ends: 318917 [2022-11-25 16:58:51,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 385 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65590 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=15537, Invalid=133845, Unknown=0, NotChecked=0, Total=149382 [2022-11-25 16:58:51,728 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 9719 mSDsluCounter, 6274 mSDsCounter, 0 mSdLazyCounter, 6104 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9719 SdHoareTripleChecker+Valid, 6615 SdHoareTripleChecker+Invalid, 6158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 6104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:51,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9719 Valid, 6615 Invalid, 6158 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 6104 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-25 16:58:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318917 states.