./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label57_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label57_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/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 00372dd9706fe72201713f336fbc903974e88ef8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 18:43:29,574 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 18:43:29,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 18:43:29,583 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 18:43:29,584 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 18:43:29,584 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 18:43:29,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 18:43:29,587 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 18:43:29,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 18:43:29,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 18:43:29,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 18:43:29,590 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 18:43:29,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 18:43:29,591 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 18:43:29,592 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 18:43:29,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 18:43:29,593 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 18:43:29,594 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 18:43:29,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 18:43:29,597 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 18:43:29,598 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 18:43:29,599 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 18:43:29,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 18:43:29,601 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 18:43:29,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 18:43:29,602 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 18:43:29,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 18:43:29,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 18:43:29,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 18:43:29,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 18:43:29,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 18:43:29,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 18:43:29,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 18:43:29,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 18:43:29,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 18:43:29,607 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 18:43:29,607 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 18:43:29,618 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 18:43:29,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 18:43:29,619 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 18:43:29,619 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 18:43:29,619 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 18:43:29,619 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 18:43:29,619 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 18:43:29,620 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 18:43:29,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 18:43:29,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 18:43:29,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 18:43:29,620 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 18:43:29,620 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 18:43:29,620 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 18:43:29,620 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 18:43:29,621 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 18:43:29,621 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 18:43:29,621 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 18:43:29,621 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 18:43:29,621 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 18:43:29,621 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 18:43:29,621 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 18:43:29,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 18:43:29,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 18:43:29,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 18:43:29,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 18:43:29,622 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 18:43:29,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 18:43:29,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 18:43:29,622 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_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/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 -> 00372dd9706fe72201713f336fbc903974e88ef8 [2018-11-18 18:43:29,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 18:43:29,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 18:43:29,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 18:43:29,655 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 18:43:29,655 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 18:43:29,656 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label57_false-unreach-call_false-termination.c [2018-11-18 18:43:29,704 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/bin-2019/ukojak/data/e618ae59e/57d78e1025064798824005f8b553d742/FLAG0c2d97149 [2018-11-18 18:43:30,102 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 18:43:30,105 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/sv-benchmarks/c/eca-rers2012/Problem01_label57_false-unreach-call_false-termination.c [2018-11-18 18:43:30,114 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/bin-2019/ukojak/data/e618ae59e/57d78e1025064798824005f8b553d742/FLAG0c2d97149 [2018-11-18 18:43:30,475 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/bin-2019/ukojak/data/e618ae59e/57d78e1025064798824005f8b553d742 [2018-11-18 18:43:30,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 18:43:30,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 18:43:30,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 18:43:30,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 18:43:30,482 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 18:43:30,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:43:30" (1/1) ... [2018-11-18 18:43:30,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbe6507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:30, skipping insertion in model container [2018-11-18 18:43:30,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:43:30" (1/1) ... [2018-11-18 18:43:30,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 18:43:30,525 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 18:43:30,771 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:43:30,775 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 18:43:30,841 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:43:30,851 INFO L195 MainTranslator]: Completed translation [2018-11-18 18:43:30,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:30 WrapperNode [2018-11-18 18:43:30,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 18:43:30,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 18:43:30,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 18:43:30,852 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 18:43:30,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:30" (1/1) ... [2018-11-18 18:43:30,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:30" (1/1) ... [2018-11-18 18:43:30,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 18:43:30,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 18:43:30,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 18:43:30,965 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 18:43:30,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:30" (1/1) ... [2018-11-18 18:43:30,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:30" (1/1) ... [2018-11-18 18:43:30,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:30" (1/1) ... [2018-11-18 18:43:30,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:30" (1/1) ... [2018-11-18 18:43:30,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:30" (1/1) ... [2018-11-18 18:43:30,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:30" (1/1) ... [2018-11-18 18:43:31,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:30" (1/1) ... [2018-11-18 18:43:31,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 18:43:31,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 18:43:31,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 18:43:31,008 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 18:43:31,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 18:43:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 18:43:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 18:43:31,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 18:43:32,409 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 18:43:32,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:43:32 BoogieIcfgContainer [2018-11-18 18:43:32,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 18:43:32,410 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 18:43:32,411 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 18:43:32,418 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 18:43:32,418 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:43:32" (1/1) ... [2018-11-18 18:43:32,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:43:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-18 18:43:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-18 18:43:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 18:43:32,458 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 147 states and 239 transitions. [2018-11-18 18:43:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 239 transitions. [2018-11-18 18:43:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 18:43:33,046 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 18:43:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 148 states and 240 transitions. [2018-11-18 18:43:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 240 transitions. [2018-11-18 18:43:33,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 18:43:33,253 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 153 states and 248 transitions. [2018-11-18 18:43:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 248 transitions. [2018-11-18 18:43:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 18:43:33,383 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 162 states and 264 transitions. [2018-11-18 18:43:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 264 transitions. [2018-11-18 18:43:33,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 18:43:33,586 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 18:43:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 163 states and 265 transitions. [2018-11-18 18:43:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 265 transitions. [2018-11-18 18:43:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-18 18:43:33,696 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 18:43:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 176 states and 286 transitions. [2018-11-18 18:43:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 286 transitions. [2018-11-18 18:43:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-18 18:43:34,063 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 182 states and 293 transitions. [2018-11-18 18:43:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 293 transitions. [2018-11-18 18:43:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 18:43:34,211 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 183 states and 294 transitions. [2018-11-18 18:43:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 294 transitions. [2018-11-18 18:43:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 18:43:34,291 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 198 states and 314 transitions. [2018-11-18 18:43:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 314 transitions. [2018-11-18 18:43:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 18:43:34,802 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 199 states and 316 transitions. [2018-11-18 18:43:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 316 transitions. [2018-11-18 18:43:34,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 18:43:34,860 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 209 states and 335 transitions. [2018-11-18 18:43:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 335 transitions. [2018-11-18 18:43:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 18:43:35,191 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 210 states and 337 transitions. [2018-11-18 18:43:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 337 transitions. [2018-11-18 18:43:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 18:43:35,293 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 18:43:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 211 states and 338 transitions. [2018-11-18 18:43:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 338 transitions. [2018-11-18 18:43:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 18:43:35,362 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 214 states and 341 transitions. [2018-11-18 18:43:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 341 transitions. [2018-11-18 18:43:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 18:43:35,426 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 225 states and 359 transitions. [2018-11-18 18:43:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 359 transitions. [2018-11-18 18:43:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 18:43:36,145 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 18:43:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 227 states and 360 transitions. [2018-11-18 18:43:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 360 transitions. [2018-11-18 18:43:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 18:43:36,292 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:43:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 231 states and 364 transitions. [2018-11-18 18:43:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 364 transitions. [2018-11-18 18:43:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 18:43:36,469 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:43:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 232 states and 365 transitions. [2018-11-18 18:43:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 365 transitions. [2018-11-18 18:43:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 18:43:36,621 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 238 states and 375 transitions. [2018-11-18 18:43:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 375 transitions. [2018-11-18 18:43:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 18:43:36,898 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 249 states and 391 transitions. [2018-11-18 18:43:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 391 transitions. [2018-11-18 18:43:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 18:43:37,416 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:43:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 251 states and 392 transitions. [2018-11-18 18:43:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 392 transitions. [2018-11-18 18:43:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 18:43:37,519 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 276 states and 426 transitions. [2018-11-18 18:43:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 426 transitions. [2018-11-18 18:43:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 18:43:38,479 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 18:43:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 287 states and 440 transitions. [2018-11-18 18:43:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 440 transitions. [2018-11-18 18:43:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 18:43:38,958 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 290 states and 443 transitions. [2018-11-18 18:43:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 443 transitions. [2018-11-18 18:43:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 18:43:39,012 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:43:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 292 states and 448 transitions. [2018-11-18 18:43:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 448 transitions. [2018-11-18 18:43:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 18:43:39,155 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 306 states and 470 transitions. [2018-11-18 18:43:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 470 transitions. [2018-11-18 18:43:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 18:43:39,871 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 311 states and 477 transitions. [2018-11-18 18:43:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 477 transitions. [2018-11-18 18:43:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 18:43:40,130 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 326 states and 492 transitions. [2018-11-18 18:43:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 492 transitions. [2018-11-18 18:43:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 18:43:40,703 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:41,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 337 states and 504 transitions. [2018-11-18 18:43:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 504 transitions. [2018-11-18 18:43:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 18:43:41,438 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 339 states and 507 transitions. [2018-11-18 18:43:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 507 transitions. [2018-11-18 18:43:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 18:43:41,480 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 365 states and 548 transitions. [2018-11-18 18:43:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 548 transitions. [2018-11-18 18:43:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 18:43:43,332 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 367 states and 551 transitions. [2018-11-18 18:43:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 551 transitions. [2018-11-18 18:43:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 18:43:43,723 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 378 states and 564 transitions. [2018-11-18 18:43:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 564 transitions. [2018-11-18 18:43:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 18:43:44,353 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 388 states and 574 transitions. [2018-11-18 18:43:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 574 transitions. [2018-11-18 18:43:44,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 18:43:44,796 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 402 states and 595 transitions. [2018-11-18 18:43:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 595 transitions. [2018-11-18 18:43:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 18:43:46,365 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 18:43:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 413 states and 608 transitions. [2018-11-18 18:43:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 608 transitions. [2018-11-18 18:43:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 18:43:47,340 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:43:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 420 states and 617 transitions. [2018-11-18 18:43:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 617 transitions. [2018-11-18 18:43:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 18:43:47,696 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:47,716 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:43:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 421 states and 618 transitions. [2018-11-18 18:43:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2018-11-18 18:43:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 18:43:47,892 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:43:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 422 states and 618 transitions. [2018-11-18 18:43:48,012 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 618 transitions. [2018-11-18 18:43:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 18:43:48,013 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 439 states and 639 transitions. [2018-11-18 18:43:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 639 transitions. [2018-11-18 18:43:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 18:43:49,014 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 452 states and 663 transitions. [2018-11-18 18:43:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 663 transitions. [2018-11-18 18:43:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 18:43:49,906 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 463 states and 673 transitions. [2018-11-18 18:43:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 673 transitions. [2018-11-18 18:43:50,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 18:43:50,294 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 467 states and 677 transitions. [2018-11-18 18:43:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 677 transitions. [2018-11-18 18:43:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 18:43:50,484 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:50,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 474 states and 684 transitions. [2018-11-18 18:43:50,619 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 684 transitions. [2018-11-18 18:43:50,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 18:43:50,620 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 475 states and 684 transitions. [2018-11-18 18:43:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 684 transitions. [2018-11-18 18:43:50,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 18:43:50,781 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 546 states and 764 transitions. [2018-11-18 18:43:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 764 transitions. [2018-11-18 18:43:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 18:43:51,218 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 554 states and 772 transitions. [2018-11-18 18:43:51,837 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 772 transitions. [2018-11-18 18:43:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 18:43:51,838 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 555 states and 772 transitions. [2018-11-18 18:43:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 772 transitions. [2018-11-18 18:43:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 18:43:52,084 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 564 states and 783 transitions. [2018-11-18 18:43:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 783 transitions. [2018-11-18 18:43:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-18 18:43:52,133 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 573 states and 797 transitions. [2018-11-18 18:43:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 797 transitions. [2018-11-18 18:43:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-18 18:43:52,718 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 580 states and 803 transitions. [2018-11-18 18:43:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 803 transitions. [2018-11-18 18:43:53,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-18 18:43:53,045 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 585 states and 807 transitions. [2018-11-18 18:43:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 807 transitions. [2018-11-18 18:43:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 18:43:53,465 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 598 states and 822 transitions. [2018-11-18 18:43:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 822 transitions. [2018-11-18 18:43:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 18:43:53,726 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 18:43:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 600 states and 823 transitions. [2018-11-18 18:43:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 823 transitions. [2018-11-18 18:43:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 18:43:53,849 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 604 states and 826 transitions. [2018-11-18 18:43:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 826 transitions. [2018-11-18 18:43:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 18:43:53,994 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 618 states and 842 transitions. [2018-11-18 18:43:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 842 transitions. [2018-11-18 18:43:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 18:43:54,286 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:43:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 620 states and 843 transitions. [2018-11-18 18:43:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 843 transitions. [2018-11-18 18:43:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 18:43:54,408 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:43:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 622 states and 846 transitions. [2018-11-18 18:43:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 846 transitions. [2018-11-18 18:43:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 18:43:54,449 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 667 states and 894 transitions. [2018-11-18 18:43:56,584 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 894 transitions. [2018-11-18 18:43:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 18:43:56,584 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 18:43:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 764 states and 999 transitions. [2018-11-18 18:43:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 999 transitions. [2018-11-18 18:43:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 18:43:57,887 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 778 states and 1018 transitions. [2018-11-18 18:43:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1018 transitions. [2018-11-18 18:43:58,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 18:43:58,607 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 786 states and 1028 transitions. [2018-11-18 18:43:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1028 transitions. [2018-11-18 18:43:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 18:43:59,243 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 791 states and 1032 transitions. [2018-11-18 18:43:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1032 transitions. [2018-11-18 18:43:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 18:43:59,403 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 18:44:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 805 states and 1063 transitions. [2018-11-18 18:44:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1063 transitions. [2018-11-18 18:44:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 18:44:00,439 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 18:44:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 810 states and 1070 transitions. [2018-11-18 18:44:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1070 transitions. [2018-11-18 18:44:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 18:44:00,875 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 18:44:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 815 states and 1081 transitions. [2018-11-18 18:44:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1081 transitions. [2018-11-18 18:44:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 18:44:01,340 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:44:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 856 states and 1135 transitions. [2018-11-18 18:44:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1135 transitions. [2018-11-18 18:44:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 18:44:03,859 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:44:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 872 states and 1149 transitions. [2018-11-18 18:44:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1149 transitions. [2018-11-18 18:44:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 18:44:04,468 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:44:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 876 states and 1153 transitions. [2018-11-18 18:44:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1153 transitions. [2018-11-18 18:44:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 18:44:04,731 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 18:44:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 886 states and 1178 transitions. [2018-11-18 18:44:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1178 transitions. [2018-11-18 18:44:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 18:44:06,262 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 18:44:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 889 states and 1181 transitions. [2018-11-18 18:44:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1181 transitions. [2018-11-18 18:44:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 18:44:06,426 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 18:44:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 904 states and 1200 transitions. [2018-11-18 18:44:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1200 transitions. [2018-11-18 18:44:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 18:44:06,945 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 921 states and 1217 transitions. [2018-11-18 18:44:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1217 transitions. [2018-11-18 18:44:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 18:44:07,049 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 952 states and 1252 transitions. [2018-11-18 18:44:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1252 transitions. [2018-11-18 18:44:08,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 18:44:08,688 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 977 states and 1279 transitions. [2018-11-18 18:44:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1279 transitions. [2018-11-18 18:44:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 18:44:10,433 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-18 18:44:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:10,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 978 states and 1279 transitions. [2018-11-18 18:44:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1279 transitions. [2018-11-18 18:44:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 18:44:10,522 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1017 states and 1330 transitions. [2018-11-18 18:44:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1330 transitions. [2018-11-18 18:44:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 18:44:13,606 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1048 states and 1360 transitions. [2018-11-18 18:44:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1360 transitions. [2018-11-18 18:44:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 18:44:14,456 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:44:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1065 states and 1378 transitions. [2018-11-18 18:44:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1378 transitions. [2018-11-18 18:44:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 18:44:14,529 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1106 states and 1421 transitions. [2018-11-18 18:44:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1421 transitions. [2018-11-18 18:44:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 18:44:15,394 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1117 states and 1433 transitions. [2018-11-18 18:44:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1433 transitions. [2018-11-18 18:44:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 18:44:15,663 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 18:44:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1124 states and 1446 transitions. [2018-11-18 18:44:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1446 transitions. [2018-11-18 18:44:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 18:44:16,021 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:16,057 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 18:44:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1128 states and 1450 transitions. [2018-11-18 18:44:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1450 transitions. [2018-11-18 18:44:16,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 18:44:16,313 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 18:44:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1129 states and 1450 transitions. [2018-11-18 18:44:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1450 transitions. [2018-11-18 18:44:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 18:44:16,640 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1149 states and 1473 transitions. [2018-11-18 18:44:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1473 transitions. [2018-11-18 18:44:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 18:44:18,205 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 131 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 18:44:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1174 states and 1500 transitions. [2018-11-18 18:44:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1500 transitions. [2018-11-18 18:44:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 18:44:19,763 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 18:44:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1241 states and 1579 transitions. [2018-11-18 18:44:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1579 transitions. [2018-11-18 18:44:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 18:44:21,498 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 18:44:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1246 states and 1585 transitions. [2018-11-18 18:44:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1585 transitions. [2018-11-18 18:44:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 18:44:22,352 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 18:44:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1251 states and 1591 transitions. [2018-11-18 18:44:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1591 transitions. [2018-11-18 18:44:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 18:44:22,683 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 18:44:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1252 states and 1591 transitions. [2018-11-18 18:44:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1591 transitions. [2018-11-18 18:44:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 18:44:23,007 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 18:44:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1273 states and 1627 transitions. [2018-11-18 18:44:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1627 transitions. [2018-11-18 18:44:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 18:44:25,396 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 18:44:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1278 states and 1630 transitions. [2018-11-18 18:44:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1630 transitions. [2018-11-18 18:44:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 18:44:26,526 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 18:44:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1281 states and 1633 transitions. [2018-11-18 18:44:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1633 transitions. [2018-11-18 18:44:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 18:44:26,889 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 18:44:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1296 states and 1649 transitions. [2018-11-18 18:44:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1649 transitions. [2018-11-18 18:44:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 18:44:27,254 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 18:44:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1298 states and 1649 transitions. [2018-11-18 18:44:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1649 transitions. [2018-11-18 18:44:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 18:44:27,965 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 18:44:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1303 states and 1654 transitions. [2018-11-18 18:44:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1654 transitions. [2018-11-18 18:44:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 18:44:28,348 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 18:44:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1328 states and 1681 transitions. [2018-11-18 18:44:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1681 transitions. [2018-11-18 18:44:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 18:44:28,652 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 18:44:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1329 states and 1682 transitions. [2018-11-18 18:44:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1682 transitions. [2018-11-18 18:44:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 18:44:28,890 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 18:44:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1336 states and 1689 transitions. [2018-11-18 18:44:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1689 transitions. [2018-11-18 18:44:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 18:44:29,057 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 18:44:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1349 states and 1711 transitions. [2018-11-18 18:44:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1711 transitions. [2018-11-18 18:44:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 18:44:30,347 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 18:44:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:30,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1354 states and 1719 transitions. [2018-11-18 18:44:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1719 transitions. [2018-11-18 18:44:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 18:44:30,761 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 18:44:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1359 states and 1724 transitions. [2018-11-18 18:44:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1724 transitions. [2018-11-18 18:44:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 18:44:31,204 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 18:44:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1360 states and 1726 transitions. [2018-11-18 18:44:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1726 transitions. [2018-11-18 18:44:31,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-18 18:44:31,595 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 18:44:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1370 states and 1738 transitions. [2018-11-18 18:44:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1738 transitions. [2018-11-18 18:44:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-18 18:44:32,633 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 18:44:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1375 states and 1743 transitions. [2018-11-18 18:44:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1743 transitions. [2018-11-18 18:44:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 18:44:32,965 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1385 states and 1756 transitions. [2018-11-18 18:44:35,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1756 transitions. [2018-11-18 18:44:35,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 18:44:35,650 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1396 states and 1769 transitions. [2018-11-18 18:44:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1769 transitions. [2018-11-18 18:44:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 18:44:36,808 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1410 states and 1782 transitions. [2018-11-18 18:44:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1782 transitions. [2018-11-18 18:44:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 18:44:37,675 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1438 states and 1813 transitions. [2018-11-18 18:44:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1813 transitions. [2018-11-18 18:44:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 18:44:38,718 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1509 states and 1893 transitions. [2018-11-18 18:44:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1893 transitions. [2018-11-18 18:44:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 18:44:42,636 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1521 states and 1906 transitions. [2018-11-18 18:44:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1906 transitions. [2018-11-18 18:44:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 18:44:44,399 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1530 states and 1916 transitions. [2018-11-18 18:44:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1916 transitions. [2018-11-18 18:44:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 18:44:45,374 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1535 states and 1922 transitions. [2018-11-18 18:44:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1922 transitions. [2018-11-18 18:44:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 18:44:45,785 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 114 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 18:44:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 1658 states and 2056 transitions. [2018-11-18 18:44:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2056 transitions. [2018-11-18 18:44:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 18:44:48,211 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 18:44:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 1670 states and 2066 transitions. [2018-11-18 18:44:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2066 transitions. [2018-11-18 18:44:49,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 18:44:49,373 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 18:44:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 1675 states and 2071 transitions. [2018-11-18 18:44:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2071 transitions. [2018-11-18 18:44:50,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 18:44:50,645 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 18:44:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1685 states and 2082 transitions. [2018-11-18 18:44:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2082 transitions. [2018-11-18 18:44:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 18:44:52,645 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 1725 states and 2125 transitions. [2018-11-18 18:44:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2125 transitions. [2018-11-18 18:44:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 18:44:55,819 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 18:45:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 1773 states and 2173 transitions. [2018-11-18 18:45:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2173 transitions. [2018-11-18 18:45:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 18:45:00,126 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 18:45:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1775 states and 2174 transitions. [2018-11-18 18:45:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2174 transitions. [2018-11-18 18:45:00,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 18:45:00,604 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 18:45:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 1777 states and 2175 transitions. [2018-11-18 18:45:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2175 transitions. [2018-11-18 18:45:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 18:45:00,801 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 18:45:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 1842 states and 2243 transitions. [2018-11-18 18:45:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2243 transitions. [2018-11-18 18:45:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 18:45:05,968 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 280 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:45:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 1873 states and 2280 transitions. [2018-11-18 18:45:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2280 transitions. [2018-11-18 18:45:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-18 18:45:08,608 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 144 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:45:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 1942 states and 2370 transitions. [2018-11-18 18:45:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2370 transitions. [2018-11-18 18:45:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 18:45:17,058 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 118 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 18:45:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 1965 states and 2393 transitions. [2018-11-18 18:45:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2393 transitions. [2018-11-18 18:45:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-18 18:45:17,933 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 204 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:45:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2044 states and 2490 transitions. [2018-11-18 18:45:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2490 transitions. [2018-11-18 18:45:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-18 18:45:25,474 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 137 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-18 18:45:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2056 states and 2502 transitions. [2018-11-18 18:45:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2502 transitions. [2018-11-18 18:45:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-18 18:45:25,834 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 137 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-18 18:45:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2057 states and 2502 transitions. [2018-11-18 18:45:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2502 transitions. [2018-11-18 18:45:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-18 18:45:26,331 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-18 18:45:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2128 states and 2576 transitions. [2018-11-18 18:45:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2576 transitions. [2018-11-18 18:45:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-18 18:45:27,243 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 18:45:33,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2181 states and 2631 transitions. [2018-11-18 18:45:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2631 transitions. [2018-11-18 18:45:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 18:45:33,327 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-18 18:45:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2182 states and 2631 transitions. [2018-11-18 18:45:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2631 transitions. [2018-11-18 18:45:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-18 18:45:33,627 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 18:45:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2190 states and 2639 transitions. [2018-11-18 18:45:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2639 transitions. [2018-11-18 18:45:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-18 18:45:34,168 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 18:45:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2195 states and 2643 transitions. [2018-11-18 18:45:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2643 transitions. [2018-11-18 18:45:34,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-18 18:45:34,452 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 347 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 18:45:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2177 states and 2624 transitions. [2018-11-18 18:45:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 2624 transitions. [2018-11-18 18:45:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-18 18:45:36,503 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 18:45:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2183 states and 2633 transitions. [2018-11-18 18:45:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2633 transitions. [2018-11-18 18:45:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-18 18:45:37,212 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:45:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:45:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:45:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:45:37,464 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 136 iterations. [2018-11-18 18:45:37,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 06:45:37 ImpRootNode [2018-11-18 18:45:37,611 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 18:45:37,611 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 18:45:37,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 18:45:37,611 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 18:45:37,612 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:43:32" (3/4) ... [2018-11-18 18:45:37,614 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 18:45:37,749 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8cb31a66-79de-45df-8cf5-e4c8bc3a8732/bin-2019/ukojak/witness.graphml [2018-11-18 18:45:37,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 18:45:37,749 INFO L168 Benchmark]: Toolchain (without parser) took 127271.78 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 957.0 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-18 18:45:37,751 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:45:37,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.01 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 919.4 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-18 18:45:37,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 919.4 MB in the beginning and 1.1 GB in the end (delta: -220.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-18 18:45:37,751 INFO L168 Benchmark]: Boogie Preprocessor took 42.75 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 18:45:37,752 INFO L168 Benchmark]: RCFGBuilder took 1401.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 900.8 MB in the end (delta: 236.7 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. [2018-11-18 18:45:37,752 INFO L168 Benchmark]: CodeCheck took 125200.09 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 900.8 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 828.0 MB. Max. memory is 11.5 GB. [2018-11-18 18:45:37,752 INFO L168 Benchmark]: Witness Printer took 137.89 ms. Allocated memory is still 3.6 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-18 18:45:37,754 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, 125.0s OverallTime, 136 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1694579076 SDtfs, 1162973516 SDslu, -1597404256 SDs, 0 SdLazy, 1395667844 SolverSat, -1400973192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 329.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133979 GetRequests, 129411 SyntacticMatches, 3104 SemanticMatches, 1464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1469012 ImplicationChecksByTransitivity, 110.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 19243 NumberOfCodeBlocks, 19243 NumberOfCodeBlocksAsserted, 136 NumberOfCheckSat, 18839 ConstructedInterpolants, 0 QuantifiedInterpolants, 13944325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 135 InterpolantComputations, 103 PerfectInterpolantSequences, 12158/12712 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: 410]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] RET return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND 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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND TRUE ((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5)) [L366] a21 = 1 [L367] a7 = 0 [L368] a17 = 0 [L369] a8 = 14 [L370] a20 = 0 [L371] RET return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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=5, a17=0, a20=0, a21=1, a7=0, 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))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] __VERIFIER_error() VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.01 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 919.4 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 919.4 MB in the beginning and 1.1 GB in the end (delta: -220.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.75 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1401.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 900.8 MB in the end (delta: 236.7 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. * CodeCheck took 125200.09 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 900.8 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 828.0 MB. Max. memory is 11.5 GB. * Witness Printer took 137.89 ms. Allocated memory is still 3.6 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...