./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/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 fa966b8d35f41797c67ed2115fa88ccdba9ca513 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-635dfa2 [2018-12-02 00:54:52,553 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 00:54:52,554 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 00:54:52,563 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 00:54:52,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 00:54:52,564 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 00:54:52,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 00:54:52,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 00:54:52,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 00:54:52,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 00:54:52,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 00:54:52,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 00:54:52,567 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 00:54:52,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 00:54:52,568 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 00:54:52,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 00:54:52,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 00:54:52,570 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 00:54:52,571 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 00:54:52,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 00:54:52,573 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 00:54:52,574 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 00:54:52,575 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 00:54:52,576 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 00:54:52,576 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 00:54:52,576 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 00:54:52,577 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 00:54:52,577 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 00:54:52,578 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 00:54:52,578 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 00:54:52,579 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 00:54:52,579 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 00:54:52,579 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 00:54:52,579 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 00:54:52,580 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 00:54:52,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 00:54:52,581 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-02 00:54:52,591 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 00:54:52,591 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 00:54:52,592 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 00:54:52,592 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-02 00:54:52,593 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 00:54:52,593 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 00:54:52,593 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 00:54:52,593 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 00:54:52,593 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 00:54:52,593 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 00:54:52,594 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 00:54:52,594 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 00:54:52,594 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 00:54:52,594 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 00:54:52,594 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 00:54:52,594 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 00:54:52,594 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 00:54:52,595 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 00:54:52,595 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-02 00:54:52,595 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-02 00:54:52,595 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 00:54:52,595 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 00:54:52,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 00:54:52,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 00:54:52,596 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 00:54:52,596 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 00:54:52,596 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-02 00:54:52,596 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 00:54:52,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 00:54:52,596 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_9de02dbc-edbd-4e63-b2e2-11f2e493c173/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 -> fa966b8d35f41797c67ed2115fa88ccdba9ca513 [2018-12-02 00:54:52,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 00:54:52,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 00:54:52,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 00:54:52,629 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 00:54:52,629 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 00:54:52,629 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c [2018-12-02 00:54:52,663 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/bin-2019/ukojak/data/67e748d4f/bcc85e4cde4f48c5a2669134bf145370/FLAG5303a69d0 [2018-12-02 00:54:53,131 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 00:54:53,131 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/sv-benchmarks/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c [2018-12-02 00:54:53,139 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/bin-2019/ukojak/data/67e748d4f/bcc85e4cde4f48c5a2669134bf145370/FLAG5303a69d0 [2018-12-02 00:54:53,150 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/bin-2019/ukojak/data/67e748d4f/bcc85e4cde4f48c5a2669134bf145370 [2018-12-02 00:54:53,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 00:54:53,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 00:54:53,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 00:54:53,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 00:54:53,156 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 00:54:53,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:54:53" (1/1) ... [2018-12-02 00:54:53,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:54:53, skipping insertion in model container [2018-12-02 00:54:53,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:54:53" (1/1) ... [2018-12-02 00:54:53,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 00:54:53,195 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 00:54:53,398 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:54:53,402 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 00:54:53,500 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:54:53,509 INFO L195 MainTranslator]: Completed translation [2018-12-02 00:54:53,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:54:53 WrapperNode [2018-12-02 00:54:53,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 00:54:53,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 00:54:53,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 00:54:53,511 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 00:54:53,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:54:53" (1/1) ... [2018-12-02 00:54:53,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:54:53" (1/1) ... [2018-12-02 00:54:53,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 00:54:53,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 00:54:53,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 00:54:53,554 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 00:54:53,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:54:53" (1/1) ... [2018-12-02 00:54:53,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:54:53" (1/1) ... [2018-12-02 00:54:53,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:54:53" (1/1) ... [2018-12-02 00:54:53,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:54:53" (1/1) ... [2018-12-02 00:54:53,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:54:53" (1/1) ... [2018-12-02 00:54:53,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:54:53" (1/1) ... [2018-12-02 00:54:53,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:54:53" (1/1) ... [2018-12-02 00:54:53,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 00:54:53,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 00:54:53,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 00:54:53,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 00:54:53,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:54:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/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-12-02 00:54:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 00:54:53,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 00:54:54,596 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 00:54:54,596 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 00:54:54,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:54:54 BoogieIcfgContainer [2018-12-02 00:54:54,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 00:54:54,597 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-02 00:54:54,597 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-02 00:54:54,607 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-02 00:54:54,607 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:54:54" (1/1) ... [2018-12-02 00:54:54,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:54:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-02 00:54:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-02 00:54:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 00:54:54,652 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:54:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2018-12-02 00:54:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2018-12-02 00:54:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 00:54:55,126 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 00:54:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 146 states and 221 transitions. [2018-12-02 00:54:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2018-12-02 00:54:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 00:54:55,265 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:54:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 151 states and 230 transitions. [2018-12-02 00:54:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2018-12-02 00:54:55,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 00:54:55,363 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:54:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 221 states and 316 transitions. [2018-12-02 00:54:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 316 transitions. [2018-12-02 00:54:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 00:54:55,775 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:54:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 231 states and 333 transitions. [2018-12-02 00:54:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 333 transitions. [2018-12-02 00:54:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 00:54:56,197 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:54:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 242 states and 350 transitions. [2018-12-02 00:54:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 350 transitions. [2018-12-02 00:54:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 00:54:56,687 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:54:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 245 states and 353 transitions. [2018-12-02 00:54:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 353 transitions. [2018-12-02 00:54:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 00:54:56,819 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:54:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 247 states and 354 transitions. [2018-12-02 00:54:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 354 transitions. [2018-12-02 00:54:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 00:54:56,945 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 00:54:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 258 states and 368 transitions. [2018-12-02 00:54:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 368 transitions. [2018-12-02 00:54:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 00:54:57,200 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:54:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 264 states and 375 transitions. [2018-12-02 00:54:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 375 transitions. [2018-12-02 00:54:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 00:54:57,483 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 00:54:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 272 states and 384 transitions. [2018-12-02 00:54:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 384 transitions. [2018-12-02 00:54:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 00:54:57,646 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:57,737 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:54:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 277 states and 391 transitions. [2018-12-02 00:54:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 391 transitions. [2018-12-02 00:54:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 00:54:57,944 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 00:54:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 288 states and 411 transitions. [2018-12-02 00:54:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 411 transitions. [2018-12-02 00:54:58,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 00:54:58,503 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 00:54:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 293 states and 418 transitions. [2018-12-02 00:54:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 418 transitions. [2018-12-02 00:54:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 00:54:58,755 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:54:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:54:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 312 states and 440 transitions. [2018-12-02 00:54:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 440 transitions. [2018-12-02 00:54:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 00:54:59,111 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:54:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:54:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 00:55:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 342 states and 478 transitions. [2018-12-02 00:55:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 478 transitions. [2018-12-02 00:55:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 00:55:00,176 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 00:55:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 346 states and 482 transitions. [2018-12-02 00:55:00,357 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 482 transitions. [2018-12-02 00:55:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 00:55:00,358 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 361 states and 499 transitions. [2018-12-02 00:55:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 499 transitions. [2018-12-02 00:55:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 00:55:00,706 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:55:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 379 states and 517 transitions. [2018-12-02 00:55:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 517 transitions. [2018-12-02 00:55:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 00:55:01,103 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:55:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 401 states and 546 transitions. [2018-12-02 00:55:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 546 transitions. [2018-12-02 00:55:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 00:55:02,312 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:55:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 406 states and 551 transitions. [2018-12-02 00:55:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 551 transitions. [2018-12-02 00:55:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 00:55:02,741 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 00:55:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 414 states and 563 transitions. [2018-12-02 00:55:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 563 transitions. [2018-12-02 00:55:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 00:55:03,363 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 00:55:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 415 states and 564 transitions. [2018-12-02 00:55:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 564 transitions. [2018-12-02 00:55:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-02 00:55:03,555 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:03,740 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:55:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 422 states and 576 transitions. [2018-12-02 00:55:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 576 transitions. [2018-12-02 00:55:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-02 00:55:04,668 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:55:04,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 424 states and 578 transitions. [2018-12-02 00:55:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 578 transitions. [2018-12-02 00:55:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-02 00:55:04,864 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 00:55:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 433 states and 587 transitions. [2018-12-02 00:55:04,908 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 587 transitions. [2018-12-02 00:55:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-02 00:55:04,909 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:55:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 449 states and 606 transitions. [2018-12-02 00:55:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 606 transitions. [2018-12-02 00:55:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 00:55:05,243 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 00:55:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 451 states and 608 transitions. [2018-12-02 00:55:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 608 transitions. [2018-12-02 00:55:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-02 00:55:05,280 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 488 states and 652 transitions. [2018-12-02 00:55:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 652 transitions. [2018-12-02 00:55:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-02 00:55:06,627 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 497 states and 662 transitions. [2018-12-02 00:55:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 662 transitions. [2018-12-02 00:55:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-02 00:55:07,119 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 89 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 525 states and 698 transitions. [2018-12-02 00:55:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 698 transitions. [2018-12-02 00:55:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-02 00:55:08,742 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 89 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 530 states and 704 transitions. [2018-12-02 00:55:09,023 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 704 transitions. [2018-12-02 00:55:09,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-02 00:55:09,023 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:55:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 571 states and 748 transitions. [2018-12-02 00:55:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 748 transitions. [2018-12-02 00:55:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-02 00:55:09,492 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:55:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 596 states and 778 transitions. [2018-12-02 00:55:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 778 transitions. [2018-12-02 00:55:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-02 00:55:09,874 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 00:55:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 603 states and 787 transitions. [2018-12-02 00:55:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 787 transitions. [2018-12-02 00:55:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 00:55:10,090 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 623 states and 810 transitions. [2018-12-02 00:55:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 810 transitions. [2018-12-02 00:55:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 00:55:11,980 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 00:55:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 639 states and 826 transitions. [2018-12-02 00:55:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 826 transitions. [2018-12-02 00:55:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 00:55:12,141 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 00:55:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 642 states and 829 transitions. [2018-12-02 00:55:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 829 transitions. [2018-12-02 00:55:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 00:55:12,348 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:55:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 654 states and 842 transitions. [2018-12-02 00:55:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 842 transitions. [2018-12-02 00:55:12,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 00:55:12,507 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 719 states and 909 transitions. [2018-12-02 00:55:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 909 transitions. [2018-12-02 00:55:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-02 00:55:14,470 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 776 states and 971 transitions. [2018-12-02 00:55:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 971 transitions. [2018-12-02 00:55:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 00:55:17,840 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 00:55:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 780 states and 975 transitions. [2018-12-02 00:55:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 975 transitions. [2018-12-02 00:55:17,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 00:55:17,965 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 849 states and 1056 transitions. [2018-12-02 00:55:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1056 transitions. [2018-12-02 00:55:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 00:55:20,886 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 853 states and 1059 transitions. [2018-12-02 00:55:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1059 transitions. [2018-12-02 00:55:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 00:55:21,249 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 00:55:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 871 states and 1077 transitions. [2018-12-02 00:55:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1077 transitions. [2018-12-02 00:55:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 00:55:21,328 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-02 00:55:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 875 states and 1080 transitions. [2018-12-02 00:55:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1080 transitions. [2018-12-02 00:55:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 00:55:21,706 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 00:55:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 877 states and 1082 transitions. [2018-12-02 00:55:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1082 transitions. [2018-12-02 00:55:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-02 00:55:21,755 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 878 states and 1084 transitions. [2018-12-02 00:55:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1084 transitions. [2018-12-02 00:55:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-02 00:55:21,847 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 00:55:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 888 states and 1097 transitions. [2018-12-02 00:55:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1097 transitions. [2018-12-02 00:55:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 00:55:23,223 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 959 states and 1168 transitions. [2018-12-02 00:55:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1168 transitions. [2018-12-02 00:55:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-02 00:55:24,406 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 00:55:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 989 states and 1206 transitions. [2018-12-02 00:55:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1206 transitions. [2018-12-02 00:55:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-02 00:55:26,430 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 00:55:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 993 states and 1211 transitions. [2018-12-02 00:55:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1211 transitions. [2018-12-02 00:55:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-02 00:55:26,954 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:55:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 995 states and 1213 transitions. [2018-12-02 00:55:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1213 transitions. [2018-12-02 00:55:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-02 00:55:27,206 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 00:55:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1010 states and 1234 transitions. [2018-12-02 00:55:28,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1234 transitions. [2018-12-02 00:55:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-02 00:55:28,530 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 00:55:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1015 states and 1240 transitions. [2018-12-02 00:55:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1240 transitions. [2018-12-02 00:55:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-02 00:55:29,057 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 00:55:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1018 states and 1244 transitions. [2018-12-02 00:55:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1244 transitions. [2018-12-02 00:55:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 00:55:29,255 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1066 states and 1305 transitions. [2018-12-02 00:55:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1305 transitions. [2018-12-02 00:55:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 00:55:33,029 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1070 states and 1308 transitions. [2018-12-02 00:55:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1308 transitions. [2018-12-02 00:55:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 00:55:33,733 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 175 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 00:55:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1074 states and 1314 transitions. [2018-12-02 00:55:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1314 transitions. [2018-12-02 00:55:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 00:55:34,518 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 175 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 00:55:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1077 states and 1317 transitions. [2018-12-02 00:55:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1317 transitions. [2018-12-02 00:55:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 00:55:34,870 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1106 states and 1354 transitions. [2018-12-02 00:55:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1354 transitions. [2018-12-02 00:55:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 00:55:37,253 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-02 00:55:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1114 states and 1361 transitions. [2018-12-02 00:55:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1361 transitions. [2018-12-02 00:55:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-02 00:55:37,320 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 00:55:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:39,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1150 states and 1400 transitions. [2018-12-02 00:55:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1400 transitions. [2018-12-02 00:55:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-02 00:55:39,151 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 00:55:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1152 states and 1402 transitions. [2018-12-02 00:55:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1402 transitions. [2018-12-02 00:55:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-02 00:55:39,246 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1210 states and 1466 transitions. [2018-12-02 00:55:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1466 transitions. [2018-12-02 00:55:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 00:55:46,037 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:55:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1263 states and 1524 transitions. [2018-12-02 00:55:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1524 transitions. [2018-12-02 00:55:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-02 00:55:48,740 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 184 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 00:55:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1290 states and 1557 transitions. [2018-12-02 00:55:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1557 transitions. [2018-12-02 00:55:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-02 00:55:49,841 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-02 00:55:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1294 states and 1560 transitions. [2018-12-02 00:55:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1560 transitions. [2018-12-02 00:55:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-02 00:55:50,442 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1341 states and 1621 transitions. [2018-12-02 00:55:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1621 transitions. [2018-12-02 00:55:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-02 00:55:57,311 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:55:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:55:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:55:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1369 states and 1653 transitions. [2018-12-02 00:55:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1653 transitions. [2018-12-02 00:55:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-02 00:55:59,250 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:55:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 00:56:03,522 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-12-02 00:56:05,601 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-12-02 00:56:08,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1417 states and 1701 transitions. [2018-12-02 00:56:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1701 transitions. [2018-12-02 00:56:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-02 00:56:08,201 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 00:56:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1422 states and 1710 transitions. [2018-12-02 00:56:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1710 transitions. [2018-12-02 00:56:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-02 00:56:08,759 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:56:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1438 states and 1729 transitions. [2018-12-02 00:56:11,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1729 transitions. [2018-12-02 00:56:11,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-02 00:56:11,950 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:56:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1441 states and 1732 transitions. [2018-12-02 00:56:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1732 transitions. [2018-12-02 00:56:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-02 00:56:12,543 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-02 00:56:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1476 states and 1772 transitions. [2018-12-02 00:56:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1772 transitions. [2018-12-02 00:56:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 00:56:14,040 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 183 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:56:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1498 states and 1799 transitions. [2018-12-02 00:56:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1799 transitions. [2018-12-02 00:56:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 00:56:18,518 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 183 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:56:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1518 states and 1820 transitions. [2018-12-02 00:56:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1820 transitions. [2018-12-02 00:56:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-02 00:56:20,520 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-02 00:56:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1522 states and 1830 transitions. [2018-12-02 00:56:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1830 transitions. [2018-12-02 00:56:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-02 00:56:20,779 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-02 00:56:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1592 states and 1908 transitions. [2018-12-02 00:56:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1908 transitions. [2018-12-02 00:56:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-12-02 00:56:21,747 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-02 00:56:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1595 states and 1912 transitions. [2018-12-02 00:56:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 1912 transitions. [2018-12-02 00:56:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 00:56:22,645 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 00:56:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1622 states and 1942 transitions. [2018-12-02 00:56:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1942 transitions. [2018-12-02 00:56:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 00:56:25,609 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 00:56:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1627 states and 1945 transitions. [2018-12-02 00:56:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 1945 transitions. [2018-12-02 00:56:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-02 00:56:26,894 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 269 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-02 00:56:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 1684 states and 2008 transitions. [2018-12-02 00:56:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2008 transitions. [2018-12-02 00:56:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-02 00:56:28,129 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 269 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-02 00:56:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 1687 states and 2011 transitions. [2018-12-02 00:56:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2011 transitions. [2018-12-02 00:56:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-02 00:56:28,554 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 206 proven. 3 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-02 00:56:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 1723 states and 2048 transitions. [2018-12-02 00:56:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2048 transitions. [2018-12-02 00:56:31,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-02 00:56:31,801 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:56:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 206 proven. 3 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-02 00:56:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 00:56:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 1724 states and 2049 transitions. [2018-12-02 00:56:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2049 transitions. [2018-12-02 00:56:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-02 00:56:32,173 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 00:56:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:56:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:56:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:56:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:56:32,362 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 87 iterations. [2018-12-02 00:56:32,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 12:56:32 ImpRootNode [2018-12-02 00:56:32,470 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-02 00:56:32,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 00:56:32,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 00:56:32,470 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 00:56:32,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:54:54" (3/4) ... [2018-12-02 00:56:32,472 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 00:56:32,566 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9de02dbc-edbd-4e63-b2e2-11f2e493c173/bin-2019/ukojak/witness.graphml [2018-12-02 00:56:32,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 00:56:32,567 INFO L168 Benchmark]: Toolchain (without parser) took 99413.94 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 976.7 MB). Free memory was 946.3 MB in the beginning and 1.2 GB in the end (delta: -261.7 MB). Peak memory consumption was 715.0 MB. Max. memory is 11.5 GB. [2018-12-02 00:56:32,567 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:56:32,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. [2018-12-02 00:56:32,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 00:56:32,568 INFO L168 Benchmark]: Boogie Preprocessor took 32.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 00:56:32,568 INFO L168 Benchmark]: RCFGBuilder took 1010.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 877.9 MB in the end (delta: 212.7 MB). Peak memory consumption was 212.7 MB. Max. memory is 11.5 GB. [2018-12-02 00:56:32,568 INFO L168 Benchmark]: CodeCheck took 97872.67 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 863.5 MB). Free memory was 877.9 MB in the beginning and 1.2 GB in the end (delta: -372.0 MB). Peak memory consumption was 491.5 MB. Max. memory is 11.5 GB. [2018-12-02 00:56:32,568 INFO L168 Benchmark]: Witness Printer took 96.67 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2018-12-02 00:56:32,569 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, 198 locations, 1 error locations. UNSAFE Result, 97.7s OverallTime, 87 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1138655744 SDtfs, 1373988086 SDslu, 2026470400 SDs, 0 SdLazy, -743278750 SolverSat, -1130196112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 181.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87434 GetRequests, 84035 SyntacticMatches, 2343 SemanticMatches, 1056 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786593 ImplicationChecksByTransitivity, 86.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 13090 NumberOfCodeBlocks, 13090 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 12739 ConstructedInterpolants, 0 QuantifiedInterpolants, 10662658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 86 InterpolantComputations, 61 PerfectInterpolantSequences, 10131/10448 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: 401]: 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)) [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] 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] 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)) [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] 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] 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)) [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] 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] 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)) [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] 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] 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)) [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 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=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] [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=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] [L377] COND TRUE ((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5)) [L378] a21 = 1 [L379] a16 = 6 [L380] a7 = 0 [L381] return -1; VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, 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] 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)) [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=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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 FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L400] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1)) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L401] __VERIFIER_error() VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1010.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 877.9 MB in the end (delta: 212.7 MB). Peak memory consumption was 212.7 MB. Max. memory is 11.5 GB. * CodeCheck took 97872.67 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 863.5 MB). Free memory was 877.9 MB in the beginning and 1.2 GB in the end (delta: -372.0 MB). Peak memory consumption was 491.5 MB. Max. memory is 11.5 GB. * Witness Printer took 96.67 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...