./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label59_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_72d803a9-7513-40e4-9142-80c139fb3418/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/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 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:43:10,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:43:10,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:43:10,155 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:43:10,155 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:43:10,156 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:43:10,157 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:43:10,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:43:10,159 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:43:10,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:43:10,160 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:43:10,160 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:43:10,161 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:43:10,162 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:43:10,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:43:10,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:43:10,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:43:10,164 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:43:10,165 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:43:10,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:43:10,167 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:43:10,168 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:43:10,170 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:43:10,170 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:43:10,170 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:43:10,171 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:43:10,171 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:43:10,172 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:43:10,172 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:43:10,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:43:10,173 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:43:10,174 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:43:10,174 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:43:10,174 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:43:10,175 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:43:10,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:43:10,176 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 05:43:10,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:43:10,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:43:10,187 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:43:10,187 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 05:43:10,188 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:43:10,188 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:43:10,188 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:43:10,188 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:43:10,188 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:43:10,188 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:43:10,189 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:43:10,189 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:43:10,189 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:43:10,189 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:43:10,189 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:43:10,189 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:43:10,190 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:43:10,190 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 05:43:10,190 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 05:43:10,190 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:43:10,190 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:43:10,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 05:43:10,191 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:43:10,191 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:43:10,191 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:43:10,191 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 05:43:10,191 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:43:10,191 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:43:10,191 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_72d803a9-7513-40e4-9142-80c139fb3418/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 -> 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 [2018-11-10 05:43:10,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:43:10,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:43:10,228 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:43:10,229 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:43:10,229 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:43:10,229 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c [2018-11-10 05:43:10,265 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/bin-2019/ukojak/data/46416bc07/b6eef8cf0a854ff58647fac18b731935/FLAG13e948bee [2018-11-10 05:43:10,701 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:43:10,701 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c [2018-11-10 05:43:10,710 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/bin-2019/ukojak/data/46416bc07/b6eef8cf0a854ff58647fac18b731935/FLAG13e948bee [2018-11-10 05:43:10,722 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/bin-2019/ukojak/data/46416bc07/b6eef8cf0a854ff58647fac18b731935 [2018-11-10 05:43:10,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:43:10,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:43:10,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:43:10,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:43:10,730 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:43:10,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:43:10" (1/1) ... [2018-11-10 05:43:10,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea6dd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:10, skipping insertion in model container [2018-11-10 05:43:10,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:43:10" (1/1) ... [2018-11-10 05:43:10,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:43:10,776 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:43:11,002 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:43:11,005 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:43:11,071 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:43:11,083 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:43:11,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:11 WrapperNode [2018-11-10 05:43:11,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:43:11,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:43:11,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:43:11,085 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:43:11,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:11" (1/1) ... [2018-11-10 05:43:11,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:11" (1/1) ... [2018-11-10 05:43:11,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:43:11,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:43:11,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:43:11,201 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:43:11,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:11" (1/1) ... [2018-11-10 05:43:11,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:11" (1/1) ... [2018-11-10 05:43:11,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:11" (1/1) ... [2018-11-10 05:43:11,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:11" (1/1) ... [2018-11-10 05:43:11,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:11" (1/1) ... [2018-11-10 05:43:11,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:11" (1/1) ... [2018-11-10 05:43:11,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:11" (1/1) ... [2018-11-10 05:43:11,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:43:11,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:43:11,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:43:11,243 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:43:11,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/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 05:43:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 05:43:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:43:11,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:43:12,597 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:43:12,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:43:12 BoogieIcfgContainer [2018-11-10 05:43:12,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:43:12,598 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 05:43:12,598 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 05:43:12,605 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 05:43:12,605 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:43:12" (1/1) ... [2018-11-10 05:43:12,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-11-10 05:43:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-11-10 05:43:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 05:43:12,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:12,892 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 05:43:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 165 states and 278 transitions. [2018-11-10 05:43:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 278 transitions. [2018-11-10 05:43:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 05:43:13,260 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 245 states and 362 transitions. [2018-11-10 05:43:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 362 transitions. [2018-11-10 05:43:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 05:43:13,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 250 states and 369 transitions. [2018-11-10 05:43:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2018-11-10 05:43:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 05:43:14,034 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 330 states and 452 transitions. [2018-11-10 05:43:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 452 transitions. [2018-11-10 05:43:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 05:43:14,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:14,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 358 states and 485 transitions. [2018-11-10 05:43:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 485 transitions. [2018-11-10 05:43:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 05:43:14,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:14,918 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 05:43:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 436 states and 570 transitions. [2018-11-10 05:43:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 570 transitions. [2018-11-10 05:43:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 05:43:15,560 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 460 states and 595 transitions. [2018-11-10 05:43:15,732 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 595 transitions. [2018-11-10 05:43:15,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 05:43:15,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 464 states and 599 transitions. [2018-11-10 05:43:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 599 transitions. [2018-11-10 05:43:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 05:43:15,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 497 states and 640 transitions. [2018-11-10 05:43:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 640 transitions. [2018-11-10 05:43:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 05:43:16,292 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:43:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 502 states and 646 transitions. [2018-11-10 05:43:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 646 transitions. [2018-11-10 05:43:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 05:43:16,491 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 539 states and 693 transitions. [2018-11-10 05:43:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 693 transitions. [2018-11-10 05:43:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 05:43:17,153 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:43:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 544 states and 699 transitions. [2018-11-10 05:43:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 699 transitions. [2018-11-10 05:43:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 05:43:17,415 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 549 states and 704 transitions. [2018-11-10 05:43:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 704 transitions. [2018-11-10 05:43:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 05:43:17,474 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:43:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 561 states and 723 transitions. [2018-11-10 05:43:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 723 transitions. [2018-11-10 05:43:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 05:43:18,021 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 581 states and 746 transitions. [2018-11-10 05:43:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 746 transitions. [2018-11-10 05:43:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 05:43:18,326 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 582 states and 747 transitions. [2018-11-10 05:43:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 747 transitions. [2018-11-10 05:43:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 05:43:18,378 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:43:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 596 states and 762 transitions. [2018-11-10 05:43:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 762 transitions. [2018-11-10 05:43:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 05:43:18,707 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 646 states and 817 transitions. [2018-11-10 05:43:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 817 transitions. [2018-11-10 05:43:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 05:43:19,445 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 05:43:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 650 states and 823 transitions. [2018-11-10 05:43:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 823 transitions. [2018-11-10 05:43:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 05:43:19,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:19,703 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 05:43:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 679 states and 855 transitions. [2018-11-10 05:43:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 855 transitions. [2018-11-10 05:43:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 05:43:19,997 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:20,049 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 05:43:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 693 states and 869 transitions. [2018-11-10 05:43:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 869 transitions. [2018-11-10 05:43:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 05:43:20,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:20,421 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 05:43:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 723 states and 901 transitions. [2018-11-10 05:43:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 901 transitions. [2018-11-10 05:43:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 05:43:21,198 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 790 states and 976 transitions. [2018-11-10 05:43:22,426 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 976 transitions. [2018-11-10 05:43:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 05:43:22,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 05:43:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 796 states and 983 transitions. [2018-11-10 05:43:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 983 transitions. [2018-11-10 05:43:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 05:43:22,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:22,747 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 05:43:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 845 states and 1036 transitions. [2018-11-10 05:43:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1036 transitions. [2018-11-10 05:43:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 05:43:23,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:23,511 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 05:43:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 849 states and 1040 transitions. [2018-11-10 05:43:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1040 transitions. [2018-11-10 05:43:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 05:43:23,647 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 869 states and 1063 transitions. [2018-11-10 05:43:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1063 transitions. [2018-11-10 05:43:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 05:43:24,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 05:43:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 870 states and 1072 transitions. [2018-11-10 05:43:24,399 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1072 transitions. [2018-11-10 05:43:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 05:43:24,400 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 05:43:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 889 states and 1094 transitions. [2018-11-10 05:43:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1094 transitions. [2018-11-10 05:43:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 05:43:24,688 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 903 states and 1109 transitions. [2018-11-10 05:43:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1109 transitions. [2018-11-10 05:43:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 05:43:25,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 907 states and 1116 transitions. [2018-11-10 05:43:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1116 transitions. [2018-11-10 05:43:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 05:43:25,253 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 908 states and 1118 transitions. [2018-11-10 05:43:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1118 transitions. [2018-11-10 05:43:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 05:43:25,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 909 states and 1119 transitions. [2018-11-10 05:43:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1119 transitions. [2018-11-10 05:43:25,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 05:43:25,490 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:43:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 930 states and 1140 transitions. [2018-11-10 05:43:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1140 transitions. [2018-11-10 05:43:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 05:43:25,592 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 05:43:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 931 states and 1142 transitions. [2018-11-10 05:43:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1142 transitions. [2018-11-10 05:43:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 05:43:25,665 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-10 05:43:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 938 states and 1155 transitions. [2018-11-10 05:43:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1155 transitions. [2018-11-10 05:43:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 05:43:26,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:43:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 962 states and 1181 transitions. [2018-11-10 05:43:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1181 transitions. [2018-11-10 05:43:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 05:43:26,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-10 05:43:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 966 states and 1188 transitions. [2018-11-10 05:43:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1188 transitions. [2018-11-10 05:43:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 05:43:26,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-10 05:43:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 981 states and 1204 transitions. [2018-11-10 05:43:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1204 transitions. [2018-11-10 05:43:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 05:43:26,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 994 states and 1219 transitions. [2018-11-10 05:43:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1219 transitions. [2018-11-10 05:43:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 05:43:27,100 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 998 states and 1223 transitions. [2018-11-10 05:43:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1223 transitions. [2018-11-10 05:43:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 05:43:27,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 999 states and 1223 transitions. [2018-11-10 05:43:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1223 transitions. [2018-11-10 05:43:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 05:43:27,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:43:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1086 states and 1315 transitions. [2018-11-10 05:43:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1315 transitions. [2018-11-10 05:43:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 05:43:29,691 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 05:43:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1113 states and 1343 transitions. [2018-11-10 05:43:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1343 transitions. [2018-11-10 05:43:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 05:43:30,144 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:43:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1114 states and 1344 transitions. [2018-11-10 05:43:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1344 transitions. [2018-11-10 05:43:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 05:43:30,340 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:43:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1118 states and 1348 transitions. [2018-11-10 05:43:30,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1348 transitions. [2018-11-10 05:43:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 05:43:30,487 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1136 states and 1367 transitions. [2018-11-10 05:43:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1367 transitions. [2018-11-10 05:43:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 05:43:30,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1140 states and 1370 transitions. [2018-11-10 05:43:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1370 transitions. [2018-11-10 05:43:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 05:43:31,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 05:43:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1160 states and 1393 transitions. [2018-11-10 05:43:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1393 transitions. [2018-11-10 05:43:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 05:43:31,721 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 05:43:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1185 states and 1420 transitions. [2018-11-10 05:43:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1420 transitions. [2018-11-10 05:43:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 05:43:32,209 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 171 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 05:43:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1196 states and 1435 transitions. [2018-11-10 05:43:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1435 transitions. [2018-11-10 05:43:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 05:43:33,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1213 states and 1457 transitions. [2018-11-10 05:43:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1457 transitions. [2018-11-10 05:43:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 05:43:33,955 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1217 states and 1462 transitions. [2018-11-10 05:43:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1462 transitions. [2018-11-10 05:43:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 05:43:34,188 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 05:43:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1236 states and 1482 transitions. [2018-11-10 05:43:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1482 transitions. [2018-11-10 05:43:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 05:43:34,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 05:43:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1248 states and 1493 transitions. [2018-11-10 05:43:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1493 transitions. [2018-11-10 05:43:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 05:43:35,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-11-10 05:43:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1249 states and 1493 transitions. [2018-11-10 05:43:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1493 transitions. [2018-11-10 05:43:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 05:43:35,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 05:43:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1255 states and 1500 transitions. [2018-11-10 05:43:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1500 transitions. [2018-11-10 05:43:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 05:43:35,382 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 05:43:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1288 states and 1533 transitions. [2018-11-10 05:43:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1533 transitions. [2018-11-10 05:43:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 05:43:35,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 05:43:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1388 states and 1634 transitions. [2018-11-10 05:43:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1634 transitions. [2018-11-10 05:43:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 05:43:38,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1426 states and 1673 transitions. [2018-11-10 05:43:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1673 transitions. [2018-11-10 05:43:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 05:43:39,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1430 states and 1677 transitions. [2018-11-10 05:43:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1677 transitions. [2018-11-10 05:43:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 05:43:39,471 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:43:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1459 states and 1709 transitions. [2018-11-10 05:43:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1709 transitions. [2018-11-10 05:43:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 05:43:40,297 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-10 05:43:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1493 states and 1744 transitions. [2018-11-10 05:43:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1744 transitions. [2018-11-10 05:43:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 05:43:40,548 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 05:43:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1503 states and 1756 transitions. [2018-11-10 05:43:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1756 transitions. [2018-11-10 05:43:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 05:43:41,074 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:41,121 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 05:43:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1505 states and 1759 transitions. [2018-11-10 05:43:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1759 transitions. [2018-11-10 05:43:41,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-10 05:43:41,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:43:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1605 states and 1861 transitions. [2018-11-10 05:43:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1861 transitions. [2018-11-10 05:43:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-10 05:43:46,596 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 05:43:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1649 states and 1911 transitions. [2018-11-10 05:43:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1911 transitions. [2018-11-10 05:43:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-10 05:43:47,819 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 05:43:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1668 states and 1930 transitions. [2018-11-10 05:43:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1930 transitions. [2018-11-10 05:43:48,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-10 05:43:48,764 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 05:43:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1671 states and 1932 transitions. [2018-11-10 05:43:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1932 transitions. [2018-11-10 05:43:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 05:43:48,899 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 05:43:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1685 states and 1948 transitions. [2018-11-10 05:43:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1948 transitions. [2018-11-10 05:43:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 05:43:49,659 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 05:43:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1689 states and 1952 transitions. [2018-11-10 05:43:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 1952 transitions. [2018-11-10 05:43:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 05:43:49,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 05:43:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1693 states and 1956 transitions. [2018-11-10 05:43:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 1956 transitions. [2018-11-10 05:43:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 05:43:50,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 05:43:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1694 states and 1956 transitions. [2018-11-10 05:43:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 1956 transitions. [2018-11-10 05:43:50,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 05:43:50,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 05:43:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1718 states and 1981 transitions. [2018-11-10 05:43:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 1981 transitions. [2018-11-10 05:43:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 05:43:50,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 05:43:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1733 states and 1996 transitions. [2018-11-10 05:43:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 1996 transitions. [2018-11-10 05:43:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 05:43:51,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 05:43:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1740 states and 2003 transitions. [2018-11-10 05:43:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2003 transitions. [2018-11-10 05:43:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-10 05:43:51,252 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 1741 states and 2007 transitions. [2018-11-10 05:43:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2007 transitions. [2018-11-10 05:43:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-10 05:43:51,562 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 1745 states and 2012 transitions. [2018-11-10 05:43:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2012 transitions. [2018-11-10 05:43:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-10 05:43:51,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 05:43:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 1838 states and 2106 transitions. [2018-11-10 05:43:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2106 transitions. [2018-11-10 05:43:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 05:43:56,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 221 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 1888 states and 2163 transitions. [2018-11-10 05:43:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2163 transitions. [2018-11-10 05:43:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-10 05:43:58,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 05:43:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 1894 states and 2168 transitions. [2018-11-10 05:43:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2168 transitions. [2018-11-10 05:43:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-10 05:43:59,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 138 proven. 5 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-10 05:44:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 1918 states and 2195 transitions. [2018-11-10 05:44:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2195 transitions. [2018-11-10 05:44:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-10 05:44:00,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 138 proven. 5 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-10 05:44:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 1951 states and 2233 transitions. [2018-11-10 05:44:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2233 transitions. [2018-11-10 05:44:00,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-10 05:44:00,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 138 proven. 5 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-10 05:44:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 1957 states and 2237 transitions. [2018-11-10 05:44:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 2237 transitions. [2018-11-10 05:44:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-10 05:44:01,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 05:44:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:02,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 1992 states and 2278 transitions. [2018-11-10 05:44:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2278 transitions. [2018-11-10 05:44:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-10 05:44:02,279 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 05:44:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2050 states and 2336 transitions. [2018-11-10 05:44:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2336 transitions. [2018-11-10 05:44:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-10 05:44:04,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 05:44:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2017 states and 2302 transitions. [2018-11-10 05:44:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2302 transitions. [2018-11-10 05:44:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-10 05:44:04,805 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-10 05:44:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2021 states and 2306 transitions. [2018-11-10 05:44:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2306 transitions. [2018-11-10 05:44:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-10 05:44:05,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:44:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:44:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:44:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:44:05,265 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 89 iterations. [2018-11-10 05:44:05,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 05:44:05 ImpRootNode [2018-11-10 05:44:05,399 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 05:44:05,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:44:05,399 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:44:05,400 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:44:05,401 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:43:12" (3/4) ... [2018-11-10 05:44:05,404 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 05:44:05,513 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_72d803a9-7513-40e4-9142-80c139fb3418/bin-2019/ukojak/witness.graphml [2018-11-10 05:44:05,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:44:05,514 INFO L168 Benchmark]: Toolchain (without parser) took 54788.56 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 952.2 MB in the beginning and 732.7 MB in the end (delta: 219.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-10 05:44:05,515 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:44:05,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.12 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 922.6 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:44:05,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 922.6 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:44:05,515 INFO L168 Benchmark]: Boogie Preprocessor took 41.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:44:05,516 INFO L168 Benchmark]: RCFGBuilder took 1354.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 819.8 MB in the end (delta: 252.7 MB). Peak memory consumption was 252.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:44:05,516 INFO L168 Benchmark]: CodeCheck took 52801.14 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 819.8 MB in the beginning and 764.1 MB in the end (delta: 55.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-10 05:44:05,516 INFO L168 Benchmark]: Witness Printer took 114.11 ms. Allocated memory is still 2.4 GB. Free memory was 764.1 MB in the beginning and 732.7 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:44:05,518 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, 228 locations, 1 error locations. UNSAFE Result, 52.6s OverallTime, 89 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1308353084 SDtfs, 2075902110 SDslu, -300066596 SDs, 0 SdLazy, -799786534 SolverSat, 1633864188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 246.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100165 GetRequests, 98439 SyntacticMatches, 906 SemanticMatches, 820 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485138 ImplicationChecksByTransitivity, 41.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 15385 NumberOfCodeBlocks, 15385 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 15065 ConstructedInterpolants, 0 QuantifiedInterpolants, 8380382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 88 InterpolantComputations, 75 PerfectInterpolantSequences, 11556/11636 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: 421]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] RET return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] RET return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND TRUE ((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))) [L155] a25 = 1 [L156] a19 = 1 [L157] a28 = 7 [L158] RET return -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L420] COND TRUE ((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L421] __VERIFIER_error() VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.12 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 922.6 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 922.6 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1354.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 819.8 MB in the end (delta: 252.7 MB). Peak memory consumption was 252.7 MB. Max. memory is 11.5 GB. * CodeCheck took 52801.14 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 819.8 MB in the beginning and 764.1 MB in the end (delta: 55.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 114.11 ms. Allocated memory is still 2.4 GB. Free memory was 764.1 MB in the beginning and 732.7 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...