./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/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 db6e7a7f3be179438223abf82c6cabe8d26d1cb7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-1dbac8b [2018-10-26 23:39:43,036 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:39:43,038 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:39:43,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:39:43,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:39:43,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:39:43,051 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:39:43,053 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:39:43,054 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:39:43,055 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:39:43,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:39:43,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:39:43,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:39:43,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:39:43,060 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:39:43,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:39:43,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:39:43,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:39:43,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:39:43,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:39:43,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:39:43,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:39:43,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:39:43,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:39:43,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:39:43,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:39:43,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:39:43,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:39:43,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:39:43,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:39:43,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:39:43,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:39:43,083 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:39:43,083 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:39:43,084 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:39:43,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:39:43,085 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 23:39:43,102 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:39:43,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:39:43,104 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:39:43,104 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 23:39:43,104 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 23:39:43,104 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 23:39:43,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:39:43,105 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:39:43,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:39:43,106 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:39:43,107 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:39:43,107 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:39:43,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:39:43,107 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:39:43,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:39:43,107 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:39:43,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:39:43,108 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 23:39:43,108 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 23:39:43,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:39:43,108 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:39:43,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 23:39:43,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:39:43,109 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:39:43,109 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:39:43,109 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 23:39:43,109 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:39:43,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:39:43,110 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_1823435c-6b53-402e-bc97-2b361b54d30c/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 -> db6e7a7f3be179438223abf82c6cabe8d26d1cb7 [2018-10-26 23:39:43,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:39:43,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:39:43,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:39:43,159 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:39:43,159 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:39:43,160 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c [2018-10-26 23:39:43,215 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/bin-2019/ukojak/data/2586c8a7c/84fea21e73e74ef4981c1b91be435793/FLAG18084f89b [2018-10-26 23:39:43,771 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:39:43,772 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c [2018-10-26 23:39:43,790 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/bin-2019/ukojak/data/2586c8a7c/84fea21e73e74ef4981c1b91be435793/FLAG18084f89b [2018-10-26 23:39:43,811 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/bin-2019/ukojak/data/2586c8a7c/84fea21e73e74ef4981c1b91be435793 [2018-10-26 23:39:43,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:39:43,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:39:43,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:39:43,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:39:43,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:39:43,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:39:43" (1/1) ... [2018-10-26 23:39:43,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ccde937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:43, skipping insertion in model container [2018-10-26 23:39:43,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:39:43" (1/1) ... [2018-10-26 23:39:43,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:39:43,918 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:39:44,365 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:39:44,372 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:39:44,495 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:39:44,511 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:39:44,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:44 WrapperNode [2018-10-26 23:39:44,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:39:44,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:39:44,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:39:44,512 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:39:44,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:44" (1/1) ... [2018-10-26 23:39:44,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:44" (1/1) ... [2018-10-26 23:39:44,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:39:44,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:39:44,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:39:44,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:39:44,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:44" (1/1) ... [2018-10-26 23:39:44,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:44" (1/1) ... [2018-10-26 23:39:44,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:44" (1/1) ... [2018-10-26 23:39:44,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:44" (1/1) ... [2018-10-26 23:39:44,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:44" (1/1) ... [2018-10-26 23:39:44,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:44" (1/1) ... [2018-10-26 23:39:44,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:44" (1/1) ... [2018-10-26 23:39:44,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:39:44,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:39:44,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:39:44,790 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:39:44,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:39:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/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-10-26 23:39:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 23:39:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:39:44,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:39:49,503 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:39:49,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:39:49 BoogieIcfgContainer [2018-10-26 23:39:49,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:39:49,504 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 23:39:49,505 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 23:39:49,518 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 23:39:49,518 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:39:49" (1/1) ... [2018-10-26 23:39:49,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:39:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-10-26 23:39:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-10-26 23:39:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 23:39:49,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:50,027 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 23:39:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:39:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 147 states and 235 transitions. [2018-10-26 23:39:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 235 transitions. [2018-10-26 23:39:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 23:39:50,883 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:39:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 211 states and 321 transitions. [2018-10-26 23:39:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 321 transitions. [2018-10-26 23:39:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-26 23:39:51,712 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:39:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 216 states and 329 transitions. [2018-10-26 23:39:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 329 transitions. [2018-10-26 23:39:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 23:39:52,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:39:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 287 states and 403 transitions. [2018-10-26 23:39:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 403 transitions. [2018-10-26 23:39:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 23:39:53,650 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:53,676 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:39:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 288 states and 404 transitions. [2018-10-26 23:39:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2018-10-26 23:39:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 23:39:54,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 23:39:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 301 states and 424 transitions. [2018-10-26 23:39:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 424 transitions. [2018-10-26 23:39:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-26 23:39:54,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:39:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 316 states and 442 transitions. [2018-10-26 23:39:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 442 transitions. [2018-10-26 23:39:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-26 23:39:55,704 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:39:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 325 states and 455 transitions. [2018-10-26 23:39:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 455 transitions. [2018-10-26 23:39:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-26 23:39:56,189 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:39:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 328 states and 458 transitions. [2018-10-26 23:39:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 458 transitions. [2018-10-26 23:39:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-26 23:39:56,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:39:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 332 states and 463 transitions. [2018-10-26 23:39:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 463 transitions. [2018-10-26 23:39:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 23:39:56,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:39:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 348 states and 485 transitions. [2018-10-26 23:39:57,268 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 485 transitions. [2018-10-26 23:39:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 23:39:57,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:39:58,624 WARN L179 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2018-10-26 23:39:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 355 states and 494 transitions. [2018-10-26 23:39:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 494 transitions. [2018-10-26 23:39:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 23:39:58,749 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:39:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:39:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 360 states and 499 transitions. [2018-10-26 23:39:58,900 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 499 transitions. [2018-10-26 23:39:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 23:39:58,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:39:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:39:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:39:59,595 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 23:40:00,246 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 23:40:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 365 states and 505 transitions. [2018-10-26 23:40:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 505 transitions. [2018-10-26 23:40:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-26 23:40:00,273 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 383 states and 525 transitions. [2018-10-26 23:40:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 525 transitions. [2018-10-26 23:40:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-26 23:40:02,089 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 389 states and 532 transitions. [2018-10-26 23:40:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 532 transitions. [2018-10-26 23:40:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-26 23:40:02,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 400 states and 546 transitions. [2018-10-26 23:40:02,443 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 546 transitions. [2018-10-26 23:40:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 23:40:02,444 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:40:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 407 states and 554 transitions. [2018-10-26 23:40:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 554 transitions. [2018-10-26 23:40:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-26 23:40:02,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 23:40:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 408 states and 556 transitions. [2018-10-26 23:40:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 556 transitions. [2018-10-26 23:40:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-26 23:40:02,748 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 23:40:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 409 states and 558 transitions. [2018-10-26 23:40:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 558 transitions. [2018-10-26 23:40:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 23:40:02,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:02,978 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 423 states and 573 transitions. [2018-10-26 23:40:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 573 transitions. [2018-10-26 23:40:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-26 23:40:03,329 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:40:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 432 states and 582 transitions. [2018-10-26 23:40:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 582 transitions. [2018-10-26 23:40:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-26 23:40:03,786 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:40:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 439 states and 588 transitions. [2018-10-26 23:40:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 588 transitions. [2018-10-26 23:40:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 23:40:03,942 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 23:40:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 444 states and 593 transitions. [2018-10-26 23:40:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 593 transitions. [2018-10-26 23:40:03,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 23:40:03,999 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 23:40:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 449 states and 599 transitions. [2018-10-26 23:40:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 599 transitions. [2018-10-26 23:40:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-26 23:40:04,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:05,235 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-10-26 23:40:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:06,842 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 23:40:08,266 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 23:40:09,766 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 23:40:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 456 states and 609 transitions. [2018-10-26 23:40:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 609 transitions. [2018-10-26 23:40:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-26 23:40:10,440 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:40:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 463 states and 616 transitions. [2018-10-26 23:40:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 616 transitions. [2018-10-26 23:40:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-26 23:40:10,903 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:40:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 470 states and 623 transitions. [2018-10-26 23:40:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 623 transitions. [2018-10-26 23:40:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 23:40:11,018 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 490 states and 645 transitions. [2018-10-26 23:40:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 645 transitions. [2018-10-26 23:40:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 23:40:12,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:40:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 492 states and 647 transitions. [2018-10-26 23:40:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 647 transitions. [2018-10-26 23:40:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 23:40:12,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:40:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 494 states and 649 transitions. [2018-10-26 23:40:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 649 transitions. [2018-10-26 23:40:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 23:40:12,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 524 states and 686 transitions. [2018-10-26 23:40:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 686 transitions. [2018-10-26 23:40:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 23:40:13,254 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 530 states and 695 transitions. [2018-10-26 23:40:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 695 transitions. [2018-10-26 23:40:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-26 23:40:13,656 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 534 states and 700 transitions. [2018-10-26 23:40:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 700 transitions. [2018-10-26 23:40:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-26 23:40:13,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 547 states and 715 transitions. [2018-10-26 23:40:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 715 transitions. [2018-10-26 23:40:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-26 23:40:14,309 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:14,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 552 states and 724 transitions. [2018-10-26 23:40:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 724 transitions. [2018-10-26 23:40:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 23:40:14,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 558 states and 730 transitions. [2018-10-26 23:40:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 730 transitions. [2018-10-26 23:40:15,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-26 23:40:15,057 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:40:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 567 states and 739 transitions. [2018-10-26 23:40:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 739 transitions. [2018-10-26 23:40:15,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-26 23:40:15,625 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:40:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 570 states and 741 transitions. [2018-10-26 23:40:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 741 transitions. [2018-10-26 23:40:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 23:40:15,712 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 597 states and 784 transitions. [2018-10-26 23:40:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 784 transitions. [2018-10-26 23:40:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:40:17,542 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 614 states and 806 transitions. [2018-10-26 23:40:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 806 transitions. [2018-10-26 23:40:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 23:40:18,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:40:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 626 states and 818 transitions. [2018-10-26 23:40:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 818 transitions. [2018-10-26 23:40:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 23:40:18,699 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:40:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 638 states and 831 transitions. [2018-10-26 23:40:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 831 transitions. [2018-10-26 23:40:18,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:40:18,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 649 states and 852 transitions. [2018-10-26 23:40:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 852 transitions. [2018-10-26 23:40:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:40:20,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 652 states and 855 transitions. [2018-10-26 23:40:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 855 transitions. [2018-10-26 23:40:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 23:40:20,714 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:40:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 659 states and 863 transitions. [2018-10-26 23:40:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 863 transitions. [2018-10-26 23:40:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 23:40:20,971 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 678 states and 885 transitions. [2018-10-26 23:40:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 885 transitions. [2018-10-26 23:40:21,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-26 23:40:21,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:40:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 728 states and 941 transitions. [2018-10-26 23:40:22,891 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 941 transitions. [2018-10-26 23:40:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-26 23:40:22,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:40:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 772 states and 987 transitions. [2018-10-26 23:40:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 987 transitions. [2018-10-26 23:40:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 23:40:23,973 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:40:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 777 states and 994 transitions. [2018-10-26 23:40:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 994 transitions. [2018-10-26 23:40:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 23:40:24,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:40:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 779 states and 995 transitions. [2018-10-26 23:40:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 995 transitions. [2018-10-26 23:40:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 23:40:24,560 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:40:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 789 states and 1009 transitions. [2018-10-26 23:40:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1009 transitions. [2018-10-26 23:40:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 23:40:25,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:40:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 791 states and 1011 transitions. [2018-10-26 23:40:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1011 transitions. [2018-10-26 23:40:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 23:40:25,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:40:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 793 states and 1013 transitions. [2018-10-26 23:40:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1013 transitions. [2018-10-26 23:40:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 23:40:26,803 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 864 states and 1089 transitions. [2018-10-26 23:40:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1089 transitions. [2018-10-26 23:40:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 23:40:27,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 23:40:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 878 states and 1108 transitions. [2018-10-26 23:40:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1108 transitions. [2018-10-26 23:40:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-26 23:40:28,804 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 23:40:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 880 states and 1110 transitions. [2018-10-26 23:40:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1110 transitions. [2018-10-26 23:40:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 23:40:29,217 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 908 states and 1143 transitions. [2018-10-26 23:40:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1143 transitions. [2018-10-26 23:40:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-26 23:40:29,930 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:40:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 923 states and 1161 transitions. [2018-10-26 23:40:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1161 transitions. [2018-10-26 23:40:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-26 23:40:30,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:40:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 924 states and 1162 transitions. [2018-10-26 23:40:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1162 transitions. [2018-10-26 23:40:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 23:40:30,370 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 23:40:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 927 states and 1164 transitions. [2018-10-26 23:40:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1164 transitions. [2018-10-26 23:40:30,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-26 23:40:30,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 23:40:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 998 states and 1242 transitions. [2018-10-26 23:40:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1242 transitions. [2018-10-26 23:40:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 23:40:31,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 23:40:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1019 states and 1269 transitions. [2018-10-26 23:40:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1269 transitions. [2018-10-26 23:40:32,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 23:40:32,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 23:40:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1053 states and 1304 transitions. [2018-10-26 23:40:34,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1304 transitions. [2018-10-26 23:40:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 23:40:34,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 23:40:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1064 states and 1314 transitions. [2018-10-26 23:40:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1314 transitions. [2018-10-26 23:40:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 23:40:34,835 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:40:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1090 states and 1346 transitions. [2018-10-26 23:40:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1346 transitions. [2018-10-26 23:40:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 23:40:37,105 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 23:40:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1101 states and 1358 transitions. [2018-10-26 23:40:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1358 transitions. [2018-10-26 23:40:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 23:40:37,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 23:40:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1112 states and 1370 transitions. [2018-10-26 23:40:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1370 transitions. [2018-10-26 23:40:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-26 23:40:37,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 23:40:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1113 states and 1371 transitions. [2018-10-26 23:40:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1371 transitions. [2018-10-26 23:40:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-26 23:40:37,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 23:40:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1114 states and 1372 transitions. [2018-10-26 23:40:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1372 transitions. [2018-10-26 23:40:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-26 23:40:37,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-26 23:40:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1133 states and 1397 transitions. [2018-10-26 23:40:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1397 transitions. [2018-10-26 23:40:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 23:40:39,224 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:40:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1134 states and 1398 transitions. [2018-10-26 23:40:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1398 transitions. [2018-10-26 23:40:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 23:40:39,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:40:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1189 states and 1455 transitions. [2018-10-26 23:40:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1455 transitions. [2018-10-26 23:40:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-26 23:40:40,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 23:40:43,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1255 states and 1532 transitions. [2018-10-26 23:40:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1532 transitions. [2018-10-26 23:40:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-26 23:40:43,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 23:40:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1272 states and 1554 transitions. [2018-10-26 23:40:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1554 transitions. [2018-10-26 23:40:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-26 23:40:44,006 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 23:40:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1278 states and 1567 transitions. [2018-10-26 23:40:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1567 transitions. [2018-10-26 23:40:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-26 23:40:44,804 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 23:40:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1304 states and 1597 transitions. [2018-10-26 23:40:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1597 transitions. [2018-10-26 23:40:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-26 23:40:45,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 23:40:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1312 states and 1610 transitions. [2018-10-26 23:40:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1610 transitions. [2018-10-26 23:40:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-26 23:40:46,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 23:40:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1323 states and 1624 transitions. [2018-10-26 23:40:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1624 transitions. [2018-10-26 23:40:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-26 23:40:47,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 23:40:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1327 states and 1629 transitions. [2018-10-26 23:40:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1629 transitions. [2018-10-26 23:40:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-26 23:40:47,881 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 23:40:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1340 states and 1648 transitions. [2018-10-26 23:40:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1648 transitions. [2018-10-26 23:40:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-26 23:40:48,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 23:40:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1363 states and 1670 transitions. [2018-10-26 23:40:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1670 transitions. [2018-10-26 23:40:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-26 23:40:49,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 23:40:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1371 states and 1677 transitions. [2018-10-26 23:40:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1677 transitions. [2018-10-26 23:40:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-26 23:40:49,307 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 23:40:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1429 states and 1736 transitions. [2018-10-26 23:40:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1736 transitions. [2018-10-26 23:40:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-26 23:40:50,001 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 23:40:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1486 states and 1794 transitions. [2018-10-26 23:40:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1794 transitions. [2018-10-26 23:40:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-26 23:40:50,919 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:40:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1516 states and 1828 transitions. [2018-10-26 23:40:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1828 transitions. [2018-10-26 23:40:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-26 23:40:52,622 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:40:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1536 states and 1847 transitions. [2018-10-26 23:40:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1847 transitions. [2018-10-26 23:40:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-26 23:40:52,862 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:40:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1541 states and 1852 transitions. [2018-10-26 23:40:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1852 transitions. [2018-10-26 23:40:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-26 23:40:53,489 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 100 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 23:40:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1548 states and 1858 transitions. [2018-10-26 23:40:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1858 transitions. [2018-10-26 23:40:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-26 23:40:54,070 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-26 23:40:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1563 states and 1880 transitions. [2018-10-26 23:40:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1880 transitions. [2018-10-26 23:40:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-26 23:40:55,628 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:40:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1583 states and 1903 transitions. [2018-10-26 23:40:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1903 transitions. [2018-10-26 23:40:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-26 23:40:56,432 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:40:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:40:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1594 states and 1916 transitions. [2018-10-26 23:40:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1916 transitions. [2018-10-26 23:40:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-26 23:40:57,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:40:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:40:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 23:40:58,343 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-10-26 23:41:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1604 states and 1939 transitions. [2018-10-26 23:41:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1939 transitions. [2018-10-26 23:41:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-26 23:41:00,698 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 23:41:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1607 states and 1941 transitions. [2018-10-26 23:41:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1941 transitions. [2018-10-26 23:41:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-26 23:41:01,297 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 23:41:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1612 states and 1949 transitions. [2018-10-26 23:41:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1949 transitions. [2018-10-26 23:41:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-26 23:41:02,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-26 23:41:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1615 states and 1953 transitions. [2018-10-26 23:41:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1953 transitions. [2018-10-26 23:41:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-26 23:41:04,060 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:41:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1622 states and 1960 transitions. [2018-10-26 23:41:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1960 transitions. [2018-10-26 23:41:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-26 23:41:04,126 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-26 23:41:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1633 states and 1973 transitions. [2018-10-26 23:41:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 1973 transitions. [2018-10-26 23:41:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-26 23:41:05,126 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-26 23:41:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1635 states and 1975 transitions. [2018-10-26 23:41:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1975 transitions. [2018-10-26 23:41:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-26 23:41:05,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 23:41:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1640 states and 1982 transitions. [2018-10-26 23:41:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1982 transitions. [2018-10-26 23:41:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 23:41:06,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 23:41:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1655 states and 1998 transitions. [2018-10-26 23:41:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 1998 transitions. [2018-10-26 23:41:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 23:41:07,660 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 23:41:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 1665 states and 2009 transitions. [2018-10-26 23:41:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2009 transitions. [2018-10-26 23:41:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 23:41:08,268 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 23:41:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 1667 states and 2011 transitions. [2018-10-26 23:41:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2011 transitions. [2018-10-26 23:41:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-26 23:41:08,555 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-26 23:41:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 1677 states and 2023 transitions. [2018-10-26 23:41:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2023 transitions. [2018-10-26 23:41:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 23:41:09,125 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:41:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 1682 states and 2029 transitions. [2018-10-26 23:41:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2029 transitions. [2018-10-26 23:41:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-26 23:41:09,803 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 23:41:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 1692 states and 2043 transitions. [2018-10-26 23:41:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2043 transitions. [2018-10-26 23:41:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-26 23:41:10,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 23:41:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 1693 states and 2044 transitions. [2018-10-26 23:41:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2044 transitions. [2018-10-26 23:41:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-26 23:41:11,617 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-26 23:41:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 1712 states and 2063 transitions. [2018-10-26 23:41:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2063 transitions. [2018-10-26 23:41:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-26 23:41:12,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 23:41:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 1717 states and 2070 transitions. [2018-10-26 23:41:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2070 transitions. [2018-10-26 23:41:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-26 23:41:12,440 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 23:41:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 1725 states and 2077 transitions. [2018-10-26 23:41:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2077 transitions. [2018-10-26 23:41:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-26 23:41:12,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 23:41:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 1726 states and 2078 transitions. [2018-10-26 23:41:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2078 transitions. [2018-10-26 23:41:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-26 23:41:13,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-26 23:41:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 1731 states and 2083 transitions. [2018-10-26 23:41:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2083 transitions. [2018-10-26 23:41:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 23:41:13,378 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 23:41:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 1733 states and 2084 transitions. [2018-10-26 23:41:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2084 transitions. [2018-10-26 23:41:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 23:41:13,842 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:41:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 1734 states and 2085 transitions. [2018-10-26 23:41:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2085 transitions. [2018-10-26 23:41:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 23:41:13,915 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 23:41:14,638 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 23:41:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 1765 states and 2133 transitions. [2018-10-26 23:41:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2133 transitions. [2018-10-26 23:41:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 23:41:16,535 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 23:41:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 1770 states and 2137 transitions. [2018-10-26 23:41:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2137 transitions. [2018-10-26 23:41:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 23:41:17,023 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 23:41:17,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 1777 states and 2144 transitions. [2018-10-26 23:41:17,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2144 transitions. [2018-10-26 23:41:17,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 23:41:17,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 23:41:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 1804 states and 2178 transitions. [2018-10-26 23:41:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2178 transitions. [2018-10-26 23:41:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 23:41:19,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 23:41:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 1816 states and 2192 transitions. [2018-10-26 23:41:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2192 transitions. [2018-10-26 23:41:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 23:41:20,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 23:41:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 1817 states and 2193 transitions. [2018-10-26 23:41:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2193 transitions. [2018-10-26 23:41:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-26 23:41:20,489 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 23:41:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 1818 states and 2195 transitions. [2018-10-26 23:41:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2195 transitions. [2018-10-26 23:41:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 23:41:20,639 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 23:41:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 1842 states and 2223 transitions. [2018-10-26 23:41:22,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2223 transitions. [2018-10-26 23:41:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 23:41:22,086 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 23:41:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 1852 states and 2233 transitions. [2018-10-26 23:41:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2233 transitions. [2018-10-26 23:41:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 23:41:23,177 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 23:41:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 1907 states and 2291 transitions. [2018-10-26 23:41:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2291 transitions. [2018-10-26 23:41:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 23:41:30,263 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 23:41:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 1967 states and 2353 transitions. [2018-10-26 23:41:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2353 transitions. [2018-10-26 23:41:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 23:41:31,798 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 205 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-26 23:41:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 1972 states and 2359 transitions. [2018-10-26 23:41:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2359 transitions. [2018-10-26 23:41:32,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 23:41:32,169 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 23:41:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 1985 states and 2371 transitions. [2018-10-26 23:41:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2371 transitions. [2018-10-26 23:41:32,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 23:41:32,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 23:41:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2016 states and 2401 transitions. [2018-10-26 23:41:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2401 transitions. [2018-10-26 23:41:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 23:41:34,701 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-26 23:41:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2040 states and 2426 transitions. [2018-10-26 23:41:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2426 transitions. [2018-10-26 23:41:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 23:41:35,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:41:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2118 states and 2515 transitions. [2018-10-26 23:41:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 2515 transitions. [2018-10-26 23:41:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-26 23:41:41,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 23:41:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2122 states and 2519 transitions. [2018-10-26 23:41:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2519 transitions. [2018-10-26 23:41:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-26 23:41:41,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 23:41:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2141 states and 2538 transitions. [2018-10-26 23:41:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2538 transitions. [2018-10-26 23:41:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 23:41:42,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-26 23:41:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2161 states and 2561 transitions. [2018-10-26 23:41:43,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2561 transitions. [2018-10-26 23:41:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 23:41:43,521 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-26 23:41:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2172 states and 2572 transitions. [2018-10-26 23:41:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2572 transitions. [2018-10-26 23:41:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-26 23:41:44,556 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-26 23:41:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:47,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2243 states and 2651 transitions. [2018-10-26 23:41:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2651 transitions. [2018-10-26 23:41:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 23:41:47,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 118 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 23:41:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2306 states and 2730 transitions. [2018-10-26 23:41:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2730 transitions. [2018-10-26 23:41:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 23:41:54,765 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 118 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 23:41:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2320 states and 2744 transitions. [2018-10-26 23:41:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 2744 transitions. [2018-10-26 23:41:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 23:41:55,558 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 118 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 23:41:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2332 states and 2757 transitions. [2018-10-26 23:41:56,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2757 transitions. [2018-10-26 23:41:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-26 23:41:56,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 134 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 23:41:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2354 states and 2779 transitions. [2018-10-26 23:41:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 2779 transitions. [2018-10-26 23:41:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-26 23:41:58,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 134 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 23:41:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:41:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2388 states and 2816 transitions. [2018-10-26 23:41:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 2816 transitions. [2018-10-26 23:41:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-26 23:41:59,851 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:41:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:41:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 134 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 23:42:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2400 states and 2828 transitions. [2018-10-26 23:42:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2828 transitions. [2018-10-26 23:42:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-26 23:42:00,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 146 proven. 5 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-10-26 23:42:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2401 states and 2829 transitions. [2018-10-26 23:42:01,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2829 transitions. [2018-10-26 23:42:01,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-26 23:42:01,645 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 146 proven. 5 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-10-26 23:42:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2461 states and 2895 transitions. [2018-10-26 23:42:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 2895 transitions. [2018-10-26 23:42:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-26 23:42:05,275 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 146 proven. 5 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-10-26 23:42:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2475 states and 2907 transitions. [2018-10-26 23:42:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2907 transitions. [2018-10-26 23:42:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-26 23:42:05,472 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 146 proven. 5 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-10-26 23:42:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2496 states and 2931 transitions. [2018-10-26 23:42:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2931 transitions. [2018-10-26 23:42:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-26 23:42:07,379 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-26 23:42:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2531 states and 2976 transitions. [2018-10-26 23:42:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 2976 transitions. [2018-10-26 23:42:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-26 23:42:10,896 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-26 23:42:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2533 states and 2977 transitions. [2018-10-26 23:42:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 2977 transitions. [2018-10-26 23:42:11,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-26 23:42:11,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-10-26 23:42:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2546 states and 2990 transitions. [2018-10-26 23:42:12,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 2990 transitions. [2018-10-26 23:42:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-26 23:42:12,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-10-26 23:42:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:13,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 2559 states and 3002 transitions. [2018-10-26 23:42:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 3002 transitions. [2018-10-26 23:42:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-26 23:42:13,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 258 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-26 23:42:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 2563 states and 3009 transitions. [2018-10-26 23:42:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3009 transitions. [2018-10-26 23:42:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-26 23:42:14,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 258 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-26 23:42:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 2566 states and 3010 transitions. [2018-10-26 23:42:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3010 transitions. [2018-10-26 23:42:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-26 23:42:15,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:42:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 2598 states and 3045 transitions. [2018-10-26 23:42:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3045 transitions. [2018-10-26 23:42:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-26 23:42:17,502 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:42:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 2607 states and 3053 transitions. [2018-10-26 23:42:17,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3053 transitions. [2018-10-26 23:42:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-26 23:42:17,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:17,719 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:42:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 2614 states and 3060 transitions. [2018-10-26 23:42:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 3060 transitions. [2018-10-26 23:42:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-26 23:42:18,613 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-26 23:42:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 2615 states and 3061 transitions. [2018-10-26 23:42:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 3061 transitions. [2018-10-26 23:42:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-26 23:42:18,723 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-26 23:42:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 2616 states and 3062 transitions. [2018-10-26 23:42:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3062 transitions. [2018-10-26 23:42:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-26 23:42:18,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-26 23:42:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 2623 states and 3069 transitions. [2018-10-26 23:42:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 3069 transitions. [2018-10-26 23:42:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-26 23:42:19,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-26 23:42:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 2624 states and 3069 transitions. [2018-10-26 23:42:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3069 transitions. [2018-10-26 23:42:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-26 23:42:19,543 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-26 23:42:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 2707 states and 3160 transitions. [2018-10-26 23:42:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2707 states and 3160 transitions. [2018-10-26 23:42:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-26 23:42:29,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-26 23:42:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 2736 states and 3188 transitions. [2018-10-26 23:42:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3188 transitions. [2018-10-26 23:42:30,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-26 23:42:30,912 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-26 23:42:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 2743 states and 3194 transitions. [2018-10-26 23:42:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 3194 transitions. [2018-10-26 23:42:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-26 23:42:32,037 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-26 23:42:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 2777 states and 3231 transitions. [2018-10-26 23:42:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3231 transitions. [2018-10-26 23:42:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-26 23:42:34,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-26 23:42:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 2781 states and 3234 transitions. [2018-10-26 23:42:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3234 transitions. [2018-10-26 23:42:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-26 23:42:34,351 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-26 23:42:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 2788 states and 3241 transitions. [2018-10-26 23:42:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3241 transitions. [2018-10-26 23:42:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-26 23:42:34,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-26 23:42:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 2795 states and 3251 transitions. [2018-10-26 23:42:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 3251 transitions. [2018-10-26 23:42:34,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 23:42:34,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-26 23:42:47,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3343 states to 2848 states and 3343 transitions. [2018-10-26 23:42:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3343 transitions. [2018-10-26 23:42:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 23:42:47,944 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-26 23:42:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:50,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 2872 states and 3371 transitions. [2018-10-26 23:42:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 3371 transitions. [2018-10-26 23:42:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 23:42:50,914 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-26 23:42:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 2892 states and 3397 transitions. [2018-10-26 23:42:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 3397 transitions. [2018-10-26 23:42:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 23:42:53,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-26 23:42:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 2902 states and 3407 transitions. [2018-10-26 23:42:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 3407 transitions. [2018-10-26 23:42:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 23:42:56,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-26 23:42:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:42:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 2912 states and 3418 transitions. [2018-10-26 23:42:58,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 3418 transitions. [2018-10-26 23:42:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 23:42:58,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:42:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:42:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-26 23:43:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 2921 states and 3431 transitions. [2018-10-26 23:43:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 3431 transitions. [2018-10-26 23:43:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 23:43:00,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-26 23:43:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 2924 states and 3433 transitions. [2018-10-26 23:43:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3433 transitions. [2018-10-26 23:43:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 23:43:02,594 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-26 23:43:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 2925 states and 3434 transitions. [2018-10-26 23:43:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3434 transitions. [2018-10-26 23:43:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-26 23:43:03,650 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 171 proven. 4 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-10-26 23:43:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3497 states to 2974 states and 3497 transitions. [2018-10-26 23:43:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 3497 transitions. [2018-10-26 23:43:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-26 23:43:07,627 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 171 proven. 4 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-10-26 23:43:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 2988 states and 3512 transitions. [2018-10-26 23:43:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 3512 transitions. [2018-10-26 23:43:09,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-26 23:43:09,195 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 171 proven. 4 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-10-26 23:43:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3023 states and 3550 transitions. [2018-10-26 23:43:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3023 states and 3550 transitions. [2018-10-26 23:43:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-26 23:43:10,886 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-26 23:43:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 3061 states and 3591 transitions. [2018-10-26 23:43:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 3591 transitions. [2018-10-26 23:43:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-26 23:43:13,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-26 23:43:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3064 states and 3593 transitions. [2018-10-26 23:43:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 3593 transitions. [2018-10-26 23:43:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-26 23:43:13,178 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-26 23:43:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3081 states and 3610 transitions. [2018-10-26 23:43:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 3610 transitions. [2018-10-26 23:43:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-26 23:43:15,038 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 4 proven. 263 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-26 23:43:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 3094 states and 3627 transitions. [2018-10-26 23:43:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 3627 transitions. [2018-10-26 23:43:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-26 23:43:17,903 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 313 proven. 5 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-26 23:43:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3138 states and 3682 transitions. [2018-10-26 23:43:22,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 3682 transitions. [2018-10-26 23:43:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-26 23:43:22,199 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 313 proven. 5 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-26 23:43:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3156 states and 3700 transitions. [2018-10-26 23:43:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3156 states and 3700 transitions. [2018-10-26 23:43:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-26 23:43:23,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 313 proven. 5 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-26 23:43:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3193 states and 3738 transitions. [2018-10-26 23:43:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 3738 transitions. [2018-10-26 23:43:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-26 23:43:26,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-26 23:43:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3242 states and 3790 transitions. [2018-10-26 23:43:35,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 3790 transitions. [2018-10-26 23:43:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-26 23:43:35,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-26 23:43:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3253 states and 3800 transitions. [2018-10-26 23:43:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 3800 transitions. [2018-10-26 23:43:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-26 23:43:37,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 182 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-26 23:43:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3280 states and 3827 transitions. [2018-10-26 23:43:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 3827 transitions. [2018-10-26 23:43:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-26 23:43:41,222 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 182 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-26 23:43:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3281 states and 3827 transitions. [2018-10-26 23:43:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 3827 transitions. [2018-10-26 23:43:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-26 23:43:41,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 182 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-26 23:43:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3302 states and 3850 transitions. [2018-10-26 23:43:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 3850 transitions. [2018-10-26 23:43:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-26 23:43:44,121 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 182 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-26 23:43:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3304 states and 3852 transitions. [2018-10-26 23:43:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 3852 transitions. [2018-10-26 23:43:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-26 23:43:44,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 182 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-26 23:43:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3867 states to 3320 states and 3867 transitions. [2018-10-26 23:43:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 3867 transitions. [2018-10-26 23:43:46,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-26 23:43:46,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-10-26 23:43:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3335 states and 3882 transitions. [2018-10-26 23:43:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 3882 transitions. [2018-10-26 23:43:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-26 23:43:47,368 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-10-26 23:43:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3352 states and 3897 transitions. [2018-10-26 23:43:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 3897 transitions. [2018-10-26 23:43:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-26 23:43:48,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:43:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-26 23:43:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:43:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3379 states and 3921 transitions. [2018-10-26 23:43:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 3921 transitions. [2018-10-26 23:43:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-26 23:43:50,667 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:43:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:43:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:43:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:43:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:43:51,019 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 194 iterations. [2018-10-26 23:43:51,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 11:43:51 ImpRootNode [2018-10-26 23:43:51,269 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 23:43:51,269 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:43:51,269 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:43:51,271 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:43:51,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:39:49" (3/4) ... [2018-10-26 23:43:51,274 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 23:43:51,441 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1823435c-6b53-402e-bc97-2b361b54d30c/bin-2019/ukojak/witness.graphml [2018-10-26 23:43:51,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:43:51,443 INFO L168 Benchmark]: Toolchain (without parser) took 247624.32 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 951.8 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-10-26 23:43:51,443 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:43:51,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.42 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 922.2 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-26 23:43:51,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.92 ms. Allocated memory is still 1.0 GB. Free memory was 922.2 MB in the beginning and 914.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:43:51,444 INFO L168 Benchmark]: Boogie Preprocessor took 190.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 914.2 MB in the beginning and 1.2 GB in the end (delta: -240.2 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-10-26 23:43:51,444 INFO L168 Benchmark]: RCFGBuilder took 4714.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 928.4 MB in the end (delta: 226.0 MB). Peak memory consumption was 226.0 MB. Max. memory is 11.5 GB. [2018-10-26 23:43:51,444 INFO L168 Benchmark]: CodeCheck took 241764.45 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 928.4 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-10-26 23:43:51,445 INFO L168 Benchmark]: Witness Printer took 172.71 ms. Allocated memory is still 4.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:43:51,451 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, 199 locations, 1 error locations. UNSAFE Result, 241.4s OverallTime, 194 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1077257216 SDtfs, 1550223094 SDslu, 28124160 SDs, 0 SdLazy, -405705030 SolverSat, 1714930204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1486.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220850 GetRequests, 217245 SyntacticMatches, 1847 SemanticMatches, 1758 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2126622 ImplicationChecksByTransitivity, 207.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 1.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 34.4s InterpolantComputationTime, 33370 NumberOfCodeBlocks, 33370 NumberOfCodeBlocksAsserted, 194 NumberOfCheckSat, 32908 ConstructedInterpolants, 0 QuantifiedInterpolants, 18662368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 193 InterpolantComputations, 159 PerfectInterpolantSequences, 32569/32965 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: 395]: 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)) [L591] CALL, EXPR calculate_output(input) [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] RET 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] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [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] RET 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] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [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] RET 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] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [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] RET 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] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [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 TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L149] a16 = 4 [L150] a17 = 0 [L151] RET return 25; VAL [a=1, a12=8, a16=4, a17=0, 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] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [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=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=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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=4, a17=0, 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 TRUE ((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))) [L232] a8 = 14 [L233] a7 = 0 [L234] a17 = 1 [L235] a21 = 1 [L236] a16 = 4 [L237] RET return -1; VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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] EXPR calculate_output(input) [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)) [L591] CALL calculate_output(input) [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=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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=1, a20=1, a21=1, a7=0, 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)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L395] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 691.42 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 922.2 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.92 ms. Allocated memory is still 1.0 GB. Free memory was 922.2 MB in the beginning and 914.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 190.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 914.2 MB in the beginning and 1.2 GB in the end (delta: -240.2 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4714.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 928.4 MB in the end (delta: 226.0 MB). Peak memory consumption was 226.0 MB. Max. memory is 11.5 GB. * CodeCheck took 241764.45 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 928.4 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 172.71 ms. Allocated memory is still 4.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...