./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2018/Problem10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2018/Problem10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN --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 aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 --- 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-6b4ec56 [2022-11-20 11:46:52,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:46:52,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:46:52,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:46:52,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:46:52,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:46:52,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:46:52,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:46:52,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:46:52,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:46:52,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:46:52,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:46:52,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:46:52,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:46:52,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:46:52,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:46:52,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:46:52,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:46:52,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:46:52,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:46:52,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:46:52,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:46:52,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:46:52,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:46:52,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:46:52,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:46:52,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:46:52,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:46:52,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:46:52,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:46:52,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:46:52,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:46:52,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:46:52,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:46:52,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:46:52,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:46:52,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:46:52,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:46:52,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:46:52,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:46:52,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:46:52,633 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:46:52,655 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:46:52,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:46:52,656 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:46:52,656 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:46:52,657 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:46:52,657 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:46:52,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:46:52,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:46:52,659 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:46:52,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:46:52,659 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:46:52,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:46:52,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:46:52,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:46:52,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:46:52,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:46:52,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:46:52,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:46:52,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:46:52,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:46:52,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:46:52,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:46:52,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:46:52,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:46:52,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:46:52,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:46:52,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:46:52,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:46:52,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:46:52,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:46:52,665 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:46:52,665 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:46:52,666 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:46:52,666 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/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_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN 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 -> aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 [2022-11-20 11:46:53,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:46:53,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:46:53,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:46:53,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:46:53,072 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:46:53,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/eca-rers2018/Problem10.c [2022-11-20 11:46:56,167 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:46:56,561 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:46:56,561 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/sv-benchmarks/c/eca-rers2018/Problem10.c [2022-11-20 11:46:56,584 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/data/ceab89bed/341cff69159340a7b01acfe701562639/FLAG810d4c5df [2022-11-20 11:46:56,611 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/data/ceab89bed/341cff69159340a7b01acfe701562639 [2022-11-20 11:46:56,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:46:56,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:46:56,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:46:56,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:46:56,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:46:56,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:46:56" (1/1) ... [2022-11-20 11:46:56,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fef7c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:56, skipping insertion in model container [2022-11-20 11:46:56,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:46:56" (1/1) ... [2022-11-20 11:46:56,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:46:56,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:46:56,895 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_1c80a275-9d4f-4cff-92c6-474e42595559/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2022-11-20 11:46:56,902 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_1c80a275-9d4f-4cff-92c6-474e42595559/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2022-11-20 11:46:57,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:46:57,450 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:46:57,466 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_1c80a275-9d4f-4cff-92c6-474e42595559/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2022-11-20 11:46:57,468 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_1c80a275-9d4f-4cff-92c6-474e42595559/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2022-11-20 11:46:57,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:46:57,646 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:46:57,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57 WrapperNode [2022-11-20 11:46:57,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:46:57,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:46:57,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:46:57,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:46:57,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57" (1/1) ... [2022-11-20 11:46:57,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57" (1/1) ... [2022-11-20 11:46:57,851 INFO L138 Inliner]: procedures = 274, calls = 248, calls flagged for inlining = 144, calls inlined = 144, statements flattened = 865 [2022-11-20 11:46:57,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:46:57,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:46:57,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:46:57,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:46:57,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57" (1/1) ... [2022-11-20 11:46:57,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57" (1/1) ... [2022-11-20 11:46:57,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57" (1/1) ... [2022-11-20 11:46:57,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57" (1/1) ... [2022-11-20 11:46:57,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57" (1/1) ... [2022-11-20 11:46:57,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57" (1/1) ... [2022-11-20 11:46:57,920 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57" (1/1) ... [2022-11-20 11:46:57,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57" (1/1) ... [2022-11-20 11:46:57,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:46:57,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:46:57,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:46:57,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:46:57,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57" (1/1) ... [2022-11-20 11:46:57,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:46:57,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:46:58,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:46:58,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c80a275-9d4f-4cff-92c6-474e42595559/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:46:58,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:46:58,064 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2022-11-20 11:46:58,064 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2022-11-20 11:46:58,066 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2022-11-20 11:46:58,066 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2022-11-20 11:46:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:46:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:46:58,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:46:58,286 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:46:58,288 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:46:59,793 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:46:59,817 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:46:59,817 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 11:46:59,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:46:59 BoogieIcfgContainer [2022-11-20 11:46:59,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:46:59,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:46:59,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:46:59,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:46:59,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:46:56" (1/3) ... [2022-11-20 11:46:59,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252391a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:46:59, skipping insertion in model container [2022-11-20 11:46:59,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:46:57" (2/3) ... [2022-11-20 11:46:59,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252391a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:46:59, skipping insertion in model container [2022-11-20 11:46:59,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:46:59" (3/3) ... [2022-11-20 11:46:59,842 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10.c [2022-11-20 11:46:59,864 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:46:59,864 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 11:46:59,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:46:59,963 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;@149fe686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:46:59,964 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 11:46:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 468 states, 363 states have (on average 1.5922865013774106) internal successors, (578), 365 states have internal predecessors, (578), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2022-11-20 11:46:59,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:46:59,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:46:59,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:46:59,984 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:46:59,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:46:59,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1184212657, now seen corresponding path program 1 times [2022-11-20 11:46:59,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:46:59,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827010654] [2022-11-20 11:47:00,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:00,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:00,354 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-20 11:47:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:00,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827010654] [2022-11-20 11:47:00,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827010654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:00,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:00,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:00,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426852276] [2022-11-20 11:47:00,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:00,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:47:00,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:00,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:47:00,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:47:00,426 INFO L87 Difference]: Start difference. First operand has 468 states, 363 states have (on average 1.5922865013774106) internal successors, (578), 365 states have internal predecessors, (578), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:02,216 INFO L93 Difference]: Finished difference Result 1165 states and 2069 transitions. [2022-11-20 11:47:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:47:02,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 11:47:02,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:02,251 INFO L225 Difference]: With dead ends: 1165 [2022-11-20 11:47:02,251 INFO L226 Difference]: Without dead ends: 690 [2022-11-20 11:47:02,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:47:02,265 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 395 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:02,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 772 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-20 11:47:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-11-20 11:47:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 557. [2022-11-20 11:47:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 455 states have (on average 1.589010989010989) internal successors, (723), 554 states have internal predecessors, (723), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 823 transitions. [2022-11-20 11:47:02,349 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 823 transitions. Word has length 13 [2022-11-20 11:47:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:02,349 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 823 transitions. [2022-11-20 11:47:02,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 823 transitions. [2022-11-20 11:47:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:47:02,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:02,351 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] [2022-11-20 11:47:02,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:47:02,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash -249172658, now seen corresponding path program 1 times [2022-11-20 11:47:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:02,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037112633] [2022-11-20 11:47:02,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:02,452 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-20 11:47:02,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:02,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037112633] [2022-11-20 11:47:02,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037112633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:02,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:02,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346055618] [2022-11-20 11:47:02,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:02,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:47:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:02,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:47:02,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:47:02,456 INFO L87 Difference]: Start difference. First operand 557 states and 823 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:03,431 INFO L93 Difference]: Finished difference Result 1704 states and 2582 transitions. [2022-11-20 11:47:03,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:47:03,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 11:47:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:03,444 INFO L225 Difference]: With dead ends: 1704 [2022-11-20 11:47:03,444 INFO L226 Difference]: Without dead ends: 1149 [2022-11-20 11:47:03,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:47:03,447 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 866 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:03,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1116 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 11:47:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2022-11-20 11:47:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 888. [2022-11-20 11:47:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 786 states have (on average 1.5521628498727735) internal successors, (1220), 885 states have internal predecessors, (1220), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1320 transitions. [2022-11-20 11:47:03,532 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1320 transitions. Word has length 21 [2022-11-20 11:47:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:03,533 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1320 transitions. [2022-11-20 11:47:03,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:03,533 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1320 transitions. [2022-11-20 11:47:03,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:47:03,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:03,535 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] [2022-11-20 11:47:03,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:47:03,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1086962958, now seen corresponding path program 1 times [2022-11-20 11:47:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:03,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304381100] [2022-11-20 11:47:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:03,777 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-20 11:47:03,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:03,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304381100] [2022-11-20 11:47:03,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304381100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:03,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:03,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:03,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823182753] [2022-11-20 11:47:03,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:03,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:03,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:03,783 INFO L87 Difference]: Start difference. First operand 888 states and 1320 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:03,847 INFO L93 Difference]: Finished difference Result 2645 states and 3935 transitions. [2022-11-20 11:47:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:47:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:03,854 INFO L225 Difference]: With dead ends: 2645 [2022-11-20 11:47:03,855 INFO L226 Difference]: Without dead ends: 1759 [2022-11-20 11:47:03,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-20 11:47:03,858 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 461 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:03,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1255 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:47:03,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2022-11-20 11:47:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 888. [2022-11-20 11:47:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 786 states have (on average 1.5508905852417303) internal successors, (1219), 885 states have internal predecessors, (1219), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1319 transitions. [2022-11-20 11:47:03,897 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1319 transitions. Word has length 24 [2022-11-20 11:47:03,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:03,898 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1319 transitions. [2022-11-20 11:47:03,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1319 transitions. [2022-11-20 11:47:03,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:47:03,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:03,909 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] [2022-11-20 11:47:03,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:47:03,910 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1345128396, now seen corresponding path program 1 times [2022-11-20 11:47:03,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:03,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515054712] [2022-11-20 11:47:03,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:03,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:04,007 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-20 11:47:04,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:04,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515054712] [2022-11-20 11:47:04,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515054712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:04,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:04,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:04,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758080002] [2022-11-20 11:47:04,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:04,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:04,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:04,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:04,010 INFO L87 Difference]: Start difference. First operand 888 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:04,225 INFO L93 Difference]: Finished difference Result 2201 states and 3265 transitions. [2022-11-20 11:47:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:04,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:47:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:04,231 INFO L225 Difference]: With dead ends: 2201 [2022-11-20 11:47:04,231 INFO L226 Difference]: Without dead ends: 1315 [2022-11-20 11:47:04,233 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-20 11:47:04,245 INFO L413 NwaCegarLoop]: 941 mSDtfsCounter, 533 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:04,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1382 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:47:04,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2022-11-20 11:47:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1231. [2022-11-20 11:47:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1129 states have (on average 1.5491585473870682) internal successors, (1749), 1228 states have internal predecessors, (1749), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1849 transitions. [2022-11-20 11:47:04,294 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1849 transitions. Word has length 24 [2022-11-20 11:47:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:04,294 INFO L495 AbstractCegarLoop]: Abstraction has 1231 states and 1849 transitions. [2022-11-20 11:47:04,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1849 transitions. [2022-11-20 11:47:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:47:04,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:04,297 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] [2022-11-20 11:47:04,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:47:04,298 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:04,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash 500156944, now seen corresponding path program 1 times [2022-11-20 11:47:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:04,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834537024] [2022-11-20 11:47:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:04,380 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-20 11:47:04,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:04,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834537024] [2022-11-20 11:47:04,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834537024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:04,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:04,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:04,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447745471] [2022-11-20 11:47:04,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:04,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:04,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:04,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:04,384 INFO L87 Difference]: Start difference. First operand 1231 states and 1849 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:05,112 INFO L93 Difference]: Finished difference Result 3169 states and 4832 transitions. [2022-11-20 11:47:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:05,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:47:05,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:05,121 INFO L225 Difference]: With dead ends: 3169 [2022-11-20 11:47:05,121 INFO L226 Difference]: Without dead ends: 1940 [2022-11-20 11:47:05,124 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-20 11:47:05,128 INFO L413 NwaCegarLoop]: 656 mSDtfsCounter, 310 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:05,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 801 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:47:05,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2022-11-20 11:47:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1397. [2022-11-20 11:47:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1295 states have (on average 1.4517374517374517) internal successors, (1880), 1394 states have internal predecessors, (1880), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1980 transitions. [2022-11-20 11:47:05,184 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1980 transitions. Word has length 24 [2022-11-20 11:47:05,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:05,184 INFO L495 AbstractCegarLoop]: Abstraction has 1397 states and 1980 transitions. [2022-11-20 11:47:05,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1980 transitions. [2022-11-20 11:47:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:47:05,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:05,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] [2022-11-20 11:47:05,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:47:05,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:05,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:05,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221522, now seen corresponding path program 1 times [2022-11-20 11:47:05,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:05,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587361752] [2022-11-20 11:47:05,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:05,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:05,258 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-20 11:47:05,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:05,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587361752] [2022-11-20 11:47:05,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587361752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:05,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:05,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:47:05,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71272753] [2022-11-20 11:47:05,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:05,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:05,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:05,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:05,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:05,261 INFO L87 Difference]: Start difference. First operand 1397 states and 1980 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:05,394 INFO L93 Difference]: Finished difference Result 4140 states and 5880 transitions. [2022-11-20 11:47:05,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:05,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:47:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:05,403 INFO L225 Difference]: With dead ends: 4140 [2022-11-20 11:47:05,404 INFO L226 Difference]: Without dead ends: 2745 [2022-11-20 11:47:05,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-20 11:47:05,407 INFO L413 NwaCegarLoop]: 550 mSDtfsCounter, 510 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:05,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1073 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:47:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2022-11-20 11:47:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2657. [2022-11-20 11:47:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2555 states have (on average 1.4348336594911937) internal successors, (3666), 2654 states have internal predecessors, (3666), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3766 transitions. [2022-11-20 11:47:05,480 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3766 transitions. Word has length 24 [2022-11-20 11:47:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:05,480 INFO L495 AbstractCegarLoop]: Abstraction has 2657 states and 3766 transitions. [2022-11-20 11:47:05,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3766 transitions. [2022-11-20 11:47:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:47:05,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:05,481 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] [2022-11-20 11:47:05,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:47:05,482 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1417555436, now seen corresponding path program 1 times [2022-11-20 11:47:05,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:05,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330024123] [2022-11-20 11:47:05,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:05,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:05,551 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-20 11:47:05,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:05,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330024123] [2022-11-20 11:47:05,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330024123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:05,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:05,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:05,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480203525] [2022-11-20 11:47:05,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:05,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:05,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:05,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:05,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:05,553 INFO L87 Difference]: Start difference. First operand 2657 states and 3766 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:06,313 INFO L93 Difference]: Finished difference Result 6143 states and 8908 transitions. [2022-11-20 11:47:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:06,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:47:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:06,325 INFO L225 Difference]: With dead ends: 6143 [2022-11-20 11:47:06,325 INFO L226 Difference]: Without dead ends: 3488 [2022-11-20 11:47:06,329 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-20 11:47:06,330 INFO L413 NwaCegarLoop]: 538 mSDtfsCounter, 230 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:06,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 722 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:47:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2022-11-20 11:47:06,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3484. [2022-11-20 11:47:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3382 states have (on average 1.3746303962152573) internal successors, (4649), 3481 states have internal predecessors, (4649), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 4749 transitions. [2022-11-20 11:47:06,421 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 4749 transitions. Word has length 25 [2022-11-20 11:47:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:06,422 INFO L495 AbstractCegarLoop]: Abstraction has 3484 states and 4749 transitions. [2022-11-20 11:47:06,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 4749 transitions. [2022-11-20 11:47:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:47:06,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:06,423 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] [2022-11-20 11:47:06,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:47:06,424 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:06,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2032440408, now seen corresponding path program 1 times [2022-11-20 11:47:06,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:06,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322523239] [2022-11-20 11:47:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:06,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:06,459 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-20 11:47:06,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:06,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322523239] [2022-11-20 11:47:06,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322523239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:06,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:06,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:06,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404597304] [2022-11-20 11:47:06,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:06,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:06,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:06,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:06,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:06,462 INFO L87 Difference]: Start difference. First operand 3484 states and 4749 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:07,170 INFO L93 Difference]: Finished difference Result 7813 states and 10890 transitions. [2022-11-20 11:47:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:07,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:47:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:07,188 INFO L225 Difference]: With dead ends: 7813 [2022-11-20 11:47:07,189 INFO L226 Difference]: Without dead ends: 4331 [2022-11-20 11:47:07,197 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-20 11:47:07,199 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 299 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:07,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 682 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:47:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4331 states. [2022-11-20 11:47:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4331 to 4327. [2022-11-20 11:47:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 4225 states have (on average 1.353846153846154) internal successors, (5720), 4324 states have internal predecessors, (5720), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5820 transitions. [2022-11-20 11:47:07,358 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5820 transitions. Word has length 25 [2022-11-20 11:47:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:07,361 INFO L495 AbstractCegarLoop]: Abstraction has 4327 states and 5820 transitions. [2022-11-20 11:47:07,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5820 transitions. [2022-11-20 11:47:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:47:07,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:07,364 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] [2022-11-20 11:47:07,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:47:07,365 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:07,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:07,365 INFO L85 PathProgramCache]: Analyzing trace with hash -995255721, now seen corresponding path program 1 times [2022-11-20 11:47:07,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:07,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768682019] [2022-11-20 11:47:07,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:07,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:07,428 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-20 11:47:07,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768682019] [2022-11-20 11:47:07,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768682019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:07,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:07,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:07,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546203262] [2022-11-20 11:47:07,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:07,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:07,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:07,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:07,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:07,433 INFO L87 Difference]: Start difference. First operand 4327 states and 5820 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:07,548 INFO L93 Difference]: Finished difference Result 8549 states and 11509 transitions. [2022-11-20 11:47:07,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:07,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:47:07,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:07,598 INFO L225 Difference]: With dead ends: 8549 [2022-11-20 11:47:07,598 INFO L226 Difference]: Without dead ends: 8542 [2022-11-20 11:47:07,601 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-20 11:47:07,604 INFO L413 NwaCegarLoop]: 1005 mSDtfsCounter, 548 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:07,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1555 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:47:07,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8542 states. [2022-11-20 11:47:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8542 to 8441. [2022-11-20 11:47:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8441 states, 8339 states have (on average 1.3492025422712555) internal successors, (11251), 8438 states have internal predecessors, (11251), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8441 states to 8441 states and 11351 transitions. [2022-11-20 11:47:07,865 INFO L78 Accepts]: Start accepts. Automaton has 8441 states and 11351 transitions. Word has length 26 [2022-11-20 11:47:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:07,865 INFO L495 AbstractCegarLoop]: Abstraction has 8441 states and 11351 transitions. [2022-11-20 11:47:07,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 8441 states and 11351 transitions. [2022-11-20 11:47:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:47:07,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:07,866 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] [2022-11-20 11:47:07,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:47:07,866 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:07,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:07,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1419566957, now seen corresponding path program 1 times [2022-11-20 11:47:07,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:07,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704821613] [2022-11-20 11:47:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:07,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:07,983 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-20 11:47:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:07,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704821613] [2022-11-20 11:47:07,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704821613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:07,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:07,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:47:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004479271] [2022-11-20 11:47:07,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:07,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:07,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:07,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:07,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:07,990 INFO L87 Difference]: Start difference. First operand 8441 states and 11351 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:08,171 INFO L93 Difference]: Finished difference Result 16979 states and 22797 transitions. [2022-11-20 11:47:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:08,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:47:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:08,197 INFO L225 Difference]: With dead ends: 16979 [2022-11-20 11:47:08,197 INFO L226 Difference]: Without dead ends: 8540 [2022-11-20 11:47:08,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-20 11:47:08,210 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 533 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:08,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1209 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:47:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8540 states. [2022-11-20 11:47:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8540 to 8439. [2022-11-20 11:47:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8439 states, 8339 states have (on average 1.3441659671423432) internal successors, (11209), 8436 states have internal predecessors, (11209), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 11307 transitions. [2022-11-20 11:47:08,471 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 11307 transitions. Word has length 26 [2022-11-20 11:47:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:08,471 INFO L495 AbstractCegarLoop]: Abstraction has 8439 states and 11307 transitions. [2022-11-20 11:47:08,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 11307 transitions. [2022-11-20 11:47:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 11:47:08,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:08,473 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] [2022-11-20 11:47:08,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:47:08,473 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:08,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:08,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1314457887, now seen corresponding path program 1 times [2022-11-20 11:47:08,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:08,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585020285] [2022-11-20 11:47:08,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:08,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:08,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-20 11:47:08,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:08,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585020285] [2022-11-20 11:47:08,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585020285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:08,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:08,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:47:08,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194213879] [2022-11-20 11:47:08,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:08,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:08,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:08,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:08,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:08,525 INFO L87 Difference]: Start difference. First operand 8439 states and 11307 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:08,824 INFO L93 Difference]: Finished difference Result 25142 states and 33722 transitions. [2022-11-20 11:47:08,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:08,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-20 11:47:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:08,873 INFO L225 Difference]: With dead ends: 25142 [2022-11-20 11:47:08,873 INFO L226 Difference]: Without dead ends: 16705 [2022-11-20 11:47:08,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-20 11:47:08,882 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 526 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:08,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1108 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:47:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16705 states. [2022-11-20 11:47:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16705 to 16607. [2022-11-20 11:47:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16607 states, 16507 states have (on average 1.3390076937057007) internal successors, (22103), 16604 states have internal predecessors, (22103), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16607 states to 16607 states and 22201 transitions. [2022-11-20 11:47:09,277 INFO L78 Accepts]: Start accepts. Automaton has 16607 states and 22201 transitions. Word has length 28 [2022-11-20 11:47:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:09,277 INFO L495 AbstractCegarLoop]: Abstraction has 16607 states and 22201 transitions. [2022-11-20 11:47:09,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 16607 states and 22201 transitions. [2022-11-20 11:47:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 11:47:09,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:09,279 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] [2022-11-20 11:47:09,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:47:09,279 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1594983404, now seen corresponding path program 1 times [2022-11-20 11:47:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:09,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267986734] [2022-11-20 11:47:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:09,377 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-20 11:47:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:09,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267986734] [2022-11-20 11:47:09,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267986734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:09,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:09,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:09,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718662653] [2022-11-20 11:47:09,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:09,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:09,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:09,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:09,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:09,380 INFO L87 Difference]: Start difference. First operand 16607 states and 22201 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:10,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:10,101 INFO L93 Difference]: Finished difference Result 48238 states and 64732 transitions. [2022-11-20 11:47:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:10,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-20 11:47:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:10,187 INFO L225 Difference]: With dead ends: 48238 [2022-11-20 11:47:10,187 INFO L226 Difference]: Without dead ends: 31633 [2022-11-20 11:47:10,211 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-20 11:47:10,212 INFO L413 NwaCegarLoop]: 858 mSDtfsCounter, 504 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:10,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1352 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:47:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31633 states. [2022-11-20 11:47:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31633 to 31544. [2022-11-20 11:47:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31544 states, 31444 states have (on average 1.3317644065640504) internal successors, (41876), 31541 states have internal predecessors, (41876), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31544 states to 31544 states and 41974 transitions. [2022-11-20 11:47:11,065 INFO L78 Accepts]: Start accepts. Automaton has 31544 states and 41974 transitions. Word has length 33 [2022-11-20 11:47:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:11,065 INFO L495 AbstractCegarLoop]: Abstraction has 31544 states and 41974 transitions. [2022-11-20 11:47:11,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 31544 states and 41974 transitions. [2022-11-20 11:47:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 11:47:11,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:11,067 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] [2022-11-20 11:47:11,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:47:11,068 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash 132362279, now seen corresponding path program 1 times [2022-11-20 11:47:11,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:11,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052539212] [2022-11-20 11:47:11,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:11,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:11,221 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-20 11:47:11,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:11,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052539212] [2022-11-20 11:47:11,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052539212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:11,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:11,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:11,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394689507] [2022-11-20 11:47:11,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:11,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:11,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:11,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:11,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:11,225 INFO L87 Difference]: Start difference. First operand 31544 states and 41974 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:11,878 INFO L93 Difference]: Finished difference Result 73175 states and 97409 transitions. [2022-11-20 11:47:11,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:11,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 11:47:11,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:11,987 INFO L225 Difference]: With dead ends: 73175 [2022-11-20 11:47:11,987 INFO L226 Difference]: Without dead ends: 41633 [2022-11-20 11:47:12,014 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-20 11:47:12,016 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 483 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:12,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 965 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:47:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41633 states. [2022-11-20 11:47:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41633 to 41551. [2022-11-20 11:47:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41551 states, 41451 states have (on average 1.3153603049383609) internal successors, (54523), 41548 states have internal predecessors, (54523), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41551 states to 41551 states and 54621 transitions. [2022-11-20 11:47:12,883 INFO L78 Accepts]: Start accepts. Automaton has 41551 states and 54621 transitions. Word has length 34 [2022-11-20 11:47:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:12,884 INFO L495 AbstractCegarLoop]: Abstraction has 41551 states and 54621 transitions. [2022-11-20 11:47:12,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 41551 states and 54621 transitions. [2022-11-20 11:47:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 11:47:12,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:12,886 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] [2022-11-20 11:47:12,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:47:12,886 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash -209128006, now seen corresponding path program 1 times [2022-11-20 11:47:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:12,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062491717] [2022-11-20 11:47:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:12,943 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-20 11:47:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:12,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062491717] [2022-11-20 11:47:12,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062491717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:12,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:12,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:12,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721124814] [2022-11-20 11:47:12,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:12,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:12,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:12,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:12,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:12,946 INFO L87 Difference]: Start difference. First operand 41551 states and 54621 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:13,973 INFO L93 Difference]: Finished difference Result 105458 states and 138388 transitions. [2022-11-20 11:47:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:13,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-20 11:47:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:14,122 INFO L225 Difference]: With dead ends: 105458 [2022-11-20 11:47:14,122 INFO L226 Difference]: Without dead ends: 63909 [2022-11-20 11:47:14,147 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-20 11:47:14,148 INFO L413 NwaCegarLoop]: 980 mSDtfsCounter, 440 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:14,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1445 Invalid, 161 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:47:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63909 states. [2022-11-20 11:47:15,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63909 to 59950. [2022-11-20 11:47:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59950 states, 59850 states have (on average 1.2822222222222222) internal successors, (76741), 59947 states have internal predecessors, (76741), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 76839 transitions. [2022-11-20 11:47:15,479 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 76839 transitions. Word has length 40 [2022-11-20 11:47:15,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:15,479 INFO L495 AbstractCegarLoop]: Abstraction has 59950 states and 76839 transitions. [2022-11-20 11:47:15,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 76839 transitions. [2022-11-20 11:47:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 11:47:15,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:15,481 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] [2022-11-20 11:47:15,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:47:15,481 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:15,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1653138166, now seen corresponding path program 1 times [2022-11-20 11:47:15,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:15,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519508240] [2022-11-20 11:47:15,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:15,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:15,574 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-20 11:47:15,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:15,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519508240] [2022-11-20 11:47:15,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519508240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:15,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:15,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:47:15,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692645184] [2022-11-20 11:47:15,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:15,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:15,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:15,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:15,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:15,578 INFO L87 Difference]: Start difference. First operand 59950 states and 76839 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:17,003 INFO L93 Difference]: Finished difference Result 157117 states and 202813 transitions. [2022-11-20 11:47:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:17,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-20 11:47:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:17,317 INFO L225 Difference]: With dead ends: 157117 [2022-11-20 11:47:17,317 INFO L226 Difference]: Without dead ends: 97169 [2022-11-20 11:47:17,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-20 11:47:17,354 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 450 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:17,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 984 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:47:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97169 states. [2022-11-20 11:47:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97169 to 97090. [2022-11-20 11:47:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97090 states, 96990 states have (on average 1.274615939787607) internal successors, (123625), 97087 states have internal predecessors, (123625), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97090 states to 97090 states and 123723 transitions. [2022-11-20 11:47:19,295 INFO L78 Accepts]: Start accepts. Automaton has 97090 states and 123723 transitions. Word has length 40 [2022-11-20 11:47:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:19,296 INFO L495 AbstractCegarLoop]: Abstraction has 97090 states and 123723 transitions. [2022-11-20 11:47:19,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 97090 states and 123723 transitions. [2022-11-20 11:47:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 11:47:19,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:19,297 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] [2022-11-20 11:47:19,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:47:19,297 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:19,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1240470838, now seen corresponding path program 1 times [2022-11-20 11:47:19,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:19,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220904276] [2022-11-20 11:47:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:19,370 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-20 11:47:19,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:19,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220904276] [2022-11-20 11:47:19,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220904276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:19,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:19,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:19,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474247143] [2022-11-20 11:47:19,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:19,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:19,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:19,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:19,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:19,373 INFO L87 Difference]: Start difference. First operand 97090 states and 123723 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:20,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:20,788 INFO L93 Difference]: Finished difference Result 174054 states and 221151 transitions. [2022-11-20 11:47:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:20,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-20 11:47:20,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:21,259 INFO L225 Difference]: With dead ends: 174054 [2022-11-20 11:47:21,259 INFO L226 Difference]: Without dead ends: 174051 [2022-11-20 11:47:21,299 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-20 11:47:21,300 INFO L413 NwaCegarLoop]: 1036 mSDtfsCounter, 527 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:21,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1576 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:47:21,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174051 states. [2022-11-20 11:47:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174051 to 173830. [2022-11-20 11:47:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173830 states, 173730 states have (on average 1.269723133598112) internal successors, (220589), 173827 states have internal predecessors, (220589), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173830 states to 173830 states and 220687 transitions. [2022-11-20 11:47:24,479 INFO L78 Accepts]: Start accepts. Automaton has 173830 states and 220687 transitions. Word has length 45 [2022-11-20 11:47:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:24,480 INFO L495 AbstractCegarLoop]: Abstraction has 173830 states and 220687 transitions. [2022-11-20 11:47:24,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 173830 states and 220687 transitions. [2022-11-20 11:47:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 11:47:24,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:24,481 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] [2022-11-20 11:47:24,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:47:24,482 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:24,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1976305641, now seen corresponding path program 1 times [2022-11-20 11:47:24,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:24,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779093607] [2022-11-20 11:47:24,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:24,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:24,573 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-20 11:47:24,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:24,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779093607] [2022-11-20 11:47:24,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779093607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:24,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:24,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:24,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012818423] [2022-11-20 11:47:24,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:24,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:47:24,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:24,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:47:24,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:47:24,576 INFO L87 Difference]: Start difference. First operand 173830 states and 220687 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:28,266 INFO L93 Difference]: Finished difference Result 454683 states and 576582 transitions. [2022-11-20 11:47:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:47:28,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-20 11:47:28,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:28,796 INFO L225 Difference]: With dead ends: 454683 [2022-11-20 11:47:28,797 INFO L226 Difference]: Without dead ends: 280855 [2022-11-20 11:47:28,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:47:28,940 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 753 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:28,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 725 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 11:47:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280855 states. [2022-11-20 11:47:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280855 to 173825. [2022-11-20 11:47:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173825 states, 173730 states have (on average 1.2597075922408334) internal successors, (218849), 173822 states have internal predecessors, (218849), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173825 states to 173825 states and 218942 transitions. [2022-11-20 11:47:32,104 INFO L78 Accepts]: Start accepts. Automaton has 173825 states and 218942 transitions. Word has length 48 [2022-11-20 11:47:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:32,105 INFO L495 AbstractCegarLoop]: Abstraction has 173825 states and 218942 transitions. [2022-11-20 11:47:32,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 173825 states and 218942 transitions. [2022-11-20 11:47:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 11:47:32,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:32,107 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] [2022-11-20 11:47:32,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 11:47:32,107 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:32,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash 951319779, now seen corresponding path program 1 times [2022-11-20 11:47:32,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:32,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481264393] [2022-11-20 11:47:32,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:32,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:32,167 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-20 11:47:32,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:32,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481264393] [2022-11-20 11:47:32,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481264393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:32,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:32,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:32,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876712636] [2022-11-20 11:47:32,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:32,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:32,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:32,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:32,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:32,170 INFO L87 Difference]: Start difference. First operand 173825 states and 218942 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:34,263 INFO L93 Difference]: Finished difference Result 343392 states and 432799 transitions. [2022-11-20 11:47:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:34,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 11:47:34,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:35,218 INFO L225 Difference]: With dead ends: 343392 [2022-11-20 11:47:35,235 INFO L226 Difference]: Without dead ends: 169569 [2022-11-20 11:47:35,355 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-20 11:47:35,356 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 389 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:35,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 361 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 11:47:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169569 states. [2022-11-20 11:47:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169569 to 89809. [2022-11-20 11:47:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89809 states, 89714 states have (on average 1.2017299418151013) internal successors, (107812), 89806 states have internal predecessors, (107812), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89809 states to 89809 states and 107905 transitions. [2022-11-20 11:47:37,330 INFO L78 Accepts]: Start accepts. Automaton has 89809 states and 107905 transitions. Word has length 58 [2022-11-20 11:47:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:37,330 INFO L495 AbstractCegarLoop]: Abstraction has 89809 states and 107905 transitions. [2022-11-20 11:47:37,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 89809 states and 107905 transitions. [2022-11-20 11:47:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-20 11:47:37,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:37,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:47:37,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 11:47:37,333 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:37,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:37,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1754865588, now seen corresponding path program 1 times [2022-11-20 11:47:37,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:37,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885006975] [2022-11-20 11:47:37,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:37,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:37,443 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-20 11:47:37,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:37,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885006975] [2022-11-20 11:47:37,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885006975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:37,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:37,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:37,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28087540] [2022-11-20 11:47:37,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:37,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:37,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:37,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:37,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:37,446 INFO L87 Difference]: Start difference. First operand 89809 states and 107905 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:37,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:37,952 INFO L93 Difference]: Finished difference Result 128298 states and 153371 transitions. [2022-11-20 11:47:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:37,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-11-20 11:47:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:38,111 INFO L225 Difference]: With dead ends: 128298 [2022-11-20 11:47:38,111 INFO L226 Difference]: Without dead ends: 128293 [2022-11-20 11:47:38,144 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-20 11:47:38,145 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 445 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:38,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1264 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:47:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128293 states. [2022-11-20 11:47:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128293 to 128079. [2022-11-20 11:47:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128079 states, 127984 states have (on average 1.1906722715339417) internal successors, (152387), 128076 states have internal predecessors, (152387), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128079 states to 128079 states and 152480 transitions. [2022-11-20 11:47:40,395 INFO L78 Accepts]: Start accepts. Automaton has 128079 states and 152480 transitions. Word has length 113 [2022-11-20 11:47:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:40,395 INFO L495 AbstractCegarLoop]: Abstraction has 128079 states and 152480 transitions. [2022-11-20 11:47:40,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 128079 states and 152480 transitions. [2022-11-20 11:47:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-20 11:47:40,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:40,398 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:47:40,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 11:47:40,399 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash 149557454, now seen corresponding path program 1 times [2022-11-20 11:47:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:40,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941832461] [2022-11-20 11:47:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:47:40,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:40,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941832461] [2022-11-20 11:47:40,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941832461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:40,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:40,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:40,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439227165] [2022-11-20 11:47:40,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:40,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:40,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:40,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:40,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:40,493 INFO L87 Difference]: Start difference. First operand 128079 states and 152480 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:42,455 INFO L93 Difference]: Finished difference Result 275491 states and 332198 transitions. [2022-11-20 11:47:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-11-20 11:47:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:42,658 INFO L225 Difference]: With dead ends: 275491 [2022-11-20 11:47:42,659 INFO L226 Difference]: Without dead ends: 147535 [2022-11-20 11:47:42,710 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-20 11:47:42,711 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 323 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:42,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 518 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:47:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147535 states. [2022-11-20 11:47:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147535 to 147227. [2022-11-20 11:47:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147227 states, 147132 states have (on average 1.1926773237636952) internal successors, (175481), 147224 states have internal predecessors, (175481), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147227 states to 147227 states and 175574 transitions. [2022-11-20 11:47:44,810 INFO L78 Accepts]: Start accepts. Automaton has 147227 states and 175574 transitions. Word has length 144 [2022-11-20 11:47:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:47:44,811 INFO L495 AbstractCegarLoop]: Abstraction has 147227 states and 175574 transitions. [2022-11-20 11:47:44,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 147227 states and 175574 transitions. [2022-11-20 11:47:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-20 11:47:44,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:47:44,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:47:44,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 11:47:44,815 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:47:44,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:47:44,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1572407842, now seen corresponding path program 1 times [2022-11-20 11:47:44,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:47:44,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124838954] [2022-11-20 11:47:44,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:47:44,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:47:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:47:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 11:47:46,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:47:46,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124838954] [2022-11-20 11:47:46,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124838954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:47:46,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:47:46,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:47:46,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942057720] [2022-11-20 11:47:46,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:47:46,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:47:46,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:47:46,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:47:46,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:47:46,098 INFO L87 Difference]: Start difference. First operand 147227 states and 175574 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:47:48,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:47:48,263 INFO L93 Difference]: Finished difference Result 424126 states and 506087 transitions. [2022-11-20 11:47:48,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:47:48,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2022-11-20 11:47:48,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:47:48,611 INFO L225 Difference]: With dead ends: 424126 [2022-11-20 11:47:48,611 INFO L226 Difference]: Without dead ends: 277022 [2022-11-20 11:47:48,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-20 11:47:48,668 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 513 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:47:48,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 916 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:47:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277022 states.