./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/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_87973470-3ec0-437c-854c-57e9eea5aa42/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/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-1dbac8b [2018-10-26 21:30:19,607 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:30:19,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:30:19,617 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:30:19,618 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:30:19,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:30:19,620 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:30:19,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:30:19,623 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:30:19,624 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:30:19,624 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:30:19,624 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:30:19,625 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:30:19,626 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:30:19,627 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:30:19,628 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:30:19,629 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:30:19,634 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:30:19,636 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:30:19,637 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:30:19,638 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:30:19,639 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:30:19,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:30:19,643 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:30:19,644 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:30:19,645 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:30:19,645 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:30:19,646 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:30:19,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:30:19,648 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:30:19,648 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:30:19,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:30:19,649 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:30:19,649 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:30:19,650 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:30:19,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:30:19,651 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 21:30:19,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:30:19,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:30:19,664 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:30:19,664 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:30:19,665 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:30:19,665 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:30:19,666 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:30:19,666 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:30:19,666 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:30:19,666 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:30:19,666 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:30:19,666 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:30:19,667 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:30:19,667 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:30:19,667 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:30:19,667 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:30:19,667 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:30:19,667 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 21:30:19,667 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 21:30:19,668 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:30:19,668 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:30:19,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 21:30:19,668 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:30:19,668 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:30:19,668 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:30:19,669 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 21:30:19,669 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:30:19,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:30:19,669 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_87973470-3ec0-437c-854c-57e9eea5aa42/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-10-26 21:30:19,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:30:19,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:30:19,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:30:19,713 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:30:19,713 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:30:19,714 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label50_false-unreach-call_false-termination.c [2018-10-26 21:30:19,767 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/bin-2019/ukojak/data/59a542e86/ff8856f3853a493089b4a1d1ce1f5913/FLAGa26ebd9ee [2018-10-26 21:30:20,209 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:30:20,210 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/sv-benchmarks/c/eca-rers2012/Problem01_label50_false-unreach-call_false-termination.c [2018-10-26 21:30:20,217 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/bin-2019/ukojak/data/59a542e86/ff8856f3853a493089b4a1d1ce1f5913/FLAGa26ebd9ee [2018-10-26 21:30:20,231 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/bin-2019/ukojak/data/59a542e86/ff8856f3853a493089b4a1d1ce1f5913 [2018-10-26 21:30:20,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:30:20,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:30:20,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:30:20,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:30:20,239 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:30:20,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:30:20" (1/1) ... [2018-10-26 21:30:20,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14956367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:30:20, skipping insertion in model container [2018-10-26 21:30:20,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:30:20" (1/1) ... [2018-10-26 21:30:20,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:30:20,291 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:30:20,621 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:30:20,626 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:30:20,695 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:30:20,713 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:30:20,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:30:20 WrapperNode [2018-10-26 21:30:20,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:30:20,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:30:20,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:30:20,715 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:30:20,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:30:20" (1/1) ... [2018-10-26 21:30:20,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:30:20" (1/1) ... [2018-10-26 21:30:20,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:30:20,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:30:20,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:30:20,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:30:20,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:30:20" (1/1) ... [2018-10-26 21:30:20,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:30:20" (1/1) ... [2018-10-26 21:30:20,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:30:20" (1/1) ... [2018-10-26 21:30:20,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:30:20" (1/1) ... [2018-10-26 21:30:20,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:30:20" (1/1) ... [2018-10-26 21:30:20,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:30:20" (1/1) ... [2018-10-26 21:30:20,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:30:20" (1/1) ... [2018-10-26 21:30:20,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:30:20,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:30:20,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:30:20,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:30:20,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:30:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 21:30:21,010 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:30:21,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:30:21,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:30:25,309 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:30:25,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:30:25 BoogieIcfgContainer [2018-10-26 21:30:25,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:30:25,310 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 21:30:25,310 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 21:30:25,318 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 21:30:25,318 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:30:25" (1/1) ... [2018-10-26 21:30:25,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:30:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-10-26 21:30:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-10-26 21:30:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 21:30:25,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 147 states and 222 transitions. [2018-10-26 21:30:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2018-10-26 21:30:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 21:30:26,434 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 218 states and 316 transitions. [2018-10-26 21:30:27,392 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 316 transitions. [2018-10-26 21:30:27,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:30:27,394 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 224 states and 327 transitions. [2018-10-26 21:30:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 327 transitions. [2018-10-26 21:30:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 21:30:27,757 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 294 states and 400 transitions. [2018-10-26 21:30:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 400 transitions. [2018-10-26 21:30:28,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-26 21:30:28,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 297 states and 404 transitions. [2018-10-26 21:30:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 404 transitions. [2018-10-26 21:30:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-26 21:30:29,189 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 309 states and 421 transitions. [2018-10-26 21:30:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 421 transitions. [2018-10-26 21:30:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 21:30:29,542 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 322 states and 439 transitions. [2018-10-26 21:30:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2018-10-26 21:30:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 21:30:30,300 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 323 states and 441 transitions. [2018-10-26 21:30:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 441 transitions. [2018-10-26 21:30:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-26 21:30:30,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 338 states and 461 transitions. [2018-10-26 21:30:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 461 transitions. [2018-10-26 21:30:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-26 21:30:31,210 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:30:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 339 states and 463 transitions. [2018-10-26 21:30:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 463 transitions. [2018-10-26 21:30:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-26 21:30:32,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:30:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 340 states and 465 transitions. [2018-10-26 21:30:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 465 transitions. [2018-10-26 21:30:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 21:30:32,666 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:34,353 WARN L179 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-26 21:30:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 351 states and 478 transitions. [2018-10-26 21:30:34,452 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 478 transitions. [2018-10-26 21:30:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 21:30:34,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 21:30:34,720 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 21:30:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 365 states and 495 transitions. [2018-10-26 21:30:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 495 transitions. [2018-10-26 21:30:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-26 21:30:35,199 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 383 states and 517 transitions. [2018-10-26 21:30:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 517 transitions. [2018-10-26 21:30:35,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-26 21:30:35,709 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 391 states and 527 transitions. [2018-10-26 21:30:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 527 transitions. [2018-10-26 21:30:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-26 21:30:36,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:36,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 392 states and 528 transitions. [2018-10-26 21:30:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 528 transitions. [2018-10-26 21:30:36,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 21:30:36,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:30:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 399 states and 535 transitions. [2018-10-26 21:30:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 535 transitions. [2018-10-26 21:30:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-26 21:30:36,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 414 states and 554 transitions. [2018-10-26 21:30:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 554 transitions. [2018-10-26 21:30:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-26 21:30:36,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 415 states and 556 transitions. [2018-10-26 21:30:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 556 transitions. [2018-10-26 21:30:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-26 21:30:36,775 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 423 states and 565 transitions. [2018-10-26 21:30:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 565 transitions. [2018-10-26 21:30:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 21:30:37,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 21:30:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:37,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 437 states and 584 transitions. [2018-10-26 21:30:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 584 transitions. [2018-10-26 21:30:37,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 21:30:37,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 438 states and 586 transitions. [2018-10-26 21:30:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 586 transitions. [2018-10-26 21:30:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 21:30:37,666 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:30:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 453 states and 603 transitions. [2018-10-26 21:30:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 603 transitions. [2018-10-26 21:30:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 21:30:38,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:38,105 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:30:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 455 states and 604 transitions. [2018-10-26 21:30:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 604 transitions. [2018-10-26 21:30:38,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 21:30:38,459 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:30:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 456 states and 606 transitions. [2018-10-26 21:30:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 606 transitions. [2018-10-26 21:30:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 21:30:38,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 21:30:39,339 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 21:30:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 457 states and 608 transitions. [2018-10-26 21:30:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 608 transitions. [2018-10-26 21:30:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 21:30:41,780 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 474 states and 627 transitions. [2018-10-26 21:30:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 627 transitions. [2018-10-26 21:30:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 21:30:42,342 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 485 states and 638 transitions. [2018-10-26 21:30:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 638 transitions. [2018-10-26 21:30:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 21:30:42,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 21:30:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 487 states and 640 transitions. [2018-10-26 21:30:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 640 transitions. [2018-10-26 21:30:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 21:30:42,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-26 21:30:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 488 states and 641 transitions. [2018-10-26 21:30:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 641 transitions. [2018-10-26 21:30:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 21:30:43,168 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 21:30:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 493 states and 646 transitions. [2018-10-26 21:30:43,494 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 646 transitions. [2018-10-26 21:30:43,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 21:30:43,495 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 507 states and 660 transitions. [2018-10-26 21:30:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 660 transitions. [2018-10-26 21:30:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 21:30:44,313 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:30:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 535 states and 697 transitions. [2018-10-26 21:30:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 697 transitions. [2018-10-26 21:30:44,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 21:30:44,921 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:30:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 536 states and 698 transitions. [2018-10-26 21:30:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 698 transitions. [2018-10-26 21:30:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 21:30:44,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 21:30:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 546 states and 708 transitions. [2018-10-26 21:30:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 708 transitions. [2018-10-26 21:30:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 21:30:45,331 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 21:30:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 554 states and 716 transitions. [2018-10-26 21:30:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 716 transitions. [2018-10-26 21:30:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 21:30:45,564 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:30:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 585 states and 754 transitions. [2018-10-26 21:30:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 754 transitions. [2018-10-26 21:30:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 21:30:47,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 21:30:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:47,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 586 states and 755 transitions. [2018-10-26 21:30:47,180 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 755 transitions. [2018-10-26 21:30:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 21:30:47,181 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 593 states and 768 transitions. [2018-10-26 21:30:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 768 transitions. [2018-10-26 21:30:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 21:30:47,664 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 605 states and 783 transitions. [2018-10-26 21:30:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 783 transitions. [2018-10-26 21:30:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 21:30:48,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 609 states and 789 transitions. [2018-10-26 21:30:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 789 transitions. [2018-10-26 21:30:48,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 21:30:48,539 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 614 states and 794 transitions. [2018-10-26 21:30:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 794 transitions. [2018-10-26 21:30:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 21:30:48,772 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:30:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 625 states and 817 transitions. [2018-10-26 21:30:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 817 transitions. [2018-10-26 21:30:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 21:30:49,696 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:30:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 628 states and 820 transitions. [2018-10-26 21:30:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 820 transitions. [2018-10-26 21:30:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 21:30:49,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:30:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 633 states and 826 transitions. [2018-10-26 21:30:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 826 transitions. [2018-10-26 21:30:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-26 21:30:50,082 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:30:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 646 states and 839 transitions. [2018-10-26 21:30:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 839 transitions. [2018-10-26 21:30:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-26 21:30:50,147 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:30:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 655 states and 848 transitions. [2018-10-26 21:30:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 848 transitions. [2018-10-26 21:30:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-26 21:30:50,265 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 21:30:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 656 states and 849 transitions. [2018-10-26 21:30:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 849 transitions. [2018-10-26 21:30:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-26 21:30:50,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 21:30:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 669 states and 862 transitions. [2018-10-26 21:30:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 862 transitions. [2018-10-26 21:30:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-26 21:30:50,420 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:30:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 718 states and 918 transitions. [2018-10-26 21:30:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 918 transitions. [2018-10-26 21:30:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-26 21:30:52,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 21:30:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 728 states and 939 transitions. [2018-10-26 21:30:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 939 transitions. [2018-10-26 21:30:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-26 21:30:54,455 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 21:30:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:30:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 784 states and 1011 transitions. [2018-10-26 21:30:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1011 transitions. [2018-10-26 21:30:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-26 21:30:58,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:30:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 21:31:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 813 states and 1041 transitions. [2018-10-26 21:31:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1041 transitions. [2018-10-26 21:31:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 21:31:00,146 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:31:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 858 states and 1096 transitions. [2018-10-26 21:31:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1096 transitions. [2018-10-26 21:31:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 21:31:02,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:31:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 886 states and 1123 transitions. [2018-10-26 21:31:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1123 transitions. [2018-10-26 21:31:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 21:31:03,709 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:31:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 896 states and 1138 transitions. [2018-10-26 21:31:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1138 transitions. [2018-10-26 21:31:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 21:31:05,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:31:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 912 states and 1154 transitions. [2018-10-26 21:31:06,659 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1154 transitions. [2018-10-26 21:31:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 21:31:06,660 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:31:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 917 states and 1162 transitions. [2018-10-26 21:31:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1162 transitions. [2018-10-26 21:31:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 21:31:06,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 21:31:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 930 states and 1176 transitions. [2018-10-26 21:31:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1176 transitions. [2018-10-26 21:31:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 21:31:07,057 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-26 21:31:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 934 states and 1186 transitions. [2018-10-26 21:31:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1186 transitions. [2018-10-26 21:31:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-26 21:31:07,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:31:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 943 states and 1198 transitions. [2018-10-26 21:31:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1198 transitions. [2018-10-26 21:31:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 21:31:07,593 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 21:31:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 947 states and 1202 transitions. [2018-10-26 21:31:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1202 transitions. [2018-10-26 21:31:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 21:31:07,661 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 21:31:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1016 states and 1281 transitions. [2018-10-26 21:31:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1281 transitions. [2018-10-26 21:31:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 21:31:08,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-26 21:31:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1033 states and 1303 transitions. [2018-10-26 21:31:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1303 transitions. [2018-10-26 21:31:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-26 21:31:08,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-26 21:31:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1042 states and 1321 transitions. [2018-10-26 21:31:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1321 transitions. [2018-10-26 21:31:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-26 21:31:10,184 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 21:31:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1051 states and 1333 transitions. [2018-10-26 21:31:11,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1333 transitions. [2018-10-26 21:31:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-26 21:31:11,644 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 21:31:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1075 states and 1363 transitions. [2018-10-26 21:31:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1363 transitions. [2018-10-26 21:31:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-26 21:31:13,959 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 21:31:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1091 states and 1378 transitions. [2018-10-26 21:31:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1378 transitions. [2018-10-26 21:31:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-26 21:31:14,585 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 21:31:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1103 states and 1390 transitions. [2018-10-26 21:31:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1390 transitions. [2018-10-26 21:31:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-26 21:31:14,684 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 21:31:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1135 states and 1430 transitions. [2018-10-26 21:31:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1430 transitions. [2018-10-26 21:31:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-26 21:31:16,126 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 21:31:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1158 states and 1455 transitions. [2018-10-26 21:31:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1455 transitions. [2018-10-26 21:31:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-26 21:31:17,256 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 21:31:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1177 states and 1480 transitions. [2018-10-26 21:31:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1480 transitions. [2018-10-26 21:31:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-26 21:31:18,936 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 21:31:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1193 states and 1496 transitions. [2018-10-26 21:31:19,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1496 transitions. [2018-10-26 21:31:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-26 21:31:19,904 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 21:31:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1251 states and 1558 transitions. [2018-10-26 21:31:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1558 transitions. [2018-10-26 21:31:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-26 21:31:20,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 21:31:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1318 states and 1640 transitions. [2018-10-26 21:31:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1640 transitions. [2018-10-26 21:31:22,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-26 21:31:22,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 21:31:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1323 states and 1645 transitions. [2018-10-26 21:31:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1645 transitions. [2018-10-26 21:31:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 21:31:22,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-26 21:31:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1324 states and 1649 transitions. [2018-10-26 21:31:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1649 transitions. [2018-10-26 21:31:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-26 21:31:23,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:31:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1351 states and 1688 transitions. [2018-10-26 21:31:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1688 transitions. [2018-10-26 21:31:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-26 21:31:27,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:31:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1354 states and 1690 transitions. [2018-10-26 21:31:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1690 transitions. [2018-10-26 21:31:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-26 21:31:28,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:31:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1363 states and 1698 transitions. [2018-10-26 21:31:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1698 transitions. [2018-10-26 21:31:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-26 21:31:29,103 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 21:31:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1376 states and 1714 transitions. [2018-10-26 21:31:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1714 transitions. [2018-10-26 21:31:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-26 21:31:29,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 21:31:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1387 states and 1724 transitions. [2018-10-26 21:31:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1724 transitions. [2018-10-26 21:31:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-26 21:31:30,153 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 21:31:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1388 states and 1726 transitions. [2018-10-26 21:31:30,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1726 transitions. [2018-10-26 21:31:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-26 21:31:30,491 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 21:31:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1389 states and 1728 transitions. [2018-10-26 21:31:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1728 transitions. [2018-10-26 21:31:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 21:31:30,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:31:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1414 states and 1778 transitions. [2018-10-26 21:31:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1778 transitions. [2018-10-26 21:31:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 21:31:34,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:31:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1415 states and 1779 transitions. [2018-10-26 21:31:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1779 transitions. [2018-10-26 21:31:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 21:31:35,606 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:31:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1426 states and 1792 transitions. [2018-10-26 21:31:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1792 transitions. [2018-10-26 21:31:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 21:31:36,452 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:31:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1429 states and 1795 transitions. [2018-10-26 21:31:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1795 transitions. [2018-10-26 21:31:36,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 21:31:36,980 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:31:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1442 states and 1809 transitions. [2018-10-26 21:31:38,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1809 transitions. [2018-10-26 21:31:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-26 21:31:38,287 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 21:31:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1463 states and 1832 transitions. [2018-10-26 21:31:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1832 transitions. [2018-10-26 21:31:39,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-26 21:31:39,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 21:31:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1468 states and 1837 transitions. [2018-10-26 21:31:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1837 transitions. [2018-10-26 21:31:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-26 21:31:39,742 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 21:31:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1550 states and 1936 transitions. [2018-10-26 21:31:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1936 transitions. [2018-10-26 21:31:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-26 21:31:42,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:31:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1561 states and 1955 transitions. [2018-10-26 21:31:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1955 transitions. [2018-10-26 21:31:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-26 21:31:46,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:31:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1573 states and 1968 transitions. [2018-10-26 21:31:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1968 transitions. [2018-10-26 21:31:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-26 21:31:48,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:31:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 1643 states and 2044 transitions. [2018-10-26 21:31:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2044 transitions. [2018-10-26 21:31:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 21:31:51,803 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 191 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-26 21:31:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 1648 states and 2050 transitions. [2018-10-26 21:31:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2050 transitions. [2018-10-26 21:31:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 21:31:52,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-26 21:31:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 1659 states and 2062 transitions. [2018-10-26 21:31:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2062 transitions. [2018-10-26 21:31:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 21:31:53,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-26 21:31:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 1662 states and 2066 transitions. [2018-10-26 21:31:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2066 transitions. [2018-10-26 21:31:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 21:31:54,692 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 21:31:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 1666 states and 2074 transitions. [2018-10-26 21:31:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2074 transitions. [2018-10-26 21:31:56,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 21:31:56,127 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 21:31:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 1668 states and 2075 transitions. [2018-10-26 21:31:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2075 transitions. [2018-10-26 21:31:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 21:31:56,731 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 21:31:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 1673 states and 2079 transitions. [2018-10-26 21:31:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2079 transitions. [2018-10-26 21:31:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 21:31:57,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 21:31:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1677 states and 2082 transitions. [2018-10-26 21:31:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2082 transitions. [2018-10-26 21:31:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-26 21:31:58,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-26 21:31:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 1678 states and 2084 transitions. [2018-10-26 21:31:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2084 transitions. [2018-10-26 21:31:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-26 21:31:58,871 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-26 21:31:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:31:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 1683 states and 2091 transitions. [2018-10-26 21:31:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2091 transitions. [2018-10-26 21:31:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 21:31:59,231 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:31:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 21:32:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 1706 states and 2122 transitions. [2018-10-26 21:32:02,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2122 transitions. [2018-10-26 21:32:02,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 21:32:02,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 21:32:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 1708 states and 2125 transitions. [2018-10-26 21:32:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2125 transitions. [2018-10-26 21:32:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-26 21:32:03,556 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 21:32:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 1709 states and 2125 transitions. [2018-10-26 21:32:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2125 transitions. [2018-10-26 21:32:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 21:32:04,008 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:32:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 1727 states and 2144 transitions. [2018-10-26 21:32:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2144 transitions. [2018-10-26 21:32:07,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 21:32:07,056 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:32:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 1735 states and 2156 transitions. [2018-10-26 21:32:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2156 transitions. [2018-10-26 21:32:08,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 21:32:08,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:32:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 1743 states and 2164 transitions. [2018-10-26 21:32:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2164 transitions. [2018-10-26 21:32:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 21:32:10,163 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 21:32:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 1744 states and 2164 transitions. [2018-10-26 21:32:11,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2164 transitions. [2018-10-26 21:32:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-26 21:32:11,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 198 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:32:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 1762 states and 2185 transitions. [2018-10-26 21:32:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2185 transitions. [2018-10-26 21:32:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-26 21:32:13,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 198 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:32:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 1789 states and 2215 transitions. [2018-10-26 21:32:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2215 transitions. [2018-10-26 21:32:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-26 21:32:16,254 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 280 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:32:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 1810 states and 2242 transitions. [2018-10-26 21:32:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2242 transitions. [2018-10-26 21:32:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-26 21:32:19,980 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 21:32:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 1858 states and 2293 transitions. [2018-10-26 21:32:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2293 transitions. [2018-10-26 21:32:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-26 21:32:26,189 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 21:32:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 1863 states and 2299 transitions. [2018-10-26 21:32:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2299 transitions. [2018-10-26 21:32:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-26 21:32:26,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-26 21:32:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:32:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 1869 states and 2307 transitions. [2018-10-26 21:32:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2307 transitions. [2018-10-26 21:32:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 21:32:26,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:32:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:32:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:32:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:32:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:32:27,115 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 118 iterations. [2018-10-26 21:32:27,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 09:32:27 ImpRootNode [2018-10-26 21:32:27,238 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 21:32:27,238 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:32:27,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:32:27,239 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:32:27,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:30:25" (3/4) ... [2018-10-26 21:32:27,242 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 21:32:27,399 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_87973470-3ec0-437c-854c-57e9eea5aa42/bin-2019/ukojak/witness.graphml [2018-10-26 21:32:27,399 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:32:27,400 INFO L168 Benchmark]: Toolchain (without parser) took 127165.99 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 950.4 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 825.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:27,401 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:32:27,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.53 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 920.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:27,401 INFO L168 Benchmark]: Boogie Procedure Inliner took 171.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 920.9 MB in the beginning and 1.1 GB in the end (delta: -201.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:27,401 INFO L168 Benchmark]: Boogie Preprocessor took 60.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:27,401 INFO L168 Benchmark]: RCFGBuilder took 4362.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 889.4 MB in the end (delta: 227.3 MB). Peak memory consumption was 227.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:27,402 INFO L168 Benchmark]: CodeCheck took 121928.06 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 889.4 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 595.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:27,402 INFO L168 Benchmark]: Witness Printer took 161.03 ms. Allocated memory is still 3.0 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:27,407 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, 121.7s OverallTime, 118 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 478184556 SDtfs, -521903654 SDslu, 549213472 SDs, 0 SdLazy, -1741234844 SolverSat, -211631066 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 524.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112133 GetRequests, 107868 SyntacticMatches, 3113 SemanticMatches, 1152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929729 ImplicationChecksByTransitivity, 104.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 16923 NumberOfCodeBlocks, 16923 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 16602 ConstructedInterpolants, 0 QuantifiedInterpolants, 11735484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 117 InterpolantComputations, 90 PerfectInterpolantSequences, 11917/12341 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 478.53 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 920.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 171.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 920.9 MB in the beginning and 1.1 GB in the end (delta: -201.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4362.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 889.4 MB in the end (delta: 227.3 MB). Peak memory consumption was 227.3 MB. Max. memory is 11.5 GB. * CodeCheck took 121928.06 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 889.4 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 595.7 MB. Max. memory is 11.5 GB. * Witness Printer took 161.03 ms. Allocated memory is still 3.0 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...