./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aaa39ce28677c06ea4974c4267a7bbc4385d14ab ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1.23-635dfa2 [2018-12-09 11:43:07,813 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:43:07,814 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:43:07,820 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:43:07,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:43:07,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:43:07,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:43:07,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:43:07,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:43:07,823 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:43:07,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:43:07,823 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:43:07,824 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:43:07,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:43:07,825 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:43:07,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:43:07,826 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:43:07,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:43:07,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:43:07,828 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:43:07,829 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:43:07,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:43:07,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:43:07,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:43:07,830 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:43:07,831 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:43:07,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:43:07,832 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:43:07,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:43:07,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:43:07,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:43:07,833 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:43:07,833 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:43:07,833 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:43:07,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:43:07,834 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:43:07,834 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 11:43:07,841 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:43:07,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:43:07,842 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:43:07,842 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 11:43:07,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:43:07,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:43:07,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:43:07,842 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:43:07,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:43:07,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:43:07,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:43:07,843 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 11:43:07,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:43:07,843 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 11:43:07,843 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:43:07,843 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:43:07,843 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 11:43:07,843 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 11:43:07,843 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 11:43:07,843 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 11:43:07,844 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:43:07,844 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:43:07,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 11:43:07,844 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:43:07,844 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:43:07,844 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 11:43:07,844 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 11:43:07,844 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:43:07,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 11:43:07,844 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> aaa39ce28677c06ea4974c4267a7bbc4385d14ab [2018-12-09 11:43:07,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:43:07,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:43:07,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:43:07,875 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:43:07,875 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:43:07,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-12-09 11:43:07,918 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak/data/c05a66b14/d17a26e4880f4f839bbaa456e983fb55/FLAG06dcc93c7 [2018-12-09 11:43:08,271 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:43:08,271 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-12-09 11:43:08,277 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak/data/c05a66b14/d17a26e4880f4f839bbaa456e983fb55/FLAG06dcc93c7 [2018-12-09 11:43:08,649 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak/data/c05a66b14/d17a26e4880f4f839bbaa456e983fb55 [2018-12-09 11:43:08,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:43:08,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:43:08,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:43:08,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:43:08,656 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:43:08,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:43:08" (1/1) ... [2018-12-09 11:43:08,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec9f2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:43:08, skipping insertion in model container [2018-12-09 11:43:08,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:43:08" (1/1) ... [2018-12-09 11:43:08,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:43:08,697 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:43:08,888 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:43:08,891 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:43:08,971 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:43:08,981 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:43:08,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:43:08 WrapperNode [2018-12-09 11:43:08,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:43:08,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:43:08,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:43:08,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:43:08,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:43:08" (1/1) ... [2018-12-09 11:43:08,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:43:08" (1/1) ... [2018-12-09 11:43:09,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:43:09,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:43:09,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:43:09,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:43:09,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:43:08" (1/1) ... [2018-12-09 11:43:09,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:43:08" (1/1) ... [2018-12-09 11:43:09,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:43:08" (1/1) ... [2018-12-09 11:43:09,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:43:08" (1/1) ... [2018-12-09 11:43:09,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:43:08" (1/1) ... [2018-12-09 11:43:09,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:43:08" (1/1) ... [2018-12-09 11:43:09,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:43:08" (1/1) ... [2018-12-09 11:43:09,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:43:09,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:43:09,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:43:09,051 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:43:09,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:43:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-12-09 11:43:09,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:43:09,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:43:10,071 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:43:10,071 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 11:43:10,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:43:10 BoogieIcfgContainer [2018-12-09 11:43:10,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:43:10,072 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 11:43:10,072 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 11:43:10,081 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 11:43:10,081 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:43:10" (1/1) ... [2018-12-09 11:43:10,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:43:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-09 11:43:10,123 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-09 11:43:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 11:43:10,126 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:10,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 145 states and 221 transitions. [2018-12-09 11:43:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 221 transitions. [2018-12-09 11:43:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 11:43:10,603 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 149 states and 226 transitions. [2018-12-09 11:43:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2018-12-09 11:43:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 11:43:10,784 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 154 states and 236 transitions. [2018-12-09 11:43:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 236 transitions. [2018-12-09 11:43:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 11:43:10,908 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 11:43:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 230 states and 325 transitions. [2018-12-09 11:43:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2018-12-09 11:43:11,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 11:43:11,409 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 11:43:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 252 states and 354 transitions. [2018-12-09 11:43:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 354 transitions. [2018-12-09 11:43:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 11:43:11,707 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 11:43:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 262 states and 370 transitions. [2018-12-09 11:43:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 370 transitions. [2018-12-09 11:43:12,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 11:43:12,163 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 11:43:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 267 states and 375 transitions. [2018-12-09 11:43:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 375 transitions. [2018-12-09 11:43:12,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 11:43:12,223 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 11:43:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 278 states and 397 transitions. [2018-12-09 11:43:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 397 transitions. [2018-12-09 11:43:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 11:43:12,711 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 11:43:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 284 states and 406 transitions. [2018-12-09 11:43:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 406 transitions. [2018-12-09 11:43:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 11:43:12,952 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 11:43:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 287 states and 411 transitions. [2018-12-09 11:43:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 411 transitions. [2018-12-09 11:43:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 11:43:13,046 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 11:43:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 289 states and 414 transitions. [2018-12-09 11:43:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 414 transitions. [2018-12-09 11:43:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 11:43:13,166 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 11:43:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 292 states and 418 transitions. [2018-12-09 11:43:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 418 transitions. [2018-12-09 11:43:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 11:43:13,436 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 11:43:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 295 states and 421 transitions. [2018-12-09 11:43:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 421 transitions. [2018-12-09 11:43:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 11:43:13,555 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 11:43:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 298 states and 424 transitions. [2018-12-09 11:43:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 424 transitions. [2018-12-09 11:43:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 11:43:13,668 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 11:43:13,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 304 states and 430 transitions. [2018-12-09 11:43:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2018-12-09 11:43:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:43:13,710 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 11:43:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 310 states and 441 transitions. [2018-12-09 11:43:14,121 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 441 transitions. [2018-12-09 11:43:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:43:14,121 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 11:43:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 313 states and 445 transitions. [2018-12-09 11:43:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 445 transitions. [2018-12-09 11:43:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:43:14,281 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 11:43:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 316 states and 449 transitions. [2018-12-09 11:43:14,441 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 449 transitions. [2018-12-09 11:43:14,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:43:14,442 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 11:43:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 319 states and 454 transitions. [2018-12-09 11:43:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 454 transitions. [2018-12-09 11:43:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:43:14,599 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 11:43:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 321 states and 457 transitions. [2018-12-09 11:43:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 457 transitions. [2018-12-09 11:43:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:43:14,788 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 11:43:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 326 states and 464 transitions. [2018-12-09 11:43:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 464 transitions. [2018-12-09 11:43:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 11:43:15,279 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-09 11:43:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 331 states and 473 transitions. [2018-12-09 11:43:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 473 transitions. [2018-12-09 11:43:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 11:43:15,734 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-09 11:43:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 337 states and 480 transitions. [2018-12-09 11:43:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 480 transitions. [2018-12-09 11:43:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 11:43:15,943 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-09 11:43:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 340 states and 483 transitions. [2018-12-09 11:43:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 483 transitions. [2018-12-09 11:43:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 11:43:16,075 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 11:43:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 348 states and 500 transitions. [2018-12-09 11:43:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 500 transitions. [2018-12-09 11:43:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 11:43:16,517 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 11:43:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 350 states and 503 transitions. [2018-12-09 11:43:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 503 transitions. [2018-12-09 11:43:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 11:43:16,665 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 11:43:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 353 states and 509 transitions. [2018-12-09 11:43:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 509 transitions. [2018-12-09 11:43:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 11:43:16,851 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 11:43:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 367 states and 523 transitions. [2018-12-09 11:43:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 523 transitions. [2018-12-09 11:43:16,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-09 11:43:16,919 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 11:43:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 378 states and 535 transitions. [2018-12-09 11:43:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 535 transitions. [2018-12-09 11:43:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-09 11:43:17,027 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 423 states and 584 transitions. [2018-12-09 11:43:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 584 transitions. [2018-12-09 11:43:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-09 11:43:17,469 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-09 11:43:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 425 states and 587 transitions. [2018-12-09 11:43:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 587 transitions. [2018-12-09 11:43:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-09 11:43:17,641 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 11:43:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 432 states and 596 transitions. [2018-12-09 11:43:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 596 transitions. [2018-12-09 11:43:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 11:43:17,803 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 11:43:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 450 states and 615 transitions. [2018-12-09 11:43:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 615 transitions. [2018-12-09 11:43:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 11:43:18,200 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 11:43:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:20,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 478 states and 656 transitions. [2018-12-09 11:43:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 656 transitions. [2018-12-09 11:43:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 11:43:20,172 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 11:43:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 483 states and 660 transitions. [2018-12-09 11:43:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 660 transitions. [2018-12-09 11:43:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 11:43:20,573 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 548 states and 727 transitions. [2018-12-09 11:43:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 727 transitions. [2018-12-09 11:43:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 11:43:22,003 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 604 states and 788 transitions. [2018-12-09 11:43:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 788 transitions. [2018-12-09 11:43:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 11:43:25,533 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 672 states and 871 transitions. [2018-12-09 11:43:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 871 transitions. [2018-12-09 11:43:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 11:43:28,554 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 680 states and 879 transitions. [2018-12-09 11:43:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 879 transitions. [2018-12-09 11:43:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 11:43:29,211 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-09 11:43:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 681 states and 879 transitions. [2018-12-09 11:43:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 879 transitions. [2018-12-09 11:43:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-09 11:43:29,362 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 750 states and 953 transitions. [2018-12-09 11:43:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 953 transitions. [2018-12-09 11:43:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 11:43:30,624 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 106 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 11:43:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 761 states and 970 transitions. [2018-12-09 11:43:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 970 transitions. [2018-12-09 11:43:31,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 11:43:31,675 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 106 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 11:43:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 764 states and 974 transitions. [2018-12-09 11:43:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 974 transitions. [2018-12-09 11:43:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 11:43:31,874 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 835 states and 1045 transitions. [2018-12-09 11:43:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1045 transitions. [2018-12-09 11:43:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 11:43:33,175 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-09 11:43:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 848 states and 1063 transitions. [2018-12-09 11:43:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1063 transitions. [2018-12-09 11:43:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 11:43:33,593 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-09 11:43:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 850 states and 1064 transitions. [2018-12-09 11:43:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1064 transitions. [2018-12-09 11:43:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 11:43:33,850 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 11:43:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 860 states and 1080 transitions. [2018-12-09 11:43:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1080 transitions. [2018-12-09 11:43:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 11:43:35,420 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 11:43:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 863 states and 1084 transitions. [2018-12-09 11:43:35,646 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1084 transitions. [2018-12-09 11:43:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 11:43:35,647 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 155 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 11:43:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 877 states and 1101 transitions. [2018-12-09 11:43:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1101 transitions. [2018-12-09 11:43:37,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 11:43:37,338 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 155 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 11:43:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 879 states and 1102 transitions. [2018-12-09 11:43:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1102 transitions. [2018-12-09 11:43:37,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 11:43:37,662 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-09 11:43:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 881 states and 1104 transitions. [2018-12-09 11:43:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1104 transitions. [2018-12-09 11:43:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-09 11:43:37,754 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:46,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 949 states and 1185 transitions. [2018-12-09 11:43:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1185 transitions. [2018-12-09 11:43:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-09 11:43:46,472 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 970 states and 1211 transitions. [2018-12-09 11:43:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1211 transitions. [2018-12-09 11:43:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-09 11:43:47,698 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:43:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 972 states and 1212 transitions. [2018-12-09 11:43:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1212 transitions. [2018-12-09 11:43:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 11:43:48,127 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 11:43:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 979 states and 1230 transitions. [2018-12-09 11:43:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1230 transitions. [2018-12-09 11:43:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 11:43:50,064 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 11:43:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 983 states and 1239 transitions. [2018-12-09 11:43:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1239 transitions. [2018-12-09 11:43:51,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 11:43:51,580 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 11:43:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 984 states and 1240 transitions. [2018-12-09 11:43:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1240 transitions. [2018-12-09 11:43:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 11:43:51,896 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 11:43:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 986 states and 1242 transitions. [2018-12-09 11:43:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1242 transitions. [2018-12-09 11:43:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-09 11:43:52,170 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 11:43:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 989 states and 1246 transitions. [2018-12-09 11:43:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1246 transitions. [2018-12-09 11:43:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-09 11:43:52,395 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 11:43:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1034 states and 1298 transitions. [2018-12-09 11:43:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1298 transitions. [2018-12-09 11:43:53,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-09 11:43:53,619 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 11:43:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1037 states and 1302 transitions. [2018-12-09 11:43:53,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1302 transitions. [2018-12-09 11:43:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-09 11:43:53,842 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 11:43:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1040 states and 1305 transitions. [2018-12-09 11:43:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1305 transitions. [2018-12-09 11:43:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-09 11:43:54,095 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 233 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 11:43:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1046 states and 1312 transitions. [2018-12-09 11:43:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1312 transitions. [2018-12-09 11:43:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-09 11:43:54,943 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 233 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 11:43:55,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1049 states and 1315 transitions. [2018-12-09 11:43:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1315 transitions. [2018-12-09 11:43:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-09 11:43:55,259 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-12-09 11:43:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:43:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1079 states and 1349 transitions. [2018-12-09 11:43:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1349 transitions. [2018-12-09 11:43:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 11:43:56,348 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:43:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:43:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:44:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1148 states and 1438 transitions. [2018-12-09 11:44:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1438 transitions. [2018-12-09 11:44:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 11:44:04,267 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:44:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1167 states and 1460 transitions. [2018-12-09 11:44:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1460 transitions. [2018-12-09 11:44:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 11:44:07,005 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:44:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1181 states and 1474 transitions. [2018-12-09 11:44:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1474 transitions. [2018-12-09 11:44:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 11:44:08,011 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:44:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1183 states and 1475 transitions. [2018-12-09 11:44:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1475 transitions. [2018-12-09 11:44:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 11:44:08,582 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-09 11:44:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1222 states and 1517 transitions. [2018-12-09 11:44:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1517 transitions. [2018-12-09 11:44:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 11:44:10,878 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-09 11:44:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1224 states and 1518 transitions. [2018-12-09 11:44:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1518 transitions. [2018-12-09 11:44:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 11:44:11,274 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 11:44:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1228 states and 1525 transitions. [2018-12-09 11:44:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1525 transitions. [2018-12-09 11:44:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 11:44:15,740 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 11:44:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1231 states and 1529 transitions. [2018-12-09 11:44:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1529 transitions. [2018-12-09 11:44:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 11:44:16,697 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 11:44:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1289 states and 1595 transitions. [2018-12-09 11:44:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1595 transitions. [2018-12-09 11:44:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 11:44:19,701 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 11:44:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1291 states and 1596 transitions. [2018-12-09 11:44:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1596 transitions. [2018-12-09 11:44:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 11:44:20,085 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-09 11:44:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1361 states and 1669 transitions. [2018-12-09 11:44:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1669 transitions. [2018-12-09 11:44:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-09 11:44:20,716 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 240 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 11:44:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1404 states and 1723 transitions. [2018-12-09 11:44:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1723 transitions. [2018-12-09 11:44:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-09 11:44:25,912 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 240 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 11:44:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1409 states and 1733 transitions. [2018-12-09 11:44:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1733 transitions. [2018-12-09 11:44:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 11:44:26,671 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-09 11:44:29,605 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-09 11:44:32,474 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-09 11:44:35,839 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-12-09 11:44:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1457 states and 1784 transitions. [2018-12-09 11:44:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1784 transitions. [2018-12-09 11:44:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 11:44:37,176 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-09 11:44:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1459 states and 1784 transitions. [2018-12-09 11:44:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1784 transitions. [2018-12-09 11:44:38,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 11:44:38,481 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 239 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 11:44:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1510 states and 1838 transitions. [2018-12-09 11:44:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1838 transitions. [2018-12-09 11:44:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 11:44:45,151 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 239 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 11:44:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1513 states and 1841 transitions. [2018-12-09 11:44:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1841 transitions. [2018-12-09 11:44:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-09 11:44:45,812 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-09 11:44:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1583 states and 1915 transitions. [2018-12-09 11:44:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1915 transitions. [2018-12-09 11:44:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 11:44:47,362 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 164 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-09 11:44:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1608 states and 1945 transitions. [2018-12-09 11:44:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1945 transitions. [2018-12-09 11:44:51,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 11:44:51,272 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 164 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-09 11:44:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1610 states and 1946 transitions. [2018-12-09 11:44:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1946 transitions. [2018-12-09 11:44:51,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-09 11:44:51,887 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-09 11:44:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 1707 states and 2049 transitions. [2018-12-09 11:44:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2049 transitions. [2018-12-09 11:44:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-09 11:44:53,633 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 256 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-09 11:44:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:44:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1737 states and 2090 transitions. [2018-12-09 11:44:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2090 transitions. [2018-12-09 11:44:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-09 11:44:58,961 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:44:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:44:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 256 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-09 11:45:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:45:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 1742 states and 2095 transitions. [2018-12-09 11:45:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2095 transitions. [2018-12-09 11:45:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-09 11:45:00,197 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:45:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:45:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 221 proven. 128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 11:45:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:45:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 1790 states and 2158 transitions. [2018-12-09 11:45:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2158 transitions. [2018-12-09 11:45:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-09 11:45:05,412 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:45:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:45:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 221 proven. 128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 11:45:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:45:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 1797 states and 2169 transitions. [2018-12-09 11:45:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2169 transitions. [2018-12-09 11:45:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-12-09 11:45:08,534 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:45:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:45:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 368 proven. 18 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 11:45:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:45:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 1883 states and 2287 transitions. [2018-12-09 11:45:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2287 transitions. [2018-12-09 11:45:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-09 11:45:26,190 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:45:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:45:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 11:45:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:45:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 1964 states and 2386 transitions. [2018-12-09 11:45:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2386 transitions. [2018-12-09 11:45:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-09 11:45:49,184 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:45:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:45:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 11:45:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:45:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 1990 states and 2409 transitions. [2018-12-09 11:45:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2409 transitions. [2018-12-09 11:45:51,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-12-09 11:45:51,371 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:45:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:45:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-09 11:45:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:45:54,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 1998 states and 2417 transitions. [2018-12-09 11:45:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2417 transitions. [2018-12-09 11:45:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-12-09 11:45:54,122 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:45:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:45:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-09 11:45:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:45:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2003 states and 2421 transitions. [2018-12-09 11:45:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2421 transitions. [2018-12-09 11:45:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-09 11:45:55,232 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:45:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:45:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-09 11:46:07,929 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-12-09 11:46:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:46:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2114 states and 2547 transitions. [2018-12-09 11:46:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2547 transitions. [2018-12-09 11:46:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-09 11:46:08,828 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:46:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:46:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-09 11:46:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:46:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2126 states and 2564 transitions. [2018-12-09 11:46:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2564 transitions. [2018-12-09 11:46:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-12-09 11:46:11,347 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:46:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:46:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-09 11:46:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:46:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2156 states and 2599 transitions. [2018-12-09 11:46:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2599 transitions. [2018-12-09 11:46:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-09 11:46:23,237 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:46:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:46:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-09 11:46:32,130 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-12-09 11:46:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:46:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2190 states and 2638 transitions. [2018-12-09 11:46:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2638 transitions. [2018-12-09 11:46:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-09 11:46:38,450 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:46:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:46:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-09 11:46:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:46:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2211 states and 2661 transitions. [2018-12-09 11:46:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2661 transitions. [2018-12-09 11:46:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-09 11:46:46,805 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:46:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:46:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-09 11:46:55,330 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-12-09 11:46:59,241 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2018-12-09 11:47:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:47:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2271 states and 2725 transitions. [2018-12-09 11:47:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 2725 transitions. [2018-12-09 11:47:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-09 11:47:04,465 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:47:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:47:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-09 11:47:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:47:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2274 states and 2729 transitions. [2018-12-09 11:47:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 2729 transitions. [2018-12-09 11:47:06,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-09 11:47:06,265 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:47:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:47:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-09 11:47:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:47:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2277 states and 2732 transitions. [2018-12-09 11:47:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2732 transitions. [2018-12-09 11:47:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-09 11:47:08,631 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:47:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:47:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-09 11:47:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:47:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2282 states and 2737 transitions. [2018-12-09 11:47:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 2737 transitions. [2018-12-09 11:47:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-09 11:47:09,955 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:47:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:47:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-09 11:47:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 11:47:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2287 states and 2741 transitions. [2018-12-09 11:47:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2741 transitions. [2018-12-09 11:47:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-09 11:47:11,205 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 11:47:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:47:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:47:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:47:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:47:11,420 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 106 iterations. [2018-12-09 11:47:11,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 11:47:11 ImpRootNode [2018-12-09 11:47:11,540 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 11:47:11,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:47:11,540 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:47:11,540 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:47:11,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:43:10" (3/4) ... [2018-12-09 11:47:11,542 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 11:47:11,641 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_79ca3a1b-b2f6-4e21-8872-abb9b008c21c/bin-2019/ukojak/witness.graphml [2018-12-09 11:47:11,641 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:47:11,642 INFO L168 Benchmark]: Toolchain (without parser) took 242990.02 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 677.4 MB). Free memory was 949.5 MB in the beginning and 625.4 MB in the end (delta: 324.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-09 11:47:11,642 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:47:11,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:47:11,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 11:47:11,643 INFO L168 Benchmark]: Boogie Preprocessor took 29.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 11:47:11,643 INFO L168 Benchmark]: RCFGBuilder took 1021.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 861.2 MB in the end (delta: 207.3 MB). Peak memory consumption was 207.3 MB. Max. memory is 11.5 GB. [2018-12-09 11:47:11,643 INFO L168 Benchmark]: CodeCheck took 241467.97 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 580.9 MB). Free memory was 861.2 MB in the beginning and 672.3 MB in the end (delta: 188.9 MB). Peak memory consumption was 769.9 MB. Max. memory is 11.5 GB. [2018-12-09 11:47:11,643 INFO L168 Benchmark]: Witness Printer took 101.41 ms. Allocated memory is still 1.7 GB. Free memory was 672.3 MB in the beginning and 625.4 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2018-12-09 11:47:11,644 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 198 locations, 1 error locations. UNSAFE Result, 241.3s OverallTime, 106 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -412772944 SDtfs, -356543932 SDslu, -797731248 SDs, 0 SdLazy, 615802924 SolverSat, 556778112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 315.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122337 GetRequests, 117349 SyntacticMatches, 3414 SemanticMatches, 1574 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1871050 ImplicationChecksByTransitivity, 222.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 27.1s InterpolantComputationTime, 18471 NumberOfCodeBlocks, 18471 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 18083 ConstructedInterpolants, 0 QuantifiedInterpolants, 24316945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 105 InterpolantComputations, 81 PerfectInterpolantSequences, 19383/20029 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 392]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L262] a16 = 4 [L263] a20 = 0 [L264] return 25; VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L239] a20 = 0 [L240] a21 = 1 [L241] a17 = 0 [L242] a8 = 14 [L243] a16 = 4 [L244] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1021.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 861.2 MB in the end (delta: 207.3 MB). Peak memory consumption was 207.3 MB. Max. memory is 11.5 GB. * CodeCheck took 241467.97 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 580.9 MB). Free memory was 861.2 MB in the beginning and 672.3 MB in the end (delta: 188.9 MB). Peak memory consumption was 769.9 MB. Max. memory is 11.5 GB. * Witness Printer took 101.41 ms. Allocated memory is still 1.7 GB. Free memory was 672.3 MB in the beginning and 625.4 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...