./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label50_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label50_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/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 bef46999e9dea747e943c0e8bab6fd45498a6f2f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-5842f4b [2018-11-18 10:45:45,108 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:45:45,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:45:45,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:45:45,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:45:45,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:45:45,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:45:45,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:45:45,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:45:45,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:45:45,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:45:45,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:45:45,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:45:45,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:45:45,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:45:45,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:45:45,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:45:45,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:45:45,127 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:45:45,128 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:45:45,129 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:45:45,130 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:45:45,131 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:45:45,131 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:45:45,131 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:45:45,132 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:45:45,133 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:45:45,133 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:45:45,134 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:45:45,134 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:45:45,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:45:45,135 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:45:45,135 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:45:45,135 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:45:45,136 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:45:45,137 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:45:45,137 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 10:45:45,147 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:45:45,147 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:45:45,148 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:45:45,148 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 10:45:45,148 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:45:45,148 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:45:45,149 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:45:45,149 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:45:45,149 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:45:45,149 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:45:45,149 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:45:45,149 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:45:45,149 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:45:45,150 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:45:45,150 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:45:45,150 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:45:45,150 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:45:45,150 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:45:45,150 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 10:45:45,150 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 10:45:45,150 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:45:45,151 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:45:45,151 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 10:45:45,151 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:45:45,151 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:45:45,151 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:45:45,151 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 10:45:45,151 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:45:45,151 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:45:45,152 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_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/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 -> bef46999e9dea747e943c0e8bab6fd45498a6f2f [2018-11-18 10:45:45,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:45:45,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:45:45,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:45:45,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:45:45,183 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:45:45,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label50_false-unreach-call_false-termination.c [2018-11-18 10:45:45,218 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/bin-2019/ukojak/data/9fe554377/38f677674c7741be98ecc096cf24dd6c/FLAGfdc49b49e [2018-11-18 10:45:45,572 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:45:45,572 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/sv-benchmarks/c/eca-rers2012/Problem01_label50_false-unreach-call_false-termination.c [2018-11-18 10:45:45,584 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/bin-2019/ukojak/data/9fe554377/38f677674c7741be98ecc096cf24dd6c/FLAGfdc49b49e [2018-11-18 10:45:45,594 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/bin-2019/ukojak/data/9fe554377/38f677674c7741be98ecc096cf24dd6c [2018-11-18 10:45:45,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:45:45,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:45:45,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:45:45,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:45:45,601 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:45:45,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:45:45" (1/1) ... [2018-11-18 10:45:45,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411459c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:45:45, skipping insertion in model container [2018-11-18 10:45:45,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:45:45" (1/1) ... [2018-11-18 10:45:45,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:45:45,642 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:45:45,893 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:45:45,896 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:45:45,962 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:45:45,974 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:45:45,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:45:45 WrapperNode [2018-11-18 10:45:45,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:45:45,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:45:45,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:45:45,975 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:45:46,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:45:45" (1/1) ... [2018-11-18 10:45:46,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:45:45" (1/1) ... [2018-11-18 10:45:46,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:45:46,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:45:46,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:45:46,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:45:46,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:45:45" (1/1) ... [2018-11-18 10:45:46,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:45:45" (1/1) ... [2018-11-18 10:45:46,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:45:45" (1/1) ... [2018-11-18 10:45:46,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:45:45" (1/1) ... [2018-11-18 10:45:46,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:45:45" (1/1) ... [2018-11-18 10:45:46,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:45:45" (1/1) ... [2018-11-18 10:45:46,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:45:45" (1/1) ... [2018-11-18 10:45:46,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:45:46,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:45:46,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:45:46,123 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:45:46,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:45:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/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-18 10:45:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 10:45:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:45:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:45:47,341 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:45:47,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:45:47 BoogieIcfgContainer [2018-11-18 10:45:47,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:45:47,342 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 10:45:47,342 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 10:45:47,349 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 10:45:47,349 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:45:47" (1/1) ... [2018-11-18 10:45:47,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:45:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-18 10:45:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-18 10:45:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 10:45:47,385 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:47,607 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-18 10:45:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 147 states and 222 transitions. [2018-11-18 10:45:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2018-11-18 10:45:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 10:45:48,067 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:48,168 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-18 10:45:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 218 states and 316 transitions. [2018-11-18 10:45:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 316 transitions. [2018-11-18 10:45:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 10:45:48,646 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:45:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 224 states and 327 transitions. [2018-11-18 10:45:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 327 transitions. [2018-11-18 10:45:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 10:45:48,790 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:48,861 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-18 10:45:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 294 states and 400 transitions. [2018-11-18 10:45:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 400 transitions. [2018-11-18 10:45:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 10:45:49,248 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:45:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 297 states and 404 transitions. [2018-11-18 10:45:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 404 transitions. [2018-11-18 10:45:49,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 10:45:49,306 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:45:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 309 states and 421 transitions. [2018-11-18 10:45:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 421 transitions. [2018-11-18 10:45:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-18 10:45:49,558 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:45:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 322 states and 439 transitions. [2018-11-18 10:45:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2018-11-18 10:45:49,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 10:45:49,859 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:45:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 323 states and 441 transitions. [2018-11-18 10:45:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 441 transitions. [2018-11-18 10:45:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 10:45:50,059 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:50,175 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-18 10:45:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 338 states and 461 transitions. [2018-11-18 10:45:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 461 transitions. [2018-11-18 10:45:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 10:45:50,543 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:45:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 339 states and 463 transitions. [2018-11-18 10:45:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 463 transitions. [2018-11-18 10:45:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 10:45:50,652 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:45:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 340 states and 465 transitions. [2018-11-18 10:45:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 465 transitions. [2018-11-18 10:45:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 10:45:50,766 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:50,842 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-18 10:45:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 351 states and 478 transitions. [2018-11-18 10:45:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 478 transitions. [2018-11-18 10:45:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 10:45:51,409 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:51,435 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-18 10:45:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 365 states and 495 transitions. [2018-11-18 10:45:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 495 transitions. [2018-11-18 10:45:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-18 10:45:51,741 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:51,761 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-18 10:45:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 383 states and 517 transitions. [2018-11-18 10:45:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 517 transitions. [2018-11-18 10:45:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 10:45:52,177 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:45:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 391 states and 527 transitions. [2018-11-18 10:45:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 527 transitions. [2018-11-18 10:45:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 10:45:52,316 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:52,336 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-18 10:45:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 392 states and 528 transitions. [2018-11-18 10:45:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 528 transitions. [2018-11-18 10:45:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-18 10:45:52,363 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:52,384 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-18 10:45:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 399 states and 535 transitions. [2018-11-18 10:45:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 535 transitions. [2018-11-18 10:45:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 10:45:52,488 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:52,578 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-18 10:45:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 414 states and 554 transitions. [2018-11-18 10:45:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 554 transitions. [2018-11-18 10:45:52,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 10:45:52,893 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:45:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 415 states and 556 transitions. [2018-11-18 10:45:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 556 transitions. [2018-11-18 10:45:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 10:45:52,949 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:45:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 423 states and 565 transitions. [2018-11-18 10:45:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 565 transitions. [2018-11-18 10:45:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 10:45:53,228 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 10:45:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 437 states and 584 transitions. [2018-11-18 10:45:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 584 transitions. [2018-11-18 10:45:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 10:45:53,547 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:45:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 438 states and 586 transitions. [2018-11-18 10:45:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 586 transitions. [2018-11-18 10:45:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 10:45:53,592 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:45:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 453 states and 603 transitions. [2018-11-18 10:45:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 603 transitions. [2018-11-18 10:45:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 10:45:54,022 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:45:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 455 states and 604 transitions. [2018-11-18 10:45:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 604 transitions. [2018-11-18 10:45:54,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 10:45:54,152 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:45:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 456 states and 606 transitions. [2018-11-18 10:45:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 606 transitions. [2018-11-18 10:45:54,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 10:45:54,193 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 10:45:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 457 states and 608 transitions. [2018-11-18 10:45:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 608 transitions. [2018-11-18 10:45:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 10:45:54,324 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:45:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 474 states and 627 transitions. [2018-11-18 10:45:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 627 transitions. [2018-11-18 10:45:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 10:45:54,830 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:45:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 485 states and 638 transitions. [2018-11-18 10:45:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 638 transitions. [2018-11-18 10:45:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 10:45:55,260 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 10:45:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 487 states and 640 transitions. [2018-11-18 10:45:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 640 transitions. [2018-11-18 10:45:55,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 10:45:55,286 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:45:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 488 states and 641 transitions. [2018-11-18 10:45:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 641 transitions. [2018-11-18 10:45:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 10:45:55,412 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 10:45:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 493 states and 646 transitions. [2018-11-18 10:45:55,447 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 646 transitions. [2018-11-18 10:45:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 10:45:55,448 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:45:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 507 states and 660 transitions. [2018-11-18 10:45:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 660 transitions. [2018-11-18 10:45:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 10:45:55,909 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:45:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 535 states and 697 transitions. [2018-11-18 10:45:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 697 transitions. [2018-11-18 10:45:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 10:45:56,469 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:45:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 536 states and 698 transitions. [2018-11-18 10:45:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 698 transitions. [2018-11-18 10:45:56,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 10:45:56,497 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:56,515 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-18 10:45:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 546 states and 708 transitions. [2018-11-18 10:45:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 708 transitions. [2018-11-18 10:45:56,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 10:45:56,548 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 10:45:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 554 states and 716 transitions. [2018-11-18 10:45:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 716 transitions. [2018-11-18 10:45:56,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 10:45:56,661 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:45:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 585 states and 754 transitions. [2018-11-18 10:45:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 754 transitions. [2018-11-18 10:45:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-18 10:45:57,848 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 10:45:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 586 states and 755 transitions. [2018-11-18 10:45:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 755 transitions. [2018-11-18 10:45:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 10:45:57,909 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:58,033 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-18 10:45:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 602 states and 780 transitions. [2018-11-18 10:45:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 780 transitions. [2018-11-18 10:45:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 10:45:58,576 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:58,606 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-18 10:45:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 614 states and 794 transitions. [2018-11-18 10:45:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 794 transitions. [2018-11-18 10:45:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 10:45:58,928 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:45:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 628 states and 820 transitions. [2018-11-18 10:45:59,703 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 820 transitions. [2018-11-18 10:45:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 10:45:59,704 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:45:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 633 states and 826 transitions. [2018-11-18 10:45:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 826 transitions. [2018-11-18 10:45:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-18 10:45:59,908 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:45:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:45:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 646 states and 839 transitions. [2018-11-18 10:45:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 839 transitions. [2018-11-18 10:45:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-18 10:45:59,967 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:45:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:45:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:46:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 655 states and 848 transitions. [2018-11-18 10:46:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 848 transitions. [2018-11-18 10:46:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 10:46:00,019 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 10:46:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 656 states and 849 transitions. [2018-11-18 10:46:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 849 transitions. [2018-11-18 10:46:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 10:46:00,057 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 10:46:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 669 states and 862 transitions. [2018-11-18 10:46:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 862 transitions. [2018-11-18 10:46:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 10:46:00,128 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:46:01,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 718 states and 918 transitions. [2018-11-18 10:46:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 918 transitions. [2018-11-18 10:46:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 10:46:01,803 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 10:46:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 728 states and 939 transitions. [2018-11-18 10:46:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 939 transitions. [2018-11-18 10:46:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-18 10:46:03,114 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 10:46:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 784 states and 1005 transitions. [2018-11-18 10:46:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1005 transitions. [2018-11-18 10:46:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-18 10:46:05,612 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 10:46:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 823 states and 1050 transitions. [2018-11-18 10:46:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1050 transitions. [2018-11-18 10:46:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 10:46:07,455 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:46:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 865 states and 1099 transitions. [2018-11-18 10:46:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1099 transitions. [2018-11-18 10:46:08,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 10:46:08,867 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:46:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 885 states and 1120 transitions. [2018-11-18 10:46:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1120 transitions. [2018-11-18 10:46:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 10:46:09,901 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:46:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 896 states and 1132 transitions. [2018-11-18 10:46:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1132 transitions. [2018-11-18 10:46:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 10:46:10,397 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:46:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 913 states and 1154 transitions. [2018-11-18 10:46:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1154 transitions. [2018-11-18 10:46:11,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 10:46:11,971 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:46:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 922 states and 1163 transitions. [2018-11-18 10:46:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1163 transitions. [2018-11-18 10:46:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 10:46:12,195 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:46:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 927 states and 1171 transitions. [2018-11-18 10:46:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1171 transitions. [2018-11-18 10:46:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 10:46:12,252 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 10:46:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 940 states and 1185 transitions. [2018-11-18 10:46:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1185 transitions. [2018-11-18 10:46:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 10:46:12,597 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-18 10:46:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 944 states and 1195 transitions. [2018-11-18 10:46:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1195 transitions. [2018-11-18 10:46:12,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-18 10:46:12,809 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:46:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:12,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 953 states and 1207 transitions. [2018-11-18 10:46:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1207 transitions. [2018-11-18 10:46:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 10:46:12,878 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 10:46:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 957 states and 1211 transitions. [2018-11-18 10:46:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1211 transitions. [2018-11-18 10:46:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 10:46:12,935 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 10:46:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1026 states and 1290 transitions. [2018-11-18 10:46:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1290 transitions. [2018-11-18 10:46:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 10:46:13,486 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:46:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1043 states and 1312 transitions. [2018-11-18 10:46:13,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1312 transitions. [2018-11-18 10:46:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 10:46:13,956 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 10:46:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1052 states and 1330 transitions. [2018-11-18 10:46:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1330 transitions. [2018-11-18 10:46:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 10:46:15,028 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 10:46:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1076 states and 1363 transitions. [2018-11-18 10:46:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1363 transitions. [2018-11-18 10:46:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 10:46:17,176 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 10:46:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1085 states and 1371 transitions. [2018-11-18 10:46:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1371 transitions. [2018-11-18 10:46:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 10:46:17,783 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 10:46:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1094 states and 1381 transitions. [2018-11-18 10:46:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1381 transitions. [2018-11-18 10:46:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 10:46:18,229 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 10:46:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1101 states and 1387 transitions. [2018-11-18 10:46:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1387 transitions. [2018-11-18 10:46:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 10:46:18,583 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 10:46:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1113 states and 1399 transitions. [2018-11-18 10:46:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1399 transitions. [2018-11-18 10:46:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 10:46:18,676 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 10:46:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1144 states and 1439 transitions. [2018-11-18 10:46:19,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1439 transitions. [2018-11-18 10:46:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 10:46:19,426 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 10:46:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1145 states and 1439 transitions. [2018-11-18 10:46:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1439 transitions. [2018-11-18 10:46:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 10:46:19,650 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 10:46:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1168 states and 1464 transitions. [2018-11-18 10:46:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1464 transitions. [2018-11-18 10:46:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 10:46:20,371 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 10:46:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1185 states and 1487 transitions. [2018-11-18 10:46:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1487 transitions. [2018-11-18 10:46:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 10:46:21,604 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 10:46:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1203 states and 1505 transitions. [2018-11-18 10:46:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1505 transitions. [2018-11-18 10:46:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-18 10:46:22,305 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 10:46:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1261 states and 1567 transitions. [2018-11-18 10:46:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1567 transitions. [2018-11-18 10:46:22,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 10:46:22,748 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 10:46:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1328 states and 1642 transitions. [2018-11-18 10:46:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1642 transitions. [2018-11-18 10:46:23,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 10:46:23,859 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 10:46:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1333 states and 1654 transitions. [2018-11-18 10:46:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1654 transitions. [2018-11-18 10:46:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-18 10:46:24,790 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 10:46:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1334 states and 1658 transitions. [2018-11-18 10:46:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1658 transitions. [2018-11-18 10:46:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 10:46:25,014 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:46:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1363 states and 1699 transitions. [2018-11-18 10:46:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1699 transitions. [2018-11-18 10:46:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 10:46:28,729 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:46:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1366 states and 1701 transitions. [2018-11-18 10:46:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1701 transitions. [2018-11-18 10:46:29,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 10:46:29,345 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:46:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1373 states and 1707 transitions. [2018-11-18 10:46:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1707 transitions. [2018-11-18 10:46:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 10:46:29,872 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 10:46:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1386 states and 1723 transitions. [2018-11-18 10:46:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1723 transitions. [2018-11-18 10:46:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 10:46:30,203 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 10:46:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1397 states and 1733 transitions. [2018-11-18 10:46:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1733 transitions. [2018-11-18 10:46:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 10:46:30,714 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 10:46:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1398 states and 1735 transitions. [2018-11-18 10:46:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1735 transitions. [2018-11-18 10:46:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 10:46:30,957 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 10:46:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1399 states and 1737 transitions. [2018-11-18 10:46:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1737 transitions. [2018-11-18 10:46:31,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 10:46:31,223 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:46:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1424 states and 1782 transitions. [2018-11-18 10:46:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1782 transitions. [2018-11-18 10:46:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 10:46:34,350 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:46:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1438 states and 1799 transitions. [2018-11-18 10:46:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1799 transitions. [2018-11-18 10:46:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 10:46:35,111 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:46:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1440 states and 1805 transitions. [2018-11-18 10:46:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1805 transitions. [2018-11-18 10:46:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 10:46:35,793 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:46:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1451 states and 1816 transitions. [2018-11-18 10:46:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1816 transitions. [2018-11-18 10:46:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 10:46:36,257 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:46:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1452 states and 1818 transitions. [2018-11-18 10:46:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1818 transitions. [2018-11-18 10:46:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 10:46:36,821 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:36,859 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 10:46:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1478 states and 1846 transitions. [2018-11-18 10:46:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1846 transitions. [2018-11-18 10:46:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-18 10:46:37,978 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 10:46:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1560 states and 1945 transitions. [2018-11-18 10:46:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1945 transitions. [2018-11-18 10:46:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 10:46:39,884 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:46:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1571 states and 1964 transitions. [2018-11-18 10:46:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 1964 transitions. [2018-11-18 10:46:43,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 10:46:43,298 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:46:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1583 states and 1977 transitions. [2018-11-18 10:46:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1977 transitions. [2018-11-18 10:46:44,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 10:46:44,812 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:46:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 1644 states and 2046 transitions. [2018-11-18 10:46:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2046 transitions. [2018-11-18 10:46:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 10:46:47,472 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 191 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 10:46:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 1649 states and 2052 transitions. [2018-11-18 10:46:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2052 transitions. [2018-11-18 10:46:48,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 10:46:48,502 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:48,528 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-18 10:46:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 1661 states and 2067 transitions. [2018-11-18 10:46:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2067 transitions. [2018-11-18 10:46:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 10:46:49,483 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-18 10:46:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 1663 states and 2068 transitions. [2018-11-18 10:46:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2068 transitions. [2018-11-18 10:46:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 10:46:49,886 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 10:46:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1667 states and 2076 transitions. [2018-11-18 10:46:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2076 transitions. [2018-11-18 10:46:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 10:46:50,977 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 10:46:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 1669 states and 2077 transitions. [2018-11-18 10:46:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2077 transitions. [2018-11-18 10:46:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 10:46:51,393 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 10:46:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 1674 states and 2081 transitions. [2018-11-18 10:46:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2081 transitions. [2018-11-18 10:46:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 10:46:51,808 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 10:46:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 1678 states and 2084 transitions. [2018-11-18 10:46:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2084 transitions. [2018-11-18 10:46:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-18 10:46:52,879 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 10:46:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 1679 states and 2086 transitions. [2018-11-18 10:46:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2086 transitions. [2018-11-18 10:46:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-18 10:46:53,239 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 10:46:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 1684 states and 2093 transitions. [2018-11-18 10:46:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2093 transitions. [2018-11-18 10:46:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 10:46:53,548 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 10:46:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 1707 states and 2126 transitions. [2018-11-18 10:46:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2126 transitions. [2018-11-18 10:46:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 10:46:56,277 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 10:46:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 1709 states and 2127 transitions. [2018-11-18 10:46:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2127 transitions. [2018-11-18 10:46:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 10:46:56,976 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 10:46:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:46:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 1710 states and 2127 transitions. [2018-11-18 10:46:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2127 transitions. [2018-11-18 10:46:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-18 10:46:57,355 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:46:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:47:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:47:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 1731 states and 2150 transitions. [2018-11-18 10:47:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2150 transitions. [2018-11-18 10:47:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-18 10:47:00,687 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:47:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:47:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 10:47:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:47:01,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 1737 states and 2158 transitions. [2018-11-18 10:47:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2158 transitions. [2018-11-18 10:47:01,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-18 10:47:01,943 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:47:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:47:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 198 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:47:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:47:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 1755 states and 2179 transitions. [2018-11-18 10:47:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2179 transitions. [2018-11-18 10:47:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-18 10:47:03,941 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:47:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:47:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 198 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:47:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:47:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 1782 states and 2209 transitions. [2018-11-18 10:47:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2209 transitions. [2018-11-18 10:47:05,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 10:47:05,406 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:47:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:47:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 280 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:47:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:47:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 1803 states and 2236 transitions. [2018-11-18 10:47:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2236 transitions. [2018-11-18 10:47:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 10:47:08,320 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:47:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:47:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 10:47:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:47:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 1849 states and 2286 transitions. [2018-11-18 10:47:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2286 transitions. [2018-11-18 10:47:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 10:47:13,131 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:47:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:47:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 10:47:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:47:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 1851 states and 2287 transitions. [2018-11-18 10:47:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2287 transitions. [2018-11-18 10:47:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-18 10:47:13,512 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:47:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:47:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 10:47:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:47:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 1856 states and 2293 transitions. [2018-11-18 10:47:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2293 transitions. [2018-11-18 10:47:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-18 10:47:13,765 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:47:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:47:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 10:47:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 10:47:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 1862 states and 2301 transitions. [2018-11-18 10:47:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2301 transitions. [2018-11-18 10:47:13,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 10:47:13,970 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 10:47:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:47:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:47:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:47:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:47:14,167 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 116 iterations. [2018-11-18 10:47:14,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 10:47:14 ImpRootNode [2018-11-18 10:47:14,289 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 10:47:14,289 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:47:14,289 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:47:14,289 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:47:14,290 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:45:47" (3/4) ... [2018-11-18 10:47:14,293 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 10:47:14,396 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_42bfabce-bb5a-49cc-a9bc-ddd1cbd72f85/bin-2019/ukojak/witness.graphml [2018-11-18 10:47:14,396 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:47:14,397 INFO L168 Benchmark]: Toolchain (without parser) took 88800.11 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 952.1 MB in the beginning and 907.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-11-18 10:47:14,398 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:47:14,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.25 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 919.9 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:47:14,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 919.9 MB in the beginning and 1.2 GB in the end (delta: -247.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:47:14,398 INFO L168 Benchmark]: Boogie Preprocessor took 42.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:47:14,398 INFO L168 Benchmark]: RCFGBuilder took 1218.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 918.8 MB in the end (delta: 241.4 MB). Peak memory consumption was 241.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:47:14,399 INFO L168 Benchmark]: CodeCheck took 86946.77 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 918.8 MB in the beginning and 946.4 MB in the end (delta: -27.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-18 10:47:14,399 INFO L168 Benchmark]: Witness Printer took 107.21 ms. Allocated memory is still 3.0 GB. Free memory was 946.4 MB in the beginning and 907.8 MB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-11-18 10:47:14,400 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, 86.8s OverallTime, 116 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 239092428 SDtfs, 726296122 SDslu, -1864487200 SDs, 0 SdLazy, 2144595764 SolverSat, -1369346778 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 297.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110438 GetRequests, 106123 SyntacticMatches, 3161 SemanticMatches, 1154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908464 ImplicationChecksByTransitivity, 74.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 16647 NumberOfCodeBlocks, 16647 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 16328 ConstructedInterpolants, 0 QuantifiedInterpolants, 11346064 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 115 InterpolantComputations, 87 PerfectInterpolantSequences, 11671/12096 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: 413]: 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 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=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] [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=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] [L84] COND TRUE ((((((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)) [L85] a7 = 0 [L86] a20 = 1 [L87] a8 = 14 [L88] a16 = 4 [L89] a21 = 1 [L90] a17 = 0 [L91] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, 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] [L412] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=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] [L413] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.25 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 919.9 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 104.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 919.9 MB in the beginning and 1.2 GB in the end (delta: -247.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1218.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 918.8 MB in the end (delta: 241.4 MB). Peak memory consumption was 241.4 MB. Max. memory is 11.5 GB. * CodeCheck took 86946.77 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 918.8 MB in the beginning and 946.4 MB in the end (delta: -27.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 107.21 ms. Allocated memory is still 3.0 GB. Free memory was 946.4 MB in the beginning and 907.8 MB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...