./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c -s /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan --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 58e857a51148141aa14a27a9d40d99edfe00074b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 17:11:13,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 17:11:13,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 17:11:13,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 17:11:13,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 17:11:13,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 17:11:13,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 17:11:13,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 17:11:13,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 17:11:13,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 17:11:13,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 17:11:13,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 17:11:13,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 17:11:13,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 17:11:13,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 17:11:13,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 17:11:13,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 17:11:13,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 17:11:13,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 17:11:13,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 17:11:13,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 17:11:13,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 17:11:13,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 17:11:13,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 17:11:13,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 17:11:13,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 17:11:13,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 17:11:13,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 17:11:13,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 17:11:13,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 17:11:13,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 17:11:13,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 17:11:13,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 17:11:13,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 17:11:13,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 17:11:13,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 17:11:13,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 17:11:13,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 17:11:13,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 17:11:13,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 17:11:13,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 17:11:13,626 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 17:11:13,643 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 17:11:13,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 17:11:13,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 17:11:13,644 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 17:11:13,645 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 17:11:13,645 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 17:11:13,645 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 17:11:13,645 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 17:11:13,645 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 17:11:13,645 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 17:11:13,645 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 17:11:13,645 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 17:11:13,646 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 17:11:13,646 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 17:11:13,646 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 17:11:13,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 17:11:13,646 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 17:11:13,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 17:11:13,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 17:11:13,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 17:11:13,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 17:11:13,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 17:11:13,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 17:11:13,647 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 17:11:13,647 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 17:11:13,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 17:11:13,648 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 17:11:13,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 17:11:13,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 17:11:13,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 17:11:13,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 17:11:13,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 17:11:13,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 17:11:13,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 17:11:13,649 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 17:11:13,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 17:11:13,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 17:11:13,649 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 17:11:13,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 17:11:13,649 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-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/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-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan 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 -> 58e857a51148141aa14a27a9d40d99edfe00074b [2020-12-09 17:11:13,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 17:11:13,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 17:11:13,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 17:11:13,840 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 17:11:13,840 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 17:11:13,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2020-12-09 17:11:13,885 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/data/a141c738c/4d3dd727f9ca433897dc2a937cab15db/FLAG3ba26f7f3 [2020-12-09 17:11:14,356 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 17:11:14,356 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2020-12-09 17:11:14,367 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/data/a141c738c/4d3dd727f9ca433897dc2a937cab15db/FLAG3ba26f7f3 [2020-12-09 17:11:14,865 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/data/a141c738c/4d3dd727f9ca433897dc2a937cab15db [2020-12-09 17:11:14,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 17:11:14,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 17:11:14,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 17:11:14,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 17:11:14,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 17:11:14,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:11:14" (1/1) ... [2020-12-09 17:11:14,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c6f8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:14, skipping insertion in model container [2020-12-09 17:11:14,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:11:14" (1/1) ... [2020-12-09 17:11:14,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 17:11:14,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 17:11:15,101 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/sv-benchmarks/c/eca-rers2012/Problem02_label59.c[14857,14870] [2020-12-09 17:11:15,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:11:15,136 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 17:11:15,185 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/sv-benchmarks/c/eca-rers2012/Problem02_label59.c[14857,14870] [2020-12-09 17:11:15,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:11:15,208 INFO L208 MainTranslator]: Completed translation [2020-12-09 17:11:15,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:15 WrapperNode [2020-12-09 17:11:15,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 17:11:15,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 17:11:15,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 17:11:15,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 17:11:15,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:15" (1/1) ... [2020-12-09 17:11:15,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:15" (1/1) ... [2020-12-09 17:11:15,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 17:11:15,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 17:11:15,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 17:11:15,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 17:11:15,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:15" (1/1) ... [2020-12-09 17:11:15,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:15" (1/1) ... [2020-12-09 17:11:15,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:15" (1/1) ... [2020-12-09 17:11:15,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:15" (1/1) ... [2020-12-09 17:11:15,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:15" (1/1) ... [2020-12-09 17:11:15,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:15" (1/1) ... [2020-12-09 17:11:15,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:15" (1/1) ... [2020-12-09 17:11:15,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 17:11:15,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 17:11:15,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 17:11:15,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 17:11:15,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 17:11:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 17:11:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 17:11:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 17:11:15,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 17:11:16,728 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 17:11:16,728 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 17:11:16,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:11:16 BoogieIcfgContainer [2020-12-09 17:11:16,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 17:11:16,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 17:11:16,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 17:11:16,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 17:11:16,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:11:14" (1/3) ... [2020-12-09 17:11:16,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdae2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:11:16, skipping insertion in model container [2020-12-09 17:11:16,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:11:15" (2/3) ... [2020-12-09 17:11:16,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdae2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:11:16, skipping insertion in model container [2020-12-09 17:11:16,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:11:16" (3/3) ... [2020-12-09 17:11:16,738 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label59.c [2020-12-09 17:11:16,748 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 17:11:16,750 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 17:11:16,758 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 17:11:16,778 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 17:11:16,778 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 17:11:16,778 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 17:11:16,779 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 17:11:16,779 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 17:11:16,779 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 17:11:16,779 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 17:11:16,779 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 17:11:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2020-12-09 17:11:16,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-09 17:11:16,797 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:16,798 INFO L422 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] [2020-12-09 17:11:16,798 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:16,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:16,802 INFO L82 PathProgramCache]: Analyzing trace with hash 925824974, now seen corresponding path program 1 times [2020-12-09 17:11:16,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:16,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459886325] [2020-12-09 17:11:16,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:11:17,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459886325] [2020-12-09 17:11:17,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:17,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:11:17,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708646941] [2020-12-09 17:11:17,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:17,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:17,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:17,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:11:17,077 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 3 states. [2020-12-09 17:11:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:17,443 INFO L93 Difference]: Finished difference Result 251 states and 482 transitions. [2020-12-09 17:11:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:17,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-09 17:11:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:17,458 INFO L225 Difference]: With dead ends: 251 [2020-12-09 17:11:17,458 INFO L226 Difference]: Without dead ends: 163 [2020-12-09 17:11:17,461 INFO L677 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 [2020-12-09 17:11:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-12-09 17:11:17,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-12-09 17:11:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-09 17:11:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 293 transitions. [2020-12-09 17:11:17,510 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 293 transitions. Word has length 80 [2020-12-09 17:11:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:17,511 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 293 transitions. [2020-12-09 17:11:17,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 293 transitions. [2020-12-09 17:11:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-09 17:11:17,515 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:17,515 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:11:17,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 17:11:17,516 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1447139891, now seen corresponding path program 1 times [2020-12-09 17:11:17,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:17,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345320991] [2020-12-09 17:11:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:11:17,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345320991] [2020-12-09 17:11:17,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:17,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:11:17,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721329189] [2020-12-09 17:11:17,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:17,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:17,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:17,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:11:17,584 INFO L87 Difference]: Start difference. First operand 163 states and 293 transitions. Second operand 3 states. [2020-12-09 17:11:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:17,862 INFO L93 Difference]: Finished difference Result 485 states and 876 transitions. [2020-12-09 17:11:17,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:17,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-12-09 17:11:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:17,865 INFO L225 Difference]: With dead ends: 485 [2020-12-09 17:11:17,865 INFO L226 Difference]: Without dead ends: 323 [2020-12-09 17:11:17,866 INFO L677 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 [2020-12-09 17:11:17,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-12-09 17:11:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2020-12-09 17:11:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-12-09 17:11:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 484 transitions. [2020-12-09 17:11:17,885 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 484 transitions. Word has length 88 [2020-12-09 17:11:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:17,886 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 484 transitions. [2020-12-09 17:11:17,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 484 transitions. [2020-12-09 17:11:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-09 17:11:17,888 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:17,888 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:11:17,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 17:11:17,889 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:17,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2010131441, now seen corresponding path program 1 times [2020-12-09 17:11:17,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:17,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027218240] [2020-12-09 17:11:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:11:17,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027218240] [2020-12-09 17:11:17,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:17,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:11:17,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716138292] [2020-12-09 17:11:17,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:17,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:17,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:17,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:11:17,991 INFO L87 Difference]: Start difference. First operand 323 states and 484 transitions. Second operand 3 states. [2020-12-09 17:11:18,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:18,279 INFO L93 Difference]: Finished difference Result 805 states and 1258 transitions. [2020-12-09 17:11:18,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:18,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-12-09 17:11:18,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:18,282 INFO L225 Difference]: With dead ends: 805 [2020-12-09 17:11:18,282 INFO L226 Difference]: Without dead ends: 483 [2020-12-09 17:11:18,283 INFO L677 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 [2020-12-09 17:11:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2020-12-09 17:11:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2020-12-09 17:11:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2020-12-09 17:11:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 669 transitions. [2020-12-09 17:11:18,302 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 669 transitions. Word has length 89 [2020-12-09 17:11:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:18,302 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 669 transitions. [2020-12-09 17:11:18,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 669 transitions. [2020-12-09 17:11:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-09 17:11:18,304 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:18,304 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:11:18,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 17:11:18,304 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:18,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash -833234862, now seen corresponding path program 1 times [2020-12-09 17:11:18,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:18,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827504649] [2020-12-09 17:11:18,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:11:18,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827504649] [2020-12-09 17:11:18,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:18,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:11:18,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980917517] [2020-12-09 17:11:18,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:18,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:18,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:18,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:11:18,358 INFO L87 Difference]: Start difference. First operand 483 states and 669 transitions. Second operand 3 states. [2020-12-09 17:11:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:18,603 INFO L93 Difference]: Finished difference Result 1365 states and 1909 transitions. [2020-12-09 17:11:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:18,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-12-09 17:11:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:18,608 INFO L225 Difference]: With dead ends: 1365 [2020-12-09 17:11:18,608 INFO L226 Difference]: Without dead ends: 883 [2020-12-09 17:11:18,609 INFO L677 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 [2020-12-09 17:11:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2020-12-09 17:11:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2020-12-09 17:11:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2020-12-09 17:11:18,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1176 transitions. [2020-12-09 17:11:18,627 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1176 transitions. Word has length 90 [2020-12-09 17:11:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:18,627 INFO L481 AbstractCegarLoop]: Abstraction has 883 states and 1176 transitions. [2020-12-09 17:11:18,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1176 transitions. [2020-12-09 17:11:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-09 17:11:18,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:18,629 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:11:18,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 17:11:18,629 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:18,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:18,630 INFO L82 PathProgramCache]: Analyzing trace with hash -12394330, now seen corresponding path program 1 times [2020-12-09 17:11:18,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:18,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407345176] [2020-12-09 17:11:18,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:11:18,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407345176] [2020-12-09 17:11:18,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663864003] [2020-12-09 17:11:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:11:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:18,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 17:11:18,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:11:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 17:11:18,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:11:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 17:11:18,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 17:11:18,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2020-12-09 17:11:18,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823506150] [2020-12-09 17:11:18,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:18,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:18,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:18,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:11:18,930 INFO L87 Difference]: Start difference. First operand 883 states and 1176 transitions. Second operand 3 states. [2020-12-09 17:11:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:19,234 INFO L93 Difference]: Finished difference Result 2485 states and 3344 transitions. [2020-12-09 17:11:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:19,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-12-09 17:11:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:19,244 INFO L225 Difference]: With dead ends: 2485 [2020-12-09 17:11:19,244 INFO L226 Difference]: Without dead ends: 1603 [2020-12-09 17:11:19,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:11:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2020-12-09 17:11:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1523. [2020-12-09 17:11:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2020-12-09 17:11:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 2051 transitions. [2020-12-09 17:11:19,288 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 2051 transitions. Word has length 93 [2020-12-09 17:11:19,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:19,289 INFO L481 AbstractCegarLoop]: Abstraction has 1523 states and 2051 transitions. [2020-12-09 17:11:19,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2051 transitions. [2020-12-09 17:11:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-09 17:11:19,292 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:19,293 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 17:11:19,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:11:19,493 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:19,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:19,494 INFO L82 PathProgramCache]: Analyzing trace with hash 40499083, now seen corresponding path program 1 times [2020-12-09 17:11:19,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:19,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068665733] [2020-12-09 17:11:19,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:11:19,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068665733] [2020-12-09 17:11:19,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:19,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:11:19,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941917812] [2020-12-09 17:11:19,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:19,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:19,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:19,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:11:19,581 INFO L87 Difference]: Start difference. First operand 1523 states and 2051 transitions. Second operand 3 states. [2020-12-09 17:11:19,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:19,901 INFO L93 Difference]: Finished difference Result 3445 states and 4763 transitions. [2020-12-09 17:11:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:19,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2020-12-09 17:11:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:19,911 INFO L225 Difference]: With dead ends: 3445 [2020-12-09 17:11:19,912 INFO L226 Difference]: Without dead ends: 1923 [2020-12-09 17:11:19,914 INFO L677 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 [2020-12-09 17:11:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2020-12-09 17:11:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1683. [2020-12-09 17:11:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2020-12-09 17:11:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2261 transitions. [2020-12-09 17:11:19,948 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2261 transitions. Word has length 110 [2020-12-09 17:11:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:19,948 INFO L481 AbstractCegarLoop]: Abstraction has 1683 states and 2261 transitions. [2020-12-09 17:11:19,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2261 transitions. [2020-12-09 17:11:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-09 17:11:19,951 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:19,951 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 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] [2020-12-09 17:11:19,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 17:11:19,951 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:19,952 INFO L82 PathProgramCache]: Analyzing trace with hash -563529142, now seen corresponding path program 1 times [2020-12-09 17:11:19,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:19,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558911275] [2020-12-09 17:11:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-09 17:11:19,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558911275] [2020-12-09 17:11:19,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51152616] [2020-12-09 17:11:19,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:11:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:20,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 17:11:20,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:11:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 17:11:20,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:11:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 17:11:20,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 17:11:20,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 5 [2020-12-09 17:11:20,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614450031] [2020-12-09 17:11:20,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:20,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:20,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:20,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:11:20,241 INFO L87 Difference]: Start difference. First operand 1683 states and 2261 transitions. Second operand 3 states. [2020-12-09 17:11:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:20,512 INFO L93 Difference]: Finished difference Result 3845 states and 5222 transitions. [2020-12-09 17:11:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:20,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-12-09 17:11:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:20,520 INFO L225 Difference]: With dead ends: 3845 [2020-12-09 17:11:20,521 INFO L226 Difference]: Without dead ends: 2163 [2020-12-09 17:11:20,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:11:20,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2020-12-09 17:11:20,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 1603. [2020-12-09 17:11:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2020-12-09 17:11:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2141 transitions. [2020-12-09 17:11:20,549 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2141 transitions. Word has length 113 [2020-12-09 17:11:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:20,549 INFO L481 AbstractCegarLoop]: Abstraction has 1603 states and 2141 transitions. [2020-12-09 17:11:20,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2141 transitions. [2020-12-09 17:11:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-09 17:11:20,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:20,551 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 17:11:20,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:11:20,752 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:20,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:20,753 INFO L82 PathProgramCache]: Analyzing trace with hash -917758828, now seen corresponding path program 1 times [2020-12-09 17:11:20,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:20,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666418742] [2020-12-09 17:11:20,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:11:20,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666418742] [2020-12-09 17:11:20,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:20,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:11:20,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16102696] [2020-12-09 17:11:20,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:20,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:20,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:20,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:11:20,850 INFO L87 Difference]: Start difference. First operand 1603 states and 2141 transitions. Second operand 3 states. [2020-12-09 17:11:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:21,177 INFO L93 Difference]: Finished difference Result 4327 states and 5744 transitions. [2020-12-09 17:11:21,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:21,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-12-09 17:11:21,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:21,190 INFO L225 Difference]: With dead ends: 4327 [2020-12-09 17:11:21,191 INFO L226 Difference]: Without dead ends: 2725 [2020-12-09 17:11:21,192 INFO L677 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 [2020-12-09 17:11:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2020-12-09 17:11:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2723. [2020-12-09 17:11:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2020-12-09 17:11:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3513 transitions. [2020-12-09 17:11:21,230 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3513 transitions. Word has length 113 [2020-12-09 17:11:21,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:21,230 INFO L481 AbstractCegarLoop]: Abstraction has 2723 states and 3513 transitions. [2020-12-09 17:11:21,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3513 transitions. [2020-12-09 17:11:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-09 17:11:21,233 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:21,233 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 17:11:21,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 17:11:21,233 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1810156468, now seen corresponding path program 1 times [2020-12-09 17:11:21,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:21,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956111603] [2020-12-09 17:11:21,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-12-09 17:11:21,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956111603] [2020-12-09 17:11:21,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113096948] [2020-12-09 17:11:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:11:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:21,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 17:11:21,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:11:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-12-09 17:11:21,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:11:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-12-09 17:11:21,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 17:11:21,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2020-12-09 17:11:21,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901202217] [2020-12-09 17:11:21,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:21,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:21,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:21,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:11:21,465 INFO L87 Difference]: Start difference. First operand 2723 states and 3513 transitions. Second operand 3 states. [2020-12-09 17:11:21,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:21,599 INFO L93 Difference]: Finished difference Result 4805 states and 6094 transitions. [2020-12-09 17:11:21,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:21,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2020-12-09 17:11:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:21,606 INFO L225 Difference]: With dead ends: 4805 [2020-12-09 17:11:21,606 INFO L226 Difference]: Without dead ends: 2083 [2020-12-09 17:11:21,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:11:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2020-12-09 17:11:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1203. [2020-12-09 17:11:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2020-12-09 17:11:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1470 transitions. [2020-12-09 17:11:21,627 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1470 transitions. Word has length 128 [2020-12-09 17:11:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:21,627 INFO L481 AbstractCegarLoop]: Abstraction has 1203 states and 1470 transitions. [2020-12-09 17:11:21,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1470 transitions. [2020-12-09 17:11:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-09 17:11:21,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:21,630 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 17:11:21,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:11:21,831 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:21,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1876488282, now seen corresponding path program 1 times [2020-12-09 17:11:21,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:21,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106610137] [2020-12-09 17:11:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:11:21,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106610137] [2020-12-09 17:11:21,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:21,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:11:21,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113484447] [2020-12-09 17:11:21,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:21,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:21,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:11:21,954 INFO L87 Difference]: Start difference. First operand 1203 states and 1470 transitions. Second operand 3 states. [2020-12-09 17:11:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:22,150 INFO L93 Difference]: Finished difference Result 2405 states and 2939 transitions. [2020-12-09 17:11:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:22,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-09 17:11:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:22,155 INFO L225 Difference]: With dead ends: 2405 [2020-12-09 17:11:22,155 INFO L226 Difference]: Without dead ends: 1203 [2020-12-09 17:11:22,156 INFO L677 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 [2020-12-09 17:11:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-12-09 17:11:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2020-12-09 17:11:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2020-12-09 17:11:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1459 transitions. [2020-12-09 17:11:22,178 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1459 transitions. Word has length 133 [2020-12-09 17:11:22,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:22,178 INFO L481 AbstractCegarLoop]: Abstraction has 1203 states and 1459 transitions. [2020-12-09 17:11:22,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1459 transitions. [2020-12-09 17:11:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-09 17:11:22,181 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:22,182 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-09 17:11:22,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 17:11:22,182 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:22,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:22,182 INFO L82 PathProgramCache]: Analyzing trace with hash 144564621, now seen corresponding path program 1 times [2020-12-09 17:11:22,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:22,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102006765] [2020-12-09 17:11:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-09 17:11:22,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102006765] [2020-12-09 17:11:22,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:22,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:11:22,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821043912] [2020-12-09 17:11:22,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:22,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:22,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:22,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:11:22,226 INFO L87 Difference]: Start difference. First operand 1203 states and 1459 transitions. Second operand 3 states. [2020-12-09 17:11:22,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:22,411 INFO L93 Difference]: Finished difference Result 2325 states and 2832 transitions. [2020-12-09 17:11:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:22,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2020-12-09 17:11:22,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:22,415 INFO L225 Difference]: With dead ends: 2325 [2020-12-09 17:11:22,415 INFO L226 Difference]: Without dead ends: 1123 [2020-12-09 17:11:22,416 INFO L677 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 [2020-12-09 17:11:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2020-12-09 17:11:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1043. [2020-12-09 17:11:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-12-09 17:11:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1244 transitions. [2020-12-09 17:11:22,428 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1244 transitions. Word has length 137 [2020-12-09 17:11:22,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:22,428 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1244 transitions. [2020-12-09 17:11:22,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1244 transitions. [2020-12-09 17:11:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-12-09 17:11:22,430 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:22,430 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-09 17:11:22,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 17:11:22,430 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:22,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1465450711, now seen corresponding path program 1 times [2020-12-09 17:11:22,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:22,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876056190] [2020-12-09 17:11:22,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-09 17:11:22,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876056190] [2020-12-09 17:11:22,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:22,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:11:22,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736117016] [2020-12-09 17:11:22,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:22,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:22,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:22,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:11:22,472 INFO L87 Difference]: Start difference. First operand 1043 states and 1244 transitions. Second operand 3 states. [2020-12-09 17:11:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:22,683 INFO L93 Difference]: Finished difference Result 2405 states and 2872 transitions. [2020-12-09 17:11:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:22,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2020-12-09 17:11:22,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:22,687 INFO L225 Difference]: With dead ends: 2405 [2020-12-09 17:11:22,687 INFO L226 Difference]: Without dead ends: 1283 [2020-12-09 17:11:22,688 INFO L677 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 [2020-12-09 17:11:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2020-12-09 17:11:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2020-12-09 17:11:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2020-12-09 17:11:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1480 transitions. [2020-12-09 17:11:22,705 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1480 transitions. Word has length 141 [2020-12-09 17:11:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:22,705 INFO L481 AbstractCegarLoop]: Abstraction has 1283 states and 1480 transitions. [2020-12-09 17:11:22,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1480 transitions. [2020-12-09 17:11:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-09 17:11:22,707 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:22,707 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2020-12-09 17:11:22,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 17:11:22,707 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:22,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash -720554959, now seen corresponding path program 1 times [2020-12-09 17:11:22,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:22,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053034222] [2020-12-09 17:11:22,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-09 17:11:22,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053034222] [2020-12-09 17:11:22,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:22,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:11:22,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971422935] [2020-12-09 17:11:22,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:11:22,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:22,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:11:22,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:11:22,746 INFO L87 Difference]: Start difference. First operand 1283 states and 1480 transitions. Second operand 3 states. [2020-12-09 17:11:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:22,969 INFO L93 Difference]: Finished difference Result 2645 states and 3062 transitions. [2020-12-09 17:11:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:11:22,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2020-12-09 17:11:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:22,973 INFO L225 Difference]: With dead ends: 2645 [2020-12-09 17:11:22,973 INFO L226 Difference]: Without dead ends: 1123 [2020-12-09 17:11:22,974 INFO L677 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 [2020-12-09 17:11:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2020-12-09 17:11:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2020-12-09 17:11:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2020-12-09 17:11:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1279 transitions. [2020-12-09 17:11:22,990 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1279 transitions. Word has length 148 [2020-12-09 17:11:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:22,990 INFO L481 AbstractCegarLoop]: Abstraction has 1123 states and 1279 transitions. [2020-12-09 17:11:22,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:11:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1279 transitions. [2020-12-09 17:11:22,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-09 17:11:22,992 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:22,992 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 17:11:22,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 17:11:22,993 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:22,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:22,993 INFO L82 PathProgramCache]: Analyzing trace with hash -955680973, now seen corresponding path program 1 times [2020-12-09 17:11:22,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:22,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60918469] [2020-12-09 17:11:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-09 17:11:23,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60918469] [2020-12-09 17:11:23,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:23,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 17:11:23,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548349459] [2020-12-09 17:11:23,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 17:11:23,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:23,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 17:11:23,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:11:23,120 INFO L87 Difference]: Start difference. First operand 1123 states and 1279 transitions. Second operand 5 states. [2020-12-09 17:11:23,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:23,536 INFO L93 Difference]: Finished difference Result 2364 states and 2694 transitions. [2020-12-09 17:11:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 17:11:23,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2020-12-09 17:11:23,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:23,540 INFO L225 Difference]: With dead ends: 2364 [2020-12-09 17:11:23,541 INFO L226 Difference]: Without dead ends: 1076 [2020-12-09 17:11:23,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 17:11:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2020-12-09 17:11:23,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1043. [2020-12-09 17:11:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-12-09 17:11:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1124 transitions. [2020-12-09 17:11:23,559 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1124 transitions. Word has length 186 [2020-12-09 17:11:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:23,559 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1124 transitions. [2020-12-09 17:11:23,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 17:11:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1124 transitions. [2020-12-09 17:11:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-12-09 17:11:23,561 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:23,561 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2020-12-09 17:11:23,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 17:11:23,561 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:23,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:23,561 INFO L82 PathProgramCache]: Analyzing trace with hash -864730343, now seen corresponding path program 1 times [2020-12-09 17:11:23,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:23,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049222208] [2020-12-09 17:11:23,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-09 17:11:23,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049222208] [2020-12-09 17:11:23,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:23,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 17:11:23,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892633649] [2020-12-09 17:11:23,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 17:11:23,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:23,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 17:11:23,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:11:23,635 INFO L87 Difference]: Start difference. First operand 1043 states and 1124 transitions. Second operand 4 states. [2020-12-09 17:11:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:23,884 INFO L93 Difference]: Finished difference Result 2005 states and 2164 transitions. [2020-12-09 17:11:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 17:11:23,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2020-12-09 17:11:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:23,887 INFO L225 Difference]: With dead ends: 2005 [2020-12-09 17:11:23,887 INFO L226 Difference]: Without dead ends: 1043 [2020-12-09 17:11:23,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:11:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2020-12-09 17:11:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2020-12-09 17:11:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-12-09 17:11:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1121 transitions. [2020-12-09 17:11:23,900 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1121 transitions. Word has length 206 [2020-12-09 17:11:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:23,901 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1121 transitions. [2020-12-09 17:11:23,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 17:11:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1121 transitions. [2020-12-09 17:11:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-09 17:11:23,902 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:23,902 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-09 17:11:23,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 17:11:23,902 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:23,903 INFO L82 PathProgramCache]: Analyzing trace with hash 634073579, now seen corresponding path program 1 times [2020-12-09 17:11:23,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:23,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893447886] [2020-12-09 17:11:23,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:11:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:11:23,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893447886] [2020-12-09 17:11:23,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:11:23,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 17:11:23,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745338656] [2020-12-09 17:11:23,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 17:11:23,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:11:23,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 17:11:23,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:11:23,991 INFO L87 Difference]: Start difference. First operand 1043 states and 1121 transitions. Second operand 4 states. [2020-12-09 17:11:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:11:24,276 INFO L93 Difference]: Finished difference Result 2005 states and 2158 transitions. [2020-12-09 17:11:24,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 17:11:24,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2020-12-09 17:11:24,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:11:24,280 INFO L225 Difference]: With dead ends: 2005 [2020-12-09 17:11:24,280 INFO L226 Difference]: Without dead ends: 1043 [2020-12-09 17:11:24,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:11:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2020-12-09 17:11:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2020-12-09 17:11:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-12-09 17:11:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1118 transitions. [2020-12-09 17:11:24,293 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1118 transitions. Word has length 213 [2020-12-09 17:11:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:11:24,293 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1118 transitions. [2020-12-09 17:11:24,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 17:11:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1118 transitions. [2020-12-09 17:11:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-12-09 17:11:24,295 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:11:24,295 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 17:11:24,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 17:11:24,295 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:11:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:11:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash 668740035, now seen corresponding path program 1 times [2020-12-09 17:11:24,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:11:24,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695751746] [2020-12-09 17:11:24,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:11:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 17:11:24,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 17:11:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 17:11:24,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 17:11:24,426 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 17:11:24,426 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 17:11:24,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-09 17:11:24,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:11:24 BoogieIcfgContainer [2020-12-09 17:11:24,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 17:11:24,575 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 17:11:24,575 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 17:11:24,575 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 17:11:24,576 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:11:16" (3/4) ... [2020-12-09 17:11:24,577 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 17:11:24,701 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_524da866-ba6c-4431-a55c-b81abfc87923/bin/utaipan/witness.graphml [2020-12-09 17:11:24,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 17:11:24,702 INFO L168 Benchmark]: Toolchain (without parser) took 9833.89 ms. Allocated memory was 98.6 MB in the beginning and 270.5 MB in the end (delta: 172.0 MB). Free memory was 67.7 MB in the beginning and 226.7 MB in the end (delta: -159.1 MB). Peak memory consumption was 160.0 MB. Max. memory is 16.1 GB. [2020-12-09 17:11:24,702 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 98.6 MB. Free memory is still 62.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 17:11:24,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.19 ms. Allocated memory is still 98.6 MB. Free memory was 67.5 MB in the beginning and 59.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 17:11:24,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.01 ms. Allocated memory is still 98.6 MB. Free memory was 59.5 MB in the beginning and 54.2 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 17:11:24,703 INFO L168 Benchmark]: Boogie Preprocessor took 43.95 ms. Allocated memory is still 98.6 MB. Free memory was 54.2 MB in the beginning and 49.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 17:11:24,703 INFO L168 Benchmark]: RCFGBuilder took 1411.08 ms. Allocated memory was 98.6 MB in the beginning and 127.9 MB in the end (delta: 29.4 MB). Free memory was 49.5 MB in the beginning and 59.8 MB in the end (delta: -10.3 MB). Peak memory consumption was 34.5 MB. Max. memory is 16.1 GB. [2020-12-09 17:11:24,703 INFO L168 Benchmark]: TraceAbstraction took 7842.08 ms. Allocated memory was 127.9 MB in the beginning and 270.5 MB in the end (delta: 142.6 MB). Free memory was 59.8 MB in the beginning and 105.2 MB in the end (delta: -45.4 MB). Peak memory consumption was 96.1 MB. Max. memory is 16.1 GB. [2020-12-09 17:11:24,704 INFO L168 Benchmark]: Witness Printer took 125.71 ms. Allocated memory is still 270.5 MB. Free memory was 105.2 MB in the beginning and 226.7 MB in the end (delta: -121.6 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2020-12-09 17:11:24,706 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.17 ms. Allocated memory is still 98.6 MB. Free memory is still 62.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 340.19 ms. Allocated memory is still 98.6 MB. Free memory was 67.5 MB in the beginning and 59.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.01 ms. Allocated memory is still 98.6 MB. Free memory was 59.5 MB in the beginning and 54.2 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.95 ms. Allocated memory is still 98.6 MB. Free memory was 54.2 MB in the beginning and 49.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1411.08 ms. Allocated memory was 98.6 MB in the beginning and 127.9 MB in the end (delta: 29.4 MB). Free memory was 49.5 MB in the beginning and 59.8 MB in the end (delta: -10.3 MB). Peak memory consumption was 34.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7842.08 ms. Allocated memory was 127.9 MB in the beginning and 270.5 MB in the end (delta: 142.6 MB). Free memory was 59.8 MB in the beginning and 105.2 MB in the end (delta: -45.4 MB). Peak memory consumption was 96.1 MB. Max. memory is 16.1 GB. * Witness Printer took 125.71 ms. Allocated memory is still 270.5 MB. Free memory was 105.2 MB in the beginning and 226.7 MB in the end (delta: -121.6 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 431]: 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, 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)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L245] a28 = 9 [L246] return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L405] a19 = 0 [L406] a28 = 7 [L407] return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND TRUE ((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))) [L165] a25 = 1 [L166] a19 = 1 [L167] a28 = 7 [L168] return -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND TRUE ((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L431] reach_error() VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, 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. VerificationResult: UNSAFE, OverallTime: 7.6s, OverallIterations: 17, TraceHistogramMax: 5, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1252 SDtfs, 1125 SDslu, 116 SDs, 0 SdLazy, 4078 SolverSat, 817 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 712 GetRequests, 681 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2723occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1875 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2630 NumberOfCodeBlocks, 2630 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2714 ConstructedInterpolants, 0 QuantifiedInterpolants, 857737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 828 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 1471/1485 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! Received shutdown request...