./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_52ff625d-5afe-4dad-992a-8c88bd20e711/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_52ff625d-5afe-4dad-992a-8c88bd20e711/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_52ff625d-5afe-4dad-992a-8c88bd20e711/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_52ff625d-5afe-4dad-992a-8c88bd20e711/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_52ff625d-5afe-4dad-992a-8c88bd20e711/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_52ff625d-5afe-4dad-992a-8c88bd20e711/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-11-10 08:42:44,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:42:44,146 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:42:44,152 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:42:44,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:42:44,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:42:44,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:42:44,154 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:42:44,155 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:42:44,156 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:42:44,157 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:42:44,157 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:42:44,157 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:42:44,158 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:42:44,159 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:42:44,159 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:42:44,159 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:42:44,160 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:42:44,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:42:44,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:42:44,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:42:44,164 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:42:44,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:42:44,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:42:44,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:42:44,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:42:44,167 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:42:44,167 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:42:44,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:42:44,168 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:42:44,169 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:42:44,169 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:42:44,169 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:42:44,169 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:42:44,170 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:42:44,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:42:44,170 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_52ff625d-5afe-4dad-992a-8c88bd20e711/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 08:42:44,180 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:42:44,180 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:42:44,181 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:42:44,181 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 08:42:44,181 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:42:44,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:42:44,182 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:42:44,182 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:42:44,182 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:42:44,182 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:42:44,182 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:42:44,182 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 08:42:44,183 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:42:44,183 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 08:42:44,183 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:42:44,183 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:42:44,183 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 08:42:44,183 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 08:42:44,183 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 08:42:44,183 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:42:44,184 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:42:44,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 08:42:44,184 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:42:44,184 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:42:44,184 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 08:42:44,184 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 08:42:44,184 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:42:44,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:42:44,185 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_52ff625d-5afe-4dad-992a-8c88bd20e711/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-11-10 08:42:44,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:42:44,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:42:44,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:42:44,221 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:42:44,221 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:42:44,222 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_52ff625d-5afe-4dad-992a-8c88bd20e711/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c [2018-11-10 08:42:44,265 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52ff625d-5afe-4dad-992a-8c88bd20e711/bin-2019/ukojak/data/5075de0a6/0fafdc3dd8084e51a6953bc334f99bc1/FLAG5acb9b0ee [2018-11-10 08:42:44,650 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:42:44,650 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_52ff625d-5afe-4dad-992a-8c88bd20e711/sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c [2018-11-10 08:42:44,660 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52ff625d-5afe-4dad-992a-8c88bd20e711/bin-2019/ukojak/data/5075de0a6/0fafdc3dd8084e51a6953bc334f99bc1/FLAG5acb9b0ee [2018-11-10 08:42:44,670 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_52ff625d-5afe-4dad-992a-8c88bd20e711/bin-2019/ukojak/data/5075de0a6/0fafdc3dd8084e51a6953bc334f99bc1 [2018-11-10 08:42:44,673 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:42:44,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:42:44,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:42:44,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:42:44,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:42:44,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:42:44" (1/1) ... [2018-11-10 08:42:44,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@445860ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:44, skipping insertion in model container [2018-11-10 08:42:44,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:42:44" (1/1) ... [2018-11-10 08:42:44,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:42:44,717 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:42:44,941 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:42:44,944 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:42:45,008 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:42:45,020 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:42:45,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:45 WrapperNode [2018-11-10 08:42:45,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:42:45,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:42:45,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:42:45,021 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:42:45,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:45" (1/1) ... [2018-11-10 08:42:45,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:45" (1/1) ... [2018-11-10 08:42:45,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:42:45,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:42:45,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:42:45,122 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:42:45,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:45" (1/1) ... [2018-11-10 08:42:45,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:45" (1/1) ... [2018-11-10 08:42:45,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:45" (1/1) ... [2018-11-10 08:42:45,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:45" (1/1) ... [2018-11-10 08:42:45,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:45" (1/1) ... [2018-11-10 08:42:45,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:45" (1/1) ... [2018-11-10 08:42:45,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:45" (1/1) ... [2018-11-10 08:42:45,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:42:45,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:42:45,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:42:45,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:42:45,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52ff625d-5afe-4dad-992a-8c88bd20e711/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-11-10 08:42:45,213 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 08:42:45,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:42:45,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:42:46,436 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:42:46,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:42:46 BoogieIcfgContainer [2018-11-10 08:42:46,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:42:46,437 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 08:42:46,437 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 08:42:46,444 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 08:42:46,444 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:42:46" (1/1) ... [2018-11-10 08:42:46,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-10 08:42:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-10 08:42:46,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 08:42:46,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 147 states and 235 transitions. [2018-11-10 08:42:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 235 transitions. [2018-11-10 08:42:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 08:42:47,052 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 211 states and 321 transitions. [2018-11-10 08:42:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 321 transitions. [2018-11-10 08:42:47,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 08:42:47,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 216 states and 329 transitions. [2018-11-10 08:42:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 329 transitions. [2018-11-10 08:42:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 08:42:47,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 287 states and 403 transitions. [2018-11-10 08:42:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 403 transitions. [2018-11-10 08:42:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 08:42:48,110 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:42:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 288 states and 404 transitions. [2018-11-10 08:42:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2018-11-10 08:42:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 08:42:48,189 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 08:42:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 301 states and 424 transitions. [2018-11-10 08:42:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 424 transitions. [2018-11-10 08:42:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 08:42:48,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 316 states and 442 transitions. [2018-11-10 08:42:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 442 transitions. [2018-11-10 08:42:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 08:42:48,862 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 08:42:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 325 states and 455 transitions. [2018-11-10 08:42:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 455 transitions. [2018-11-10 08:42:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 08:42:49,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 08:42:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 328 states and 458 transitions. [2018-11-10 08:42:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 458 transitions. [2018-11-10 08:42:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 08:42:49,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 332 states and 463 transitions. [2018-11-10 08:42:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 463 transitions. [2018-11-10 08:42:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 08:42:49,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 348 states and 485 transitions. [2018-11-10 08:42:50,085 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 485 transitions. [2018-11-10 08:42:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 08:42:50,086 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 355 states and 494 transitions. [2018-11-10 08:42:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 494 transitions. [2018-11-10 08:42:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 08:42:50,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 08:42:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 360 states and 499 transitions. [2018-11-10 08:42:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 499 transitions. [2018-11-10 08:42:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 08:42:50,512 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 08:42:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 365 states and 505 transitions. [2018-11-10 08:42:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 505 transitions. [2018-11-10 08:42:50,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 08:42:50,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 383 states and 525 transitions. [2018-11-10 08:42:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 525 transitions. [2018-11-10 08:42:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 08:42:51,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 389 states and 532 transitions. [2018-11-10 08:42:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 532 transitions. [2018-11-10 08:42:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 08:42:51,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 400 states and 546 transitions. [2018-11-10 08:42:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 546 transitions. [2018-11-10 08:42:51,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 08:42:51,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:42:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 407 states and 554 transitions. [2018-11-10 08:42:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 554 transitions. [2018-11-10 08:42:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 08:42:51,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:42:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 408 states and 556 transitions. [2018-11-10 08:42:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 556 transitions. [2018-11-10 08:42:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 08:42:51,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:42:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 409 states and 558 transitions. [2018-11-10 08:42:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 558 transitions. [2018-11-10 08:42:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 08:42:51,722 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 423 states and 573 transitions. [2018-11-10 08:42:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 573 transitions. [2018-11-10 08:42:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 08:42:52,082 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:42:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 432 states and 582 transitions. [2018-11-10 08:42:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 582 transitions. [2018-11-10 08:42:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 08:42:52,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:42:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 439 states and 588 transitions. [2018-11-10 08:42:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 588 transitions. [2018-11-10 08:42:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 08:42:52,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:42:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 444 states and 593 transitions. [2018-11-10 08:42:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 593 transitions. [2018-11-10 08:42:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 08:42:52,510 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:42:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 449 states and 599 transitions. [2018-11-10 08:42:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 599 transitions. [2018-11-10 08:42:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 08:42:52,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 456 states and 609 transitions. [2018-11-10 08:42:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 609 transitions. [2018-11-10 08:42:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 08:42:53,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 08:42:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 463 states and 616 transitions. [2018-11-10 08:42:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 616 transitions. [2018-11-10 08:42:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 08:42:53,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 08:42:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 470 states and 623 transitions. [2018-11-10 08:42:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 623 transitions. [2018-11-10 08:42:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 08:42:53,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 490 states and 645 transitions. [2018-11-10 08:42:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 645 transitions. [2018-11-10 08:42:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 08:42:54,273 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 08:42:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 492 states and 647 transitions. [2018-11-10 08:42:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 647 transitions. [2018-11-10 08:42:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 08:42:54,305 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 08:42:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 494 states and 649 transitions. [2018-11-10 08:42:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 649 transitions. [2018-11-10 08:42:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 08:42:54,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 524 states and 686 transitions. [2018-11-10 08:42:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 686 transitions. [2018-11-10 08:42:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 08:42:55,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 530 states and 695 transitions. [2018-11-10 08:42:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 695 transitions. [2018-11-10 08:42:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 08:42:55,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 534 states and 700 transitions. [2018-11-10 08:42:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 700 transitions. [2018-11-10 08:42:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 08:42:55,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 547 states and 715 transitions. [2018-11-10 08:42:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 715 transitions. [2018-11-10 08:42:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 08:42:56,038 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 552 states and 724 transitions. [2018-11-10 08:42:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 724 transitions. [2018-11-10 08:42:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 08:42:56,373 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 558 states and 730 transitions. [2018-11-10 08:42:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 730 transitions. [2018-11-10 08:42:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 08:42:56,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:42:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 567 states and 739 transitions. [2018-11-10 08:42:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 739 transitions. [2018-11-10 08:42:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 08:42:56,755 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:42:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 570 states and 741 transitions. [2018-11-10 08:42:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 741 transitions. [2018-11-10 08:42:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 08:42:56,787 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 597 states and 784 transitions. [2018-11-10 08:42:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 784 transitions. [2018-11-10 08:42:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 08:42:57,999 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 614 states and 806 transitions. [2018-11-10 08:42:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 806 transitions. [2018-11-10 08:42:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 08:42:58,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 08:42:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 626 states and 818 transitions. [2018-11-10 08:42:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 818 transitions. [2018-11-10 08:42:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 08:42:58,654 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 08:42:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 638 states and 831 transitions. [2018-11-10 08:42:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 831 transitions. [2018-11-10 08:42:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 08:42:58,810 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 649 states and 852 transitions. [2018-11-10 08:42:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 852 transitions. [2018-11-10 08:42:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 08:42:59,644 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:42:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 652 states and 855 transitions. [2018-11-10 08:42:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 855 transitions. [2018-11-10 08:42:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 08:42:59,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:42:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 08:43:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 659 states and 863 transitions. [2018-11-10 08:43:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 863 transitions. [2018-11-10 08:43:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 08:43:00,139 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:43:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 678 states and 885 transitions. [2018-11-10 08:43:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 885 transitions. [2018-11-10 08:43:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 08:43:00,382 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 08:43:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 728 states and 941 transitions. [2018-11-10 08:43:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 941 transitions. [2018-11-10 08:43:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 08:43:01,309 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 08:43:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 772 states and 987 transitions. [2018-11-10 08:43:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 987 transitions. [2018-11-10 08:43:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 08:43:02,222 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 08:43:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 777 states and 994 transitions. [2018-11-10 08:43:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 994 transitions. [2018-11-10 08:43:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 08:43:02,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:43:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 779 states and 995 transitions. [2018-11-10 08:43:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 995 transitions. [2018-11-10 08:43:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 08:43:02,645 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:43:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 789 states and 1009 transitions. [2018-11-10 08:43:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1009 transitions. [2018-11-10 08:43:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 08:43:03,331 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:43:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 791 states and 1011 transitions. [2018-11-10 08:43:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1011 transitions. [2018-11-10 08:43:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 08:43:03,666 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 08:43:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 793 states and 1013 transitions. [2018-11-10 08:43:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1013 transitions. [2018-11-10 08:43:04,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 08:43:04,081 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:43:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 864 states and 1089 transitions. [2018-11-10 08:43:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1089 transitions. [2018-11-10 08:43:04,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 08:43:04,922 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 08:43:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 878 states and 1108 transitions. [2018-11-10 08:43:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1108 transitions. [2018-11-10 08:43:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 08:43:05,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 08:43:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 880 states and 1110 transitions. [2018-11-10 08:43:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1110 transitions. [2018-11-10 08:43:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 08:43:05,751 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:43:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 908 states and 1143 transitions. [2018-11-10 08:43:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1143 transitions. [2018-11-10 08:43:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 08:43:06,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 08:43:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 923 states and 1161 transitions. [2018-11-10 08:43:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1161 transitions. [2018-11-10 08:43:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 08:43:06,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 08:43:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 924 states and 1162 transitions. [2018-11-10 08:43:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1162 transitions. [2018-11-10 08:43:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 08:43:06,622 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-10 08:43:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 927 states and 1164 transitions. [2018-11-10 08:43:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1164 transitions. [2018-11-10 08:43:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 08:43:06,711 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 08:43:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 998 states and 1242 transitions. [2018-11-10 08:43:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1242 transitions. [2018-11-10 08:43:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 08:43:07,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 08:43:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1019 states and 1269 transitions. [2018-11-10 08:43:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1269 transitions. [2018-11-10 08:43:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 08:43:08,224 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:43:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1053 states and 1304 transitions. [2018-11-10 08:43:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1304 transitions. [2018-11-10 08:43:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 08:43:08,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:43:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1064 states and 1314 transitions. [2018-11-10 08:43:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1314 transitions. [2018-11-10 08:43:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 08:43:08,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:43:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1090 states and 1346 transitions. [2018-11-10 08:43:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1346 transitions. [2018-11-10 08:43:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 08:43:10,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 08:43:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1101 states and 1358 transitions. [2018-11-10 08:43:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1358 transitions. [2018-11-10 08:43:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 08:43:10,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 08:43:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1112 states and 1370 transitions. [2018-11-10 08:43:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1370 transitions. [2018-11-10 08:43:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 08:43:10,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 08:43:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1113 states and 1371 transitions. [2018-11-10 08:43:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1371 transitions. [2018-11-10 08:43:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 08:43:10,654 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 08:43:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1114 states and 1372 transitions. [2018-11-10 08:43:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1372 transitions. [2018-11-10 08:43:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 08:43:10,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:10,770 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 08:43:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1133 states and 1397 transitions. [2018-11-10 08:43:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1397 transitions. [2018-11-10 08:43:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 08:43:11,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 08:43:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1134 states and 1398 transitions. [2018-11-10 08:43:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1398 transitions. [2018-11-10 08:43:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 08:43:11,851 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 08:43:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1189 states and 1455 transitions. [2018-11-10 08:43:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1455 transitions. [2018-11-10 08:43:12,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 08:43:12,289 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 08:43:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1255 states and 1532 transitions. [2018-11-10 08:43:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1532 transitions. [2018-11-10 08:43:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 08:43:14,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 08:43:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1272 states and 1554 transitions. [2018-11-10 08:43:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1554 transitions. [2018-11-10 08:43:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 08:43:14,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 08:43:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1278 states and 1567 transitions. [2018-11-10 08:43:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1567 transitions. [2018-11-10 08:43:15,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 08:43:15,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 08:43:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1304 states and 1597 transitions. [2018-11-10 08:43:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1597 transitions. [2018-11-10 08:43:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 08:43:16,160 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:43:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1312 states and 1610 transitions. [2018-11-10 08:43:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1610 transitions. [2018-11-10 08:43:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 08:43:16,556 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:43:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1323 states and 1624 transitions. [2018-11-10 08:43:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1624 transitions. [2018-11-10 08:43:17,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 08:43:17,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 08:43:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1327 states and 1629 transitions. [2018-11-10 08:43:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1629 transitions. [2018-11-10 08:43:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 08:43:17,587 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:43:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1340 states and 1648 transitions. [2018-11-10 08:43:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1648 transitions. [2018-11-10 08:43:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 08:43:18,112 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 08:43:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1363 states and 1670 transitions. [2018-11-10 08:43:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1670 transitions. [2018-11-10 08:43:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 08:43:18,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 08:43:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1371 states and 1677 transitions. [2018-11-10 08:43:18,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1677 transitions. [2018-11-10 08:43:18,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 08:43:18,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 08:43:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1429 states and 1736 transitions. [2018-11-10 08:43:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1736 transitions. [2018-11-10 08:43:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 08:43:18,978 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 08:43:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1486 states and 1794 transitions. [2018-11-10 08:43:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1794 transitions. [2018-11-10 08:43:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 08:43:19,605 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 08:43:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1516 states and 1828 transitions. [2018-11-10 08:43:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1828 transitions. [2018-11-10 08:43:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 08:43:20,825 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 08:43:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1521 states and 1833 transitions. [2018-11-10 08:43:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1833 transitions. [2018-11-10 08:43:21,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 08:43:21,261 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 08:43:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1541 states and 1852 transitions. [2018-11-10 08:43:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1852 transitions. [2018-11-10 08:43:21,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-10 08:43:21,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 100 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 08:43:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1548 states and 1858 transitions. [2018-11-10 08:43:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1858 transitions. [2018-11-10 08:43:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-10 08:43:21,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-10 08:43:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1563 states and 1880 transitions. [2018-11-10 08:43:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1880 transitions. [2018-11-10 08:43:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 08:43:22,961 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:43:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1587 states and 1909 transitions. [2018-11-10 08:43:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1909 transitions. [2018-11-10 08:43:23,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 08:43:23,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:43:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1594 states and 1916 transitions. [2018-11-10 08:43:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1916 transitions. [2018-11-10 08:43:24,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 08:43:24,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 08:43:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1604 states and 1939 transitions. [2018-11-10 08:43:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1939 transitions. [2018-11-10 08:43:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 08:43:26,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 08:43:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1607 states and 1941 transitions. [2018-11-10 08:43:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1941 transitions. [2018-11-10 08:43:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 08:43:26,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 08:43:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1612 states and 1949 transitions. [2018-11-10 08:43:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1949 transitions. [2018-11-10 08:43:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-10 08:43:27,797 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 08:43:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1615 states and 1953 transitions. [2018-11-10 08:43:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1953 transitions. [2018-11-10 08:43:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 08:43:28,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 08:43:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1622 states and 1960 transitions. [2018-11-10 08:43:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1960 transitions. [2018-11-10 08:43:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 08:43:28,614 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-10 08:43:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1633 states and 1973 transitions. [2018-11-10 08:43:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 1973 transitions. [2018-11-10 08:43:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 08:43:29,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-10 08:43:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1635 states and 1975 transitions. [2018-11-10 08:43:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1975 transitions. [2018-11-10 08:43:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 08:43:29,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 08:43:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1640 states and 1982 transitions. [2018-11-10 08:43:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1982 transitions. [2018-11-10 08:43:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 08:43:30,716 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 08:43:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1655 states and 1999 transitions. [2018-11-10 08:43:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 1999 transitions. [2018-11-10 08:43:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 08:43:31,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 08:43:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 1657 states and 2001 transitions. [2018-11-10 08:43:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2001 transitions. [2018-11-10 08:43:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 08:43:31,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 08:43:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 1667 states and 2011 transitions. [2018-11-10 08:43:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2011 transitions. [2018-11-10 08:43:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 08:43:31,985 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 08:43:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 1677 states and 2023 transitions. [2018-11-10 08:43:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2023 transitions. [2018-11-10 08:43:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 08:43:32,368 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:43:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 1682 states and 2029 transitions. [2018-11-10 08:43:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2029 transitions. [2018-11-10 08:43:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 08:43:32,720 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 08:43:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 1692 states and 2043 transitions. [2018-11-10 08:43:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2043 transitions. [2018-11-10 08:43:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 08:43:33,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 08:43:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 1693 states and 2044 transitions. [2018-11-10 08:43:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2044 transitions. [2018-11-10 08:43:33,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 08:43:33,633 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 08:43:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 1712 states and 2063 transitions. [2018-11-10 08:43:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2063 transitions. [2018-11-10 08:43:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 08:43:33,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 08:43:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 1726 states and 2078 transitions. [2018-11-10 08:43:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2078 transitions. [2018-11-10 08:43:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 08:43:34,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 08:43:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 1731 states and 2083 transitions. [2018-11-10 08:43:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2083 transitions. [2018-11-10 08:43:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 08:43:34,707 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:43:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 1733 states and 2084 transitions. [2018-11-10 08:43:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2084 transitions. [2018-11-10 08:43:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 08:43:35,057 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 08:43:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 1734 states and 2085 transitions. [2018-11-10 08:43:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2085 transitions. [2018-11-10 08:43:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 08:43:35,121 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 08:43:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 1765 states and 2133 transitions. [2018-11-10 08:43:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2133 transitions. [2018-11-10 08:43:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 08:43:36,744 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 08:43:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 1770 states and 2137 transitions. [2018-11-10 08:43:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2137 transitions. [2018-11-10 08:43:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 08:43:37,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 08:43:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 1777 states and 2144 transitions. [2018-11-10 08:43:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2144 transitions. [2018-11-10 08:43:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 08:43:37,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 08:43:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 1804 states and 2178 transitions. [2018-11-10 08:43:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2178 transitions. [2018-11-10 08:43:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 08:43:38,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 08:43:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 1816 states and 2192 transitions. [2018-11-10 08:43:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2192 transitions. [2018-11-10 08:43:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 08:43:38,982 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 08:43:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 1817 states and 2193 transitions. [2018-11-10 08:43:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2193 transitions. [2018-11-10 08:43:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 08:43:39,197 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 08:43:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 1818 states and 2195 transitions. [2018-11-10 08:43:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2195 transitions. [2018-11-10 08:43:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 08:43:39,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 08:43:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 1842 states and 2223 transitions. [2018-11-10 08:43:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2223 transitions. [2018-11-10 08:43:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 08:43:40,296 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 08:43:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 1852 states and 2233 transitions. [2018-11-10 08:43:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2233 transitions. [2018-11-10 08:43:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 08:43:41,066 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 08:43:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 1907 states and 2291 transitions. [2018-11-10 08:43:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2291 transitions. [2018-11-10 08:43:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 08:43:46,081 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 08:43:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 1967 states and 2353 transitions. [2018-11-10 08:43:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2353 transitions. [2018-11-10 08:43:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 08:43:47,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 205 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 08:43:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 1972 states and 2359 transitions. [2018-11-10 08:43:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2359 transitions. [2018-11-10 08:43:47,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 08:43:47,406 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 08:43:47,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 1985 states and 2371 transitions. [2018-11-10 08:43:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2371 transitions. [2018-11-10 08:43:47,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 08:43:47,644 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 08:43:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2016 states and 2401 transitions. [2018-11-10 08:43:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2401 transitions. [2018-11-10 08:43:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 08:43:48,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-10 08:43:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2040 states and 2426 transitions. [2018-11-10 08:43:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2426 transitions. [2018-11-10 08:43:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 08:43:49,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:43:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2118 states and 2515 transitions. [2018-11-10 08:43:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 2515 transitions. [2018-11-10 08:43:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 08:43:53,305 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 08:43:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2122 states and 2519 transitions. [2018-11-10 08:43:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2519 transitions. [2018-11-10 08:43:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 08:43:53,688 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 08:43:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2141 states and 2538 transitions. [2018-11-10 08:43:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2538 transitions. [2018-11-10 08:43:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 08:43:53,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-10 08:43:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2161 states and 2561 transitions. [2018-11-10 08:43:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2561 transitions. [2018-11-10 08:43:54,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 08:43:54,716 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-10 08:43:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2172 states and 2572 transitions. [2018-11-10 08:43:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2572 transitions. [2018-11-10 08:43:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 08:43:55,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 08:43:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:43:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2243 states and 2651 transitions. [2018-11-10 08:43:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2651 transitions. [2018-11-10 08:43:56,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 08:43:56,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:43:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:43:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 118 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 08:44:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2306 states and 2730 transitions. [2018-11-10 08:44:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2730 transitions. [2018-11-10 08:44:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 08:44:01,816 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 118 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 08:44:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2320 states and 2744 transitions. [2018-11-10 08:44:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 2744 transitions. [2018-11-10 08:44:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 08:44:02,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 118 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 08:44:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:03,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2332 states and 2757 transitions. [2018-11-10 08:44:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2757 transitions. [2018-11-10 08:44:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-10 08:44:03,236 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 134 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 08:44:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2354 states and 2779 transitions. [2018-11-10 08:44:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 2779 transitions. [2018-11-10 08:44:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-10 08:44:03,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 134 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 08:44:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2400 states and 2828 transitions. [2018-11-10 08:44:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2828 transitions. [2018-11-10 08:44:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 08:44:05,784 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 146 proven. 5 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-10 08:44:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2401 states and 2829 transitions. [2018-11-10 08:44:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2829 transitions. [2018-11-10 08:44:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 08:44:06,228 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 146 proven. 5 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-10 08:44:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2461 states and 2895 transitions. [2018-11-10 08:44:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 2895 transitions. [2018-11-10 08:44:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 08:44:08,691 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 146 proven. 5 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-10 08:44:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2475 states and 2907 transitions. [2018-11-10 08:44:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2907 transitions. [2018-11-10 08:44:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 08:44:08,848 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 146 proven. 5 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-10 08:44:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2496 states and 2931 transitions. [2018-11-10 08:44:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2931 transitions. [2018-11-10 08:44:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-10 08:44:10,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 08:44:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2531 states and 2976 transitions. [2018-11-10 08:44:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 2976 transitions. [2018-11-10 08:44:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-10 08:44:12,649 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 08:44:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2533 states and 2977 transitions. [2018-11-10 08:44:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 2977 transitions. [2018-11-10 08:44:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-10 08:44:13,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-11-10 08:44:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2546 states and 2990 transitions. [2018-11-10 08:44:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 2990 transitions. [2018-11-10 08:44:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-10 08:44:13,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-11-10 08:44:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 2559 states and 3002 transitions. [2018-11-10 08:44:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 3002 transitions. [2018-11-10 08:44:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-10 08:44:14,256 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 258 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 08:44:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 2563 states and 3009 transitions. [2018-11-10 08:44:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3009 transitions. [2018-11-10 08:44:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-10 08:44:15,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:15,389 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 258 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 08:44:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 2565 states and 3010 transitions. [2018-11-10 08:44:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3010 transitions. [2018-11-10 08:44:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-10 08:44:15,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 258 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 08:44:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 2566 states and 3010 transitions. [2018-11-10 08:44:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3010 transitions. [2018-11-10 08:44:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-10 08:44:16,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 08:44:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 2607 states and 3053 transitions. [2018-11-10 08:44:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3053 transitions. [2018-11-10 08:44:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-10 08:44:17,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 08:44:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 2614 states and 3060 transitions. [2018-11-10 08:44:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 3060 transitions. [2018-11-10 08:44:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-10 08:44:18,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-10 08:44:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 2615 states and 3061 transitions. [2018-11-10 08:44:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 3061 transitions. [2018-11-10 08:44:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-10 08:44:18,367 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-10 08:44:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 2616 states and 3062 transitions. [2018-11-10 08:44:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3062 transitions. [2018-11-10 08:44:18,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-10 08:44:18,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-10 08:44:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 2623 states and 3069 transitions. [2018-11-10 08:44:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 3069 transitions. [2018-11-10 08:44:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-10 08:44:18,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-10 08:44:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 2624 states and 3069 transitions. [2018-11-10 08:44:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3069 transitions. [2018-11-10 08:44:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-10 08:44:18,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 08:44:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 2736 states and 3188 transitions. [2018-11-10 08:44:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3188 transitions. [2018-11-10 08:44:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-10 08:44:26,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 08:44:26,536 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-10 08:44:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 2743 states and 3194 transitions. [2018-11-10 08:44:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 3194 transitions. [2018-11-10 08:44:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-10 08:44:26,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 08:44:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 2777 states and 3231 transitions. [2018-11-10 08:44:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3231 transitions. [2018-11-10 08:44:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-10 08:44:28,335 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 08:44:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 2781 states and 3234 transitions. [2018-11-10 08:44:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3234 transitions. [2018-11-10 08:44:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-10 08:44:28,598 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-10 08:44:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 2788 states and 3241 transitions. [2018-11-10 08:44:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3241 transitions. [2018-11-10 08:44:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-10 08:44:28,744 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-10 08:44:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 2795 states and 3251 transitions. [2018-11-10 08:44:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 3251 transitions. [2018-11-10 08:44:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 08:44:29,043 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-10 08:44:31,687 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-10 08:44:37,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 2848 states and 3346 transitions. [2018-11-10 08:44:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3346 transitions. [2018-11-10 08:44:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 08:44:37,948 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-10 08:44:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 2885 states and 3389 transitions. [2018-11-10 08:44:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 3389 transitions. [2018-11-10 08:44:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 08:44:40,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-10 08:44:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 2914 states and 3425 transitions. [2018-11-10 08:44:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3425 transitions. [2018-11-10 08:44:43,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 08:44:43,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-10 08:44:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 2924 states and 3433 transitions. [2018-11-10 08:44:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3433 transitions. [2018-11-10 08:44:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 08:44:44,329 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-10 08:44:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 2934 states and 3444 transitions. [2018-11-10 08:44:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 3444 transitions. [2018-11-10 08:44:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 08:44:45,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-10 08:44:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 2937 states and 3447 transitions. [2018-11-10 08:44:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 3447 transitions. [2018-11-10 08:44:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 08:44:46,406 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-10 08:44:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3448 states to 2938 states and 3448 transitions. [2018-11-10 08:44:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 3448 transitions. [2018-11-10 08:44:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-10 08:44:47,177 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 171 proven. 4 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-10 08:44:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3001 states and 3525 transitions. [2018-11-10 08:44:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 3525 transitions. [2018-11-10 08:44:49,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-10 08:44:49,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 171 proven. 4 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-10 08:44:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3009 states and 3536 transitions. [2018-11-10 08:44:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 3536 transitions. [2018-11-10 08:44:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-10 08:44:50,944 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 171 proven. 4 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-10 08:44:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3030 states and 3560 transitions. [2018-11-10 08:44:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3560 transitions. [2018-11-10 08:44:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-10 08:44:51,870 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 171 proven. 4 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-10 08:44:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3036 states and 3564 transitions. [2018-11-10 08:44:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 3564 transitions. [2018-11-10 08:44:52,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-10 08:44:52,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 08:44:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3058 states and 3586 transitions. [2018-11-10 08:44:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 3586 transitions. [2018-11-10 08:44:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-10 08:44:53,684 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 08:44:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3077 states and 3607 transitions. [2018-11-10 08:44:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 3607 transitions. [2018-11-10 08:44:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-10 08:44:54,565 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-10 08:44:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3094 states and 3624 transitions. [2018-11-10 08:44:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 3624 transitions. [2018-11-10 08:44:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-10 08:44:55,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 4 proven. 263 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 08:44:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:44:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3107 states and 3641 transitions. [2018-11-10 08:44:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 3641 transitions. [2018-11-10 08:44:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-10 08:44:57,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:44:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:44:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 313 proven. 5 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 08:45:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3186 states and 3733 transitions. [2018-11-10 08:45:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 3733 transitions. [2018-11-10 08:45:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-10 08:45:02,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 313 proven. 5 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 08:45:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3750 states to 3204 states and 3750 transitions. [2018-11-10 08:45:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 3750 transitions. [2018-11-10 08:45:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-10 08:45:02,875 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 313 proven. 5 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 08:45:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3206 states and 3752 transitions. [2018-11-10 08:45:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 3752 transitions. [2018-11-10 08:45:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-10 08:45:03,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 08:45:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3255 states and 3804 transitions. [2018-11-10 08:45:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 3804 transitions. [2018-11-10 08:45:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-10 08:45:10,264 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 08:45:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3266 states and 3814 transitions. [2018-11-10 08:45:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 3814 transitions. [2018-11-10 08:45:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-10 08:45:12,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 182 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-11-10 08:45:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3275 states and 3825 transitions. [2018-11-10 08:45:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 3825 transitions. [2018-11-10 08:45:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-10 08:45:13,332 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 182 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-11-10 08:45:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:13,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3284 states and 3833 transitions. [2018-11-10 08:45:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 3833 transitions. [2018-11-10 08:45:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-10 08:45:13,935 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 182 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-11-10 08:45:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3300 states and 3848 transitions. [2018-11-10 08:45:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 3848 transitions. [2018-11-10 08:45:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-10 08:45:14,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 182 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-11-10 08:45:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3874 states to 3325 states and 3874 transitions. [2018-11-10 08:45:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 3874 transitions. [2018-11-10 08:45:17,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-10 08:45:17,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 182 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-11-10 08:45:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3334 states and 3883 transitions. [2018-11-10 08:45:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 3883 transitions. [2018-11-10 08:45:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-10 08:45:17,955 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 182 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-11-10 08:45:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3341 states and 3889 transitions. [2018-11-10 08:45:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 3889 transitions. [2018-11-10 08:45:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-10 08:45:18,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-11-10 08:45:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3360 states and 3908 transitions. [2018-11-10 08:45:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3360 states and 3908 transitions. [2018-11-10 08:45:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-10 08:45:19,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-11-10 08:45:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3373 states and 3919 transitions. [2018-11-10 08:45:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 3919 transitions. [2018-11-10 08:45:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-10 08:45:20,009 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-10 08:45:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:45:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3400 states and 3943 transitions. [2018-11-10 08:45:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 3943 transitions. [2018-11-10 08:45:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-10 08:45:21,563 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:45:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:45:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:45:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:45:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:45:21,785 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 191 iterations. [2018-11-10 08:45:21,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 08:45:21 ImpRootNode [2018-11-10 08:45:21,938 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 08:45:21,938 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:45:21,938 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:45:21,938 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:45:21,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:42:46" (3/4) ... [2018-11-10 08:45:21,941 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 08:45:22,074 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_52ff625d-5afe-4dad-992a-8c88bd20e711/bin-2019/ukojak/witness.graphml [2018-11-10 08:45:22,074 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:45:22,075 INFO L168 Benchmark]: Toolchain (without parser) took 157401.51 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 957.6 MB in the beginning and 1.9 GB in the end (delta: -924.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-11-10 08:45:22,075 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:45:22,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.43 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 925.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-10 08:45:22,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 925.4 MB in the beginning and 1.1 GB in the end (delta: -212.6 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-11-10 08:45:22,076 INFO L168 Benchmark]: Boogie Preprocessor took 42.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:45:22,076 INFO L168 Benchmark]: RCFGBuilder took 1272.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.3 MB in the end (delta: 240.3 MB). Peak memory consumption was 240.3 MB. Max. memory is 11.5 GB. [2018-11-10 08:45:22,076 INFO L168 Benchmark]: CodeCheck took 155500.94 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 892.3 MB in the beginning and 1.9 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-11-10 08:45:22,076 INFO L168 Benchmark]: Witness Printer took 135.72 ms. Allocated memory is still 4.1 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2018-11-10 08:45:22,078 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, 155.3s OverallTime, 191 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -2134423552 SDtfs, -169187890 SDslu, 104482816 SDs, 0 SdLazy, 1335877342 SolverSat, -540435416 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 754.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217389 GetRequests, 213885 SyntacticMatches, 1736 SemanticMatches, 1768 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144389 ImplicationChecksByTransitivity, 132.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.7s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 32823 NumberOfCodeBlocks, 32823 NumberOfCodeBlocksAsserted, 191 NumberOfCheckSat, 32364 ConstructedInterpolants, 0 QuantifiedInterpolants, 17653888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 190 InterpolantComputations, 154 PerfectInterpolantSequences, 31883/32287 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.43 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 925.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 925.4 MB in the beginning and 1.1 GB in the end (delta: -212.6 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1272.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.3 MB in the end (delta: 240.3 MB). Peak memory consumption was 240.3 MB. Max. memory is 11.5 GB. * CodeCheck took 155500.94 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 892.3 MB in the beginning and 1.9 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 135.72 ms. Allocated memory is still 4.1 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...