./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/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_e1e1f53e-b99f-467d-bdcf-522e93f81856/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/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-1dbac8b [2018-11-10 04:16:23,295 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:16:23,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:16:23,303 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:16:23,304 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:16:23,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:16:23,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:16:23,307 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:16:23,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:16:23,309 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:16:23,309 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:16:23,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:16:23,310 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:16:23,311 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:16:23,312 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:16:23,313 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:16:23,314 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:16:23,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:16:23,316 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:16:23,317 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:16:23,318 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:16:23,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:16:23,321 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:16:23,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:16:23,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:16:23,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:16:23,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:16:23,325 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:16:23,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:16:23,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:16:23,327 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:16:23,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:16:23,327 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:16:23,327 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:16:23,328 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:16:23,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:16:23,329 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 04:16:23,338 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:16:23,338 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:16:23,339 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:16:23,339 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:16:23,339 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:16:23,340 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:16:23,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:16:23,340 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:16:23,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:16:23,341 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:16:23,341 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:16:23,341 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:16:23,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:16:23,342 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:16:23,342 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:16:23,342 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:16:23,342 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:16:23,342 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 04:16:23,342 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 04:16:23,342 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:16:23,343 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:16:23,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:16:23,343 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:16:23,343 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:16:23,343 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:16:23,343 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 04:16:23,343 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:16:23,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:16:23,344 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_e1e1f53e-b99f-467d-bdcf-522e93f81856/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-11-10 04:16:23,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:16:23,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:16:23,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:16:23,381 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:16:23,382 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:16:23,382 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c [2018-11-10 04:16:23,419 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/bin-2019/ukojak/data/46c163ce6/744dbcd8aa1646c7914064e7b4e4ac0d/FLAGbd2adf261 [2018-11-10 04:16:23,800 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:16:23,800 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/sv-benchmarks/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c [2018-11-10 04:16:23,809 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/bin-2019/ukojak/data/46c163ce6/744dbcd8aa1646c7914064e7b4e4ac0d/FLAGbd2adf261 [2018-11-10 04:16:23,822 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/bin-2019/ukojak/data/46c163ce6/744dbcd8aa1646c7914064e7b4e4ac0d [2018-11-10 04:16:23,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:16:23,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:16:23,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:16:23,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:16:23,829 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:16:23,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:16:23" (1/1) ... [2018-11-10 04:16:23,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae6657b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:16:23, skipping insertion in model container [2018-11-10 04:16:23,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:16:23" (1/1) ... [2018-11-10 04:16:23,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:16:23,873 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:16:24,104 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:16:24,107 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:16:24,172 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:16:24,183 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:16:24,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:16:24 WrapperNode [2018-11-10 04:16:24,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:16:24,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:16:24,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:16:24,184 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:16:24,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:16:24" (1/1) ... [2018-11-10 04:16:24,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:16:24" (1/1) ... [2018-11-10 04:16:24,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:16:24,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:16:24,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:16:24,289 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:16:24,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:16:24" (1/1) ... [2018-11-10 04:16:24,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:16:24" (1/1) ... [2018-11-10 04:16:24,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:16:24" (1/1) ... [2018-11-10 04:16:24,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:16:24" (1/1) ... [2018-11-10 04:16:24,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:16:24" (1/1) ... [2018-11-10 04:16:24,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:16:24" (1/1) ... [2018-11-10 04:16:24,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:16:24" (1/1) ... [2018-11-10 04:16:24,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:16:24,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:16:24,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:16:24,331 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:16:24,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:16:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:16:24,384 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 04:16:24,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:16:24,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:16:26,110 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:16:26,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:16:26 BoogieIcfgContainer [2018-11-10 04:16:26,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:16:26,112 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 04:16:26,112 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 04:16:26,121 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 04:16:26,121 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:16:26" (1/1) ... [2018-11-10 04:16:26,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:16:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-10 04:16:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-10 04:16:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 04:16:26,165 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 147 states and 222 transitions. [2018-11-10 04:16:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2018-11-10 04:16:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:16:26,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:16:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 148 states and 223 transitions. [2018-11-10 04:16:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2018-11-10 04:16:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 04:16:27,020 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 154 states and 233 transitions. [2018-11-10 04:16:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 233 transitions. [2018-11-10 04:16:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:16:27,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 225 states and 320 transitions. [2018-11-10 04:16:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 320 transitions. [2018-11-10 04:16:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:16:27,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 236 states and 338 transitions. [2018-11-10 04:16:28,049 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 338 transitions. [2018-11-10 04:16:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 04:16:28,054 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 248 states and 356 transitions. [2018-11-10 04:16:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 356 transitions. [2018-11-10 04:16:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 04:16:28,624 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 252 states and 360 transitions. [2018-11-10 04:16:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 360 transitions. [2018-11-10 04:16:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 04:16:28,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 254 states and 361 transitions. [2018-11-10 04:16:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 361 transitions. [2018-11-10 04:16:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 04:16:28,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 04:16:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 266 states and 376 transitions. [2018-11-10 04:16:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 376 transitions. [2018-11-10 04:16:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 04:16:29,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:16:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 272 states and 382 transitions. [2018-11-10 04:16:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 382 transitions. [2018-11-10 04:16:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 04:16:29,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 04:16:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 280 states and 391 transitions. [2018-11-10 04:16:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 391 transitions. [2018-11-10 04:16:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 04:16:29,670 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:16:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 285 states and 397 transitions. [2018-11-10 04:16:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 397 transitions. [2018-11-10 04:16:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 04:16:30,136 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 304 states and 419 transitions. [2018-11-10 04:16:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 419 transitions. [2018-11-10 04:16:30,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 04:16:30,516 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:16:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 310 states and 430 transitions. [2018-11-10 04:16:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 430 transitions. [2018-11-10 04:16:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 04:16:31,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:16:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 311 states and 430 transitions. [2018-11-10 04:16:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 430 transitions. [2018-11-10 04:16:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 04:16:31,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:16:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 342 states and 466 transitions. [2018-11-10 04:16:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 466 transitions. [2018-11-10 04:16:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 04:16:32,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 358 states and 484 transitions. [2018-11-10 04:16:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 484 transitions. [2018-11-10 04:16:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 04:16:32,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:16:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 372 states and 499 transitions. [2018-11-10 04:16:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 499 transitions. [2018-11-10 04:16:33,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 04:16:33,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:16:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 375 states and 503 transitions. [2018-11-10 04:16:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 503 transitions. [2018-11-10 04:16:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 04:16:33,488 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:16:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 389 states and 519 transitions. [2018-11-10 04:16:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 519 transitions. [2018-11-10 04:16:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 04:16:34,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:16:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 401 states and 539 transitions. [2018-11-10 04:16:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 539 transitions. [2018-11-10 04:16:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 04:16:34,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:16:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 407 states and 547 transitions. [2018-11-10 04:16:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 547 transitions. [2018-11-10 04:16:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 04:16:35,204 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:16:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 417 states and 563 transitions. [2018-11-10 04:16:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 563 transitions. [2018-11-10 04:16:36,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 04:16:36,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:16:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 431 states and 579 transitions. [2018-11-10 04:16:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 579 transitions. [2018-11-10 04:16:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 04:16:36,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 04:16:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 440 states and 588 transitions. [2018-11-10 04:16:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 588 transitions. [2018-11-10 04:16:36,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 04:16:36,955 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 04:16:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 442 states and 590 transitions. [2018-11-10 04:16:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 590 transitions. [2018-11-10 04:16:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 04:16:37,018 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 82 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 491 states and 653 transitions. [2018-11-10 04:16:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 653 transitions. [2018-11-10 04:16:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 04:16:39,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:16:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 532 states and 697 transitions. [2018-11-10 04:16:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 697 transitions. [2018-11-10 04:16:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 04:16:40,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:16:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 554 states and 723 transitions. [2018-11-10 04:16:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 723 transitions. [2018-11-10 04:16:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 04:16:40,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:16:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 556 states and 726 transitions. [2018-11-10 04:16:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 726 transitions. [2018-11-10 04:16:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 04:16:40,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:16:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 573 states and 745 transitions. [2018-11-10 04:16:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 745 transitions. [2018-11-10 04:16:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 04:16:41,551 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 04:16:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 580 states and 753 transitions. [2018-11-10 04:16:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 753 transitions. [2018-11-10 04:16:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 04:16:41,723 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 613 states and 794 transitions. [2018-11-10 04:16:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 794 transitions. [2018-11-10 04:16:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 04:16:43,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 619 states and 801 transitions. [2018-11-10 04:16:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 801 transitions. [2018-11-10 04:16:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 04:16:43,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 684 states and 868 transitions. [2018-11-10 04:16:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 868 transitions. [2018-11-10 04:16:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 04:16:45,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 04:16:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 698 states and 881 transitions. [2018-11-10 04:16:45,723 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 881 transitions. [2018-11-10 04:16:45,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 04:16:45,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 04:16:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 712 states and 895 transitions. [2018-11-10 04:16:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 895 transitions. [2018-11-10 04:16:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 04:16:45,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:16:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 715 states and 898 transitions. [2018-11-10 04:16:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 898 transitions. [2018-11-10 04:16:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 04:16:46,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-10 04:16:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 719 states and 901 transitions. [2018-11-10 04:16:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 901 transitions. [2018-11-10 04:16:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 04:16:46,351 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 758 states and 952 transitions. [2018-11-10 04:16:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 952 transitions. [2018-11-10 04:16:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 04:16:48,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:48,563 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 789 states and 982 transitions. [2018-11-10 04:16:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 982 transitions. [2018-11-10 04:16:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 04:16:49,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 04:16:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 807 states and 1000 transitions. [2018-11-10 04:16:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1000 transitions. [2018-11-10 04:16:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 04:16:49,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 04:16:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 809 states and 1002 transitions. [2018-11-10 04:16:49,176 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1002 transitions. [2018-11-10 04:16:49,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 04:16:49,177 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:16:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 810 states and 1004 transitions. [2018-11-10 04:16:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1004 transitions. [2018-11-10 04:16:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 04:16:49,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 04:16:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 816 states and 1011 transitions. [2018-11-10 04:16:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1011 transitions. [2018-11-10 04:16:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 04:16:49,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 04:16:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 817 states and 1011 transitions. [2018-11-10 04:16:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1011 transitions. [2018-11-10 04:16:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 04:16:49,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 04:16:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 831 states and 1028 transitions. [2018-11-10 04:16:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1028 transitions. [2018-11-10 04:16:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 04:16:50,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 04:16:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 837 states and 1033 transitions. [2018-11-10 04:16:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1033 transitions. [2018-11-10 04:16:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 04:16:50,416 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 04:16:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 857 states and 1056 transitions. [2018-11-10 04:16:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1056 transitions. [2018-11-10 04:16:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 04:16:50,848 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 04:16:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 864 states and 1064 transitions. [2018-11-10 04:16:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1064 transitions. [2018-11-10 04:16:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 04:16:51,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 04:16:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 868 states and 1069 transitions. [2018-11-10 04:16:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1069 transitions. [2018-11-10 04:16:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 04:16:51,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 150 proven. 11 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 04:16:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 885 states and 1089 transitions. [2018-11-10 04:16:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1089 transitions. [2018-11-10 04:16:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-10 04:16:52,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 226 proven. 10 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-10 04:16:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 899 states and 1108 transitions. [2018-11-10 04:16:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1108 transitions. [2018-11-10 04:16:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-10 04:16:54,580 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-10 04:16:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 901 states and 1110 transitions. [2018-11-10 04:16:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1110 transitions. [2018-11-10 04:16:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-10 04:16:54,843 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 165 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 04:16:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 971 states and 1186 transitions. [2018-11-10 04:16:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1186 transitions. [2018-11-10 04:16:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 04:16:56,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-10 04:16:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 984 states and 1201 transitions. [2018-11-10 04:16:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1201 transitions. [2018-11-10 04:16:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-10 04:16:56,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-10 04:16:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 987 states and 1204 transitions. [2018-11-10 04:16:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1204 transitions. [2018-11-10 04:16:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 04:16:57,088 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 185 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-10 04:16:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1018 states and 1238 transitions. [2018-11-10 04:16:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1238 transitions. [2018-11-10 04:16:57,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 04:16:57,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 185 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-10 04:16:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:16:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1026 states and 1244 transitions. [2018-11-10 04:16:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1244 transitions. [2018-11-10 04:16:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-10 04:16:57,939 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:16:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:16:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 215 proven. 1 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:17:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1057 states and 1283 transitions. [2018-11-10 04:17:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1283 transitions. [2018-11-10 04:17:00,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-10 04:17:00,135 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 342 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 04:17:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1075 states and 1303 transitions. [2018-11-10 04:17:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1303 transitions. [2018-11-10 04:17:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-10 04:17:01,368 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 342 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 04:17:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1079 states and 1307 transitions. [2018-11-10 04:17:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1307 transitions. [2018-11-10 04:17:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-10 04:17:01,727 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-10 04:17:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1111 states and 1350 transitions. [2018-11-10 04:17:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1350 transitions. [2018-11-10 04:17:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-10 04:17:03,763 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-10 04:17:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1127 states and 1370 transitions. [2018-11-10 04:17:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1370 transitions. [2018-11-10 04:17:04,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 04:17:04,810 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:17:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1143 states and 1394 transitions. [2018-11-10 04:17:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1394 transitions. [2018-11-10 04:17:06,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 04:17:06,120 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:17:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1153 states and 1405 transitions. [2018-11-10 04:17:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1405 transitions. [2018-11-10 04:17:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-10 04:17:06,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-10 04:17:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1186 states and 1444 transitions. [2018-11-10 04:17:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1444 transitions. [2018-11-10 04:17:08,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-10 04:17:08,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-10 04:17:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1202 states and 1464 transitions. [2018-11-10 04:17:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1464 transitions. [2018-11-10 04:17:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-10 04:17:09,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-10 04:17:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1216 states and 1477 transitions. [2018-11-10 04:17:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1477 transitions. [2018-11-10 04:17:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-10 04:17:09,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 324 proven. 20 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-10 04:17:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1261 states and 1532 transitions. [2018-11-10 04:17:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1532 transitions. [2018-11-10 04:17:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-10 04:17:14,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 324 proven. 20 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-10 04:17:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1275 states and 1545 transitions. [2018-11-10 04:17:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1545 transitions. [2018-11-10 04:17:15,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-10 04:17:15,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-10 04:17:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1282 states and 1551 transitions. [2018-11-10 04:17:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1551 transitions. [2018-11-10 04:17:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-10 04:17:15,731 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-10 04:17:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1284 states and 1553 transitions. [2018-11-10 04:17:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1553 transitions. [2018-11-10 04:17:16,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-10 04:17:16,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-10 04:17:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1332 states and 1601 transitions. [2018-11-10 04:17:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1601 transitions. [2018-11-10 04:17:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 04:17:19,425 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 342 proven. 21 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-10 04:17:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1340 states and 1613 transitions. [2018-11-10 04:17:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1613 transitions. [2018-11-10 04:17:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 04:17:21,098 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 342 proven. 21 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-10 04:17:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1348 states and 1624 transitions. [2018-11-10 04:17:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1624 transitions. [2018-11-10 04:17:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-10 04:17:22,279 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 328 proven. 34 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-10 04:17:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1376 states and 1656 transitions. [2018-11-10 04:17:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1656 transitions. [2018-11-10 04:17:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-10 04:17:24,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-10 04:17:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1378 states and 1658 transitions. [2018-11-10 04:17:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1658 transitions. [2018-11-10 04:17:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-10 04:17:24,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-11-10 04:17:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1449 states and 1733 transitions. [2018-11-10 04:17:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1733 transitions. [2018-11-10 04:17:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-10 04:17:25,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 04:17:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1495 states and 1781 transitions. [2018-11-10 04:17:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1781 transitions. [2018-11-10 04:17:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-10 04:17:28,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 04:17:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1496 states and 1782 transitions. [2018-11-10 04:17:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1782 transitions. [2018-11-10 04:17:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-10 04:17:29,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 04:17:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1498 states and 1783 transitions. [2018-11-10 04:17:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1783 transitions. [2018-11-10 04:17:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-10 04:17:30,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 403 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 04:17:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1515 states and 1804 transitions. [2018-11-10 04:17:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1804 transitions. [2018-11-10 04:17:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-10 04:17:33,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 403 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 04:17:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1519 states and 1808 transitions. [2018-11-10 04:17:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1808 transitions. [2018-11-10 04:17:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-10 04:17:33,591 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 316 proven. 23 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 04:17:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1524 states and 1815 transitions. [2018-11-10 04:17:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1815 transitions. [2018-11-10 04:17:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-10 04:17:35,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 316 proven. 23 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 04:17:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1528 states and 1819 transitions. [2018-11-10 04:17:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1819 transitions. [2018-11-10 04:17:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-10 04:17:36,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:17:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 04:17:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:17:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1597 states and 1896 transitions. [2018-11-10 04:17:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 1896 transitions. [2018-11-10 04:17:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-10 04:17:38,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:17:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:17:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:17:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:17:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:17:38,409 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 88 iterations. [2018-11-10 04:17:38,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 04:17:38 ImpRootNode [2018-11-10 04:17:38,562 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 04:17:38,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:17:38,563 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:17:38,563 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:17:38,565 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:16:26" (3/4) ... [2018-11-10 04:17:38,567 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 04:17:38,702 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e1e1f53e-b99f-467d-bdcf-522e93f81856/bin-2019/ukojak/witness.graphml [2018-11-10 04:17:38,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:17:38,703 INFO L168 Benchmark]: Toolchain (without parser) took 74878.78 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 951.1 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 617.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:17:38,704 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:17:38,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.49 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 924.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:17:38,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 924.2 MB in the beginning and 1.2 GB in the end (delta: -234.4 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:17:38,705 INFO L168 Benchmark]: Boogie Preprocessor took 41.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:17:38,705 INFO L168 Benchmark]: RCFGBuilder took 1780.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 915.2 MB in the end (delta: 236.8 MB). Peak memory consumption was 236.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:17:38,705 INFO L168 Benchmark]: CodeCheck took 72450.66 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 915.2 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 377.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:17:38,706 INFO L168 Benchmark]: Witness Printer took 139.61 ms. Allocated memory is still 2.7 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:17:38,711 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 199 locations, 1 error locations. UNSAFE Result, 72.2s OverallTime, 88 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1182254020 SDtfs, 1814331494 SDslu, -725470680 SDs, 0 SdLazy, -60607050 SolverSat, 1574864048 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 197.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99581 GetRequests, 96167 SyntacticMatches, 2480 SemanticMatches, 934 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619474 ImplicationChecksByTransitivity, 60.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 15285 NumberOfCodeBlocks, 15285 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 14927 ConstructedInterpolants, 0 QuantifiedInterpolants, 14384045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 87 InterpolantComputations, 64 PerfectInterpolantSequences, 17103/17339 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)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] RET return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND 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] RET 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] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=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 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.49 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 924.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 924.2 MB in the beginning and 1.2 GB in the end (delta: -234.4 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1780.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 915.2 MB in the end (delta: 236.8 MB). Peak memory consumption was 236.8 MB. Max. memory is 11.5 GB. * CodeCheck took 72450.66 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 915.2 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 377.8 MB. Max. memory is 11.5 GB. * Witness Printer took 139.61 ms. Allocated memory is still 2.7 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...