./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 17:49:11,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 17:49:11,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 17:49:11,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 17:49:11,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 17:49:11,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 17:49:11,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 17:49:11,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 17:49:11,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 17:49:11,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 17:49:11,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 17:49:11,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 17:49:11,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 17:49:11,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 17:49:11,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 17:49:11,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 17:49:11,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 17:49:11,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 17:49:11,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 17:49:11,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 17:49:11,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 17:49:11,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 17:49:11,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 17:49:11,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 17:49:11,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 17:49:11,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 17:49:11,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 17:49:11,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 17:49:11,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 17:49:11,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 17:49:11,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 17:49:11,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 17:49:11,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 17:49:11,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 17:49:11,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 17:49:11,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 17:49:11,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 17:49:11,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 17:49:11,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 17:49:11,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 17:49:11,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 17:49:11,670 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 17:49:11,712 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 17:49:11,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 17:49:11,713 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 17:49:11,713 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 17:49:11,714 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 17:49:11,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 17:49:11,721 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 17:49:11,721 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 17:49:11,721 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 17:49:11,721 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 17:49:11,722 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 17:49:11,723 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 17:49:11,723 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 17:49:11,723 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 17:49:11,723 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 17:49:11,724 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 17:49:11,724 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 17:49:11,724 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 17:49:11,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 17:49:11,725 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 17:49:11,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 17:49:11,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 17:49:11,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 17:49:11,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 17:49:11,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 17:49:11,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 17:49:11,728 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 17:49:11,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 17:49:11,728 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 17:49:11,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 17:49:11,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 17:49:11,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 17:49:11,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 17:49:11,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 17:49:11,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 17:49:11,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 17:49:11,730 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 17:49:11,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 17:49:11,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 17:49:11,730 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 17:49:11,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 17:49:11,731 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/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_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7 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 -> Taipan 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 -> f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161 [2021-11-25 17:49:12,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 17:49:12,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 17:49:12,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 17:49:12,061 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 17:49:12,062 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 17:49:12,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2021-11-25 17:49:12,137 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/data/676e01d8d/53747e8d2fe8462fb312f9b317f44a92/FLAGdf55135fd [2021-11-25 17:49:12,783 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 17:49:12,783 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2021-11-25 17:49:12,797 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/data/676e01d8d/53747e8d2fe8462fb312f9b317f44a92/FLAGdf55135fd [2021-11-25 17:49:13,025 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/data/676e01d8d/53747e8d2fe8462fb312f9b317f44a92 [2021-11-25 17:49:13,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 17:49:13,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 17:49:13,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 17:49:13,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 17:49:13,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 17:49:13,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:49:13" (1/1) ... [2021-11-25 17:49:13,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@687843b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13, skipping insertion in model container [2021-11-25 17:49:13,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:49:13" (1/1) ... [2021-11-25 17:49:13,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 17:49:13,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 17:49:13,460 WARN L230 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_ecd0c59e-ba09-4076-a348-633f6e617f09/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325] [2021-11-25 17:49:13,518 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 17:49:13,527 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 17:49:13,602 WARN L230 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_ecd0c59e-ba09-4076-a348-633f6e617f09/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325] [2021-11-25 17:49:13,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 17:49:13,653 INFO L208 MainTranslator]: Completed translation [2021-11-25 17:49:13,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13 WrapperNode [2021-11-25 17:49:13,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 17:49:13,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 17:49:13,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 17:49:13,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 17:49:13,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13" (1/1) ... [2021-11-25 17:49:13,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13" (1/1) ... [2021-11-25 17:49:13,745 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2021-11-25 17:49:13,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 17:49:13,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 17:49:13,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 17:49:13,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 17:49:13,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13" (1/1) ... [2021-11-25 17:49:13,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13" (1/1) ... [2021-11-25 17:49:13,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13" (1/1) ... [2021-11-25 17:49:13,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13" (1/1) ... [2021-11-25 17:49:13,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13" (1/1) ... [2021-11-25 17:49:13,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13" (1/1) ... [2021-11-25 17:49:13,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13" (1/1) ... [2021-11-25 17:49:13,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 17:49:13,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 17:49:13,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 17:49:13,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 17:49:13,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13" (1/1) ... [2021-11-25 17:49:13,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 17:49:13,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 17:49:13,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 17:49:13,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 17:49:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 17:49:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 17:49:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 17:49:13,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 17:49:14,036 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 17:49:14,037 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 17:49:14,988 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 17:49:15,365 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 17:49:15,366 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-25 17:49:15,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:49:15 BoogieIcfgContainer [2021-11-25 17:49:15,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 17:49:15,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 17:49:15,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 17:49:15,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 17:49:15,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:49:13" (1/3) ... [2021-11-25 17:49:15,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7d9b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:49:15, skipping insertion in model container [2021-11-25 17:49:15,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:13" (2/3) ... [2021-11-25 17:49:15,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7d9b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:49:15, skipping insertion in model container [2021-11-25 17:49:15,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:49:15" (3/3) ... [2021-11-25 17:49:15,381 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label16.c [2021-11-25 17:49:15,386 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 17:49:15,387 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 17:49:15,434 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 17:49:15,441 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 17:49:15,441 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-25 17:49:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 83 states have (on average 1.9518072289156627) internal successors, (162), 84 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-25 17:49:15,466 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 17:49:15,467 INFO L514 BasicCegarLoop]: 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] [2021-11-25 17:49:15,467 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 17:49:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 17:49:15,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1243318963, now seen corresponding path program 1 times [2021-11-25 17:49:15,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 17:49:15,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598399799] [2021-11-25 17:49:15,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 17:49:15,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 17:49:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 17:49:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 17:49:15,870 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 17:49:15,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598399799] [2021-11-25 17:49:15,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598399799] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 17:49:15,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 17:49:15,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 17:49:15,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617184392] [2021-11-25 17:49:15,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 17:49:15,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 17:49:15,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 17:49:15,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 17:49:15,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 17:49:15,919 INFO L87 Difference]: Start difference. First operand has 85 states, 83 states have (on average 1.9518072289156627) internal successors, (162), 84 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 17:49:16,422 INFO L93 Difference]: Finished difference Result 251 states and 482 transitions. [2021-11-25 17:49:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 17:49:16,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-25 17:49:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 17:49:16,443 INFO L225 Difference]: With dead ends: 251 [2021-11-25 17:49:16,444 INFO L226 Difference]: Without dead ends: 163 [2021-11-25 17:49:16,450 INFO L932 BasicCegarLoop]: 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 [2021-11-25 17:49:16,454 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 58 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 17:49:16,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 11 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 17:49:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-25 17:49:16,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-11-25 17:49:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.9320987654320987) internal successors, (313), 162 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 313 transitions. [2021-11-25 17:49:16,512 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 313 transitions. Word has length 80 [2021-11-25 17:49:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 17:49:16,513 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 313 transitions. [2021-11-25 17:49:16,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 313 transitions. [2021-11-25 17:49:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-25 17:49:16,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 17:49:16,518 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 17:49:16,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 17:49:16,519 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 17:49:16,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 17:49:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1299318681, now seen corresponding path program 1 times [2021-11-25 17:49:16,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 17:49:16,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508031335] [2021-11-25 17:49:16,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 17:49:16,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 17:49:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 17:49:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 17:49:16,623 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 17:49:16,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508031335] [2021-11-25 17:49:16,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508031335] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 17:49:16,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 17:49:16,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 17:49:16,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189541306] [2021-11-25 17:49:16,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 17:49:16,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 17:49:16,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 17:49:16,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 17:49:16,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 17:49:16,627 INFO L87 Difference]: Start difference. First operand 163 states and 313 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 17:49:17,096 INFO L93 Difference]: Finished difference Result 485 states and 936 transitions. [2021-11-25 17:49:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 17:49:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-25 17:49:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 17:49:17,100 INFO L225 Difference]: With dead ends: 485 [2021-11-25 17:49:17,101 INFO L226 Difference]: Without dead ends: 323 [2021-11-25 17:49:17,102 INFO L932 BasicCegarLoop]: 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 [2021-11-25 17:49:17,104 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 17:49:17,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 21 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 17:49:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-11-25 17:49:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 243. [2021-11-25 17:49:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 1.871900826446281) internal successors, (453), 242 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 453 transitions. [2021-11-25 17:49:17,131 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 453 transitions. Word has length 91 [2021-11-25 17:49:17,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 17:49:17,131 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 453 transitions. [2021-11-25 17:49:17,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 453 transitions. [2021-11-25 17:49:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-25 17:49:17,137 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 17:49:17,138 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2021-11-25 17:49:17,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 17:49:17,138 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 17:49:17,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 17:49:17,139 INFO L85 PathProgramCache]: Analyzing trace with hash 726145234, now seen corresponding path program 1 times [2021-11-25 17:49:17,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 17:49:17,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415583806] [2021-11-25 17:49:17,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 17:49:17,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 17:49:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 17:49:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 17:49:17,242 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 17:49:17,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415583806] [2021-11-25 17:49:17,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415583806] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 17:49:17,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 17:49:17,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 17:49:17,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581761674] [2021-11-25 17:49:17,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 17:49:17,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 17:49:17,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 17:49:17,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 17:49:17,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 17:49:17,246 INFO L87 Difference]: Start difference. First operand 243 states and 453 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 17:49:17,678 INFO L93 Difference]: Finished difference Result 727 states and 1357 transitions. [2021-11-25 17:49:17,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 17:49:17,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-25 17:49:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 17:49:17,683 INFO L225 Difference]: With dead ends: 727 [2021-11-25 17:49:17,683 INFO L226 Difference]: Without dead ends: 485 [2021-11-25 17:49:17,686 INFO L932 BasicCegarLoop]: 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 [2021-11-25 17:49:17,688 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 81 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 17:49:17,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 63 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 17:49:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-11-25 17:49:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 483. [2021-11-25 17:49:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.7821576763485478) internal successors, (859), 482 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 859 transitions. [2021-11-25 17:49:17,730 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 859 transitions. Word has length 98 [2021-11-25 17:49:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 17:49:17,731 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 859 transitions. [2021-11-25 17:49:17,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 859 transitions. [2021-11-25 17:49:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-25 17:49:17,738 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 17:49:17,739 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2021-11-25 17:49:17,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 17:49:17,739 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 17:49:17,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 17:49:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash 65840519, now seen corresponding path program 1 times [2021-11-25 17:49:17,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 17:49:17,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226915479] [2021-11-25 17:49:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 17:49:17,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 17:49:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 17:49:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-25 17:49:17,837 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 17:49:17,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226915479] [2021-11-25 17:49:17,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226915479] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 17:49:17,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 17:49:17,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 17:49:17,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139274237] [2021-11-25 17:49:17,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 17:49:17,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 17:49:17,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 17:49:17,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 17:49:17,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 17:49:17,841 INFO L87 Difference]: Start difference. First operand 483 states and 859 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:18,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 17:49:18,278 INFO L93 Difference]: Finished difference Result 1205 states and 2153 transitions. [2021-11-25 17:49:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 17:49:18,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-11-25 17:49:18,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 17:49:18,284 INFO L225 Difference]: With dead ends: 1205 [2021-11-25 17:49:18,284 INFO L226 Difference]: Without dead ends: 723 [2021-11-25 17:49:18,285 INFO L932 BasicCegarLoop]: 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 [2021-11-25 17:49:18,287 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 17:49:18,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 66 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 17:49:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-11-25 17:49:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 643. [2021-11-25 17:49:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.6261682242990654) internal successors, (1044), 642 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1044 transitions. [2021-11-25 17:49:18,326 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1044 transitions. Word has length 102 [2021-11-25 17:49:18,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 17:49:18,326 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 1044 transitions. [2021-11-25 17:49:18,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:18,327 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1044 transitions. [2021-11-25 17:49:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-25 17:49:18,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 17:49:18,330 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 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] [2021-11-25 17:49:18,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 17:49:18,331 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 17:49:18,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 17:49:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1772707724, now seen corresponding path program 1 times [2021-11-25 17:49:18,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 17:49:18,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370353258] [2021-11-25 17:49:18,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 17:49:18,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 17:49:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 17:49:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-25 17:49:18,454 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 17:49:18,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370353258] [2021-11-25 17:49:18,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370353258] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 17:49:18,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 17:49:18,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 17:49:18,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391748679] [2021-11-25 17:49:18,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 17:49:18,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 17:49:18,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 17:49:18,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 17:49:18,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 17:49:18,457 INFO L87 Difference]: Start difference. First operand 643 states and 1044 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 17:49:18,894 INFO L93 Difference]: Finished difference Result 1765 states and 2944 transitions. [2021-11-25 17:49:18,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 17:49:18,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-25 17:49:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 17:49:18,902 INFO L225 Difference]: With dead ends: 1765 [2021-11-25 17:49:18,902 INFO L226 Difference]: Without dead ends: 1123 [2021-11-25 17:49:18,904 INFO L932 BasicCegarLoop]: 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 [2021-11-25 17:49:18,905 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 79 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 17:49:18,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 137 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 17:49:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2021-11-25 17:49:18,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2021-11-25 17:49:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.4402852049910873) internal successors, (1616), 1122 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1616 transitions. [2021-11-25 17:49:18,943 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1616 transitions. Word has length 107 [2021-11-25 17:49:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 17:49:18,944 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1616 transitions. [2021-11-25 17:49:18,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 17:49:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1616 transitions. [2021-11-25 17:49:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-25 17:49:18,947 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 17:49:18,947 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2021-11-25 17:49:18,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 17:49:18,948 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 17:49:18,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 17:49:18,949 INFO L85 PathProgramCache]: Analyzing trace with hash 91157537, now seen corresponding path program 1 times [2021-11-25 17:49:18,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 17:49:18,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159317939] [2021-11-25 17:49:18,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 17:49:18,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 17:49:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 17:49:18,987 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-25 17:49:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 17:49:19,056 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-25 17:49:19,057 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-25 17:49:19,058 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-25 17:49:19,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 17:49:19,064 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-11-25 17:49:19,067 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 17:49:19,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:49:19 BoogieIcfgContainer [2021-11-25 17:49:19,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 17:49:19,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 17:49:19,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 17:49:19,184 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 17:49:19,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:49:15" (3/4) ... [2021-11-25 17:49:19,186 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-25 17:49:19,292 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/witness.graphml [2021-11-25 17:49:19,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 17:49:19,294 INFO L158 Benchmark]: Toolchain (without parser) took 6264.11ms. Allocated memory was 104.9MB in the beginning and 169.9MB in the end (delta: 65.0MB). Free memory was 70.6MB in the beginning and 56.4MB in the end (delta: 14.2MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2021-11-25 17:49:19,294 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 104.9MB. Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 17:49:19,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.11ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 70.6MB in the beginning and 85.7MB in the end (delta: -15.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-25 17:49:19,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.99ms. Allocated memory is still 125.8MB. Free memory was 85.5MB in the beginning and 80.0MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-25 17:49:19,296 INFO L158 Benchmark]: Boogie Preprocessor took 62.65ms. Allocated memory is still 125.8MB. Free memory was 80.0MB in the beginning and 75.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-25 17:49:19,296 INFO L158 Benchmark]: RCFGBuilder took 1561.41ms. Allocated memory is still 125.8MB. Free memory was 75.8MB in the beginning and 91.1MB in the end (delta: -15.3MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2021-11-25 17:49:19,296 INFO L158 Benchmark]: TraceAbstraction took 3808.53ms. Allocated memory was 125.8MB in the beginning and 169.9MB in the end (delta: 44.0MB). Free memory was 90.4MB in the beginning and 71.1MB in the end (delta: 19.3MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2021-11-25 17:49:19,297 INFO L158 Benchmark]: Witness Printer took 109.89ms. Allocated memory is still 169.9MB. Free memory was 71.1MB in the beginning and 56.4MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-25 17:49:19,299 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 104.9MB. Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 615.11ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 70.6MB in the beginning and 85.7MB in the end (delta: -15.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.99ms. Allocated memory is still 125.8MB. Free memory was 85.5MB in the beginning and 80.0MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.65ms. Allocated memory is still 125.8MB. Free memory was 80.0MB in the beginning and 75.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1561.41ms. Allocated memory is still 125.8MB. Free memory was 75.8MB in the beginning and 91.1MB in the end (delta: -15.3MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3808.53ms. Allocated memory was 125.8MB in the beginning and 169.9MB in the end (delta: 44.0MB). Free memory was 90.4MB in the beginning and 71.1MB in the end (delta: 19.3MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. * Witness Printer took 109.89ms. Allocated memory is still 169.9MB. Free memory was 71.1MB in the beginning and 56.4MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 443]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; [L613] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L61] a28 = 11 [L62] a25 = 1 [L63] return 26; VAL [\old(input)=1, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L110] a17 = 7 [L111] a25 = 0 [L112] a11 = 1 [L113] a28 = 10 [L114] a19 = 0 [L115] return -1; VAL [\old(input)=1, \result=-1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L436] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L439] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L442] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L443] reach_error() VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 298 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 287 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1283 IncrementalHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 287 mSolverCounterUnsat, 268 mSDtfsCounter, 1283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1123occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 162 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 585 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 473 ConstructedInterpolants, 0 QuantifiedInterpolants, 729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 88/88 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-25 17:49:19,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd0c59e-ba09-4076-a348-633f6e617f09/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE