./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label20_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_399130d8-fa71-41ea-9e6e-a0a35209d1ad/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/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 aaa39ce28677c06ea4974c4267a7bbc4385d14ab .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:20:07,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:20:07,982 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:20:07,989 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:20:07,989 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:20:07,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:20:07,991 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:20:07,992 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:20:07,993 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:20:07,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:20:07,994 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:20:07,994 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:20:07,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:20:07,996 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:20:07,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:20:07,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:20:07,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:20:07,999 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:20:08,000 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:20:08,001 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:20:08,002 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:20:08,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:20:08,005 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:20:08,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:20:08,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:20:08,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:20:08,006 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:20:08,007 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:20:08,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:20:08,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:20:08,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:20:08,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:20:08,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:20:08,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:20:08,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:20:08,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:20:08,010 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 04:20:08,018 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:20:08,018 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:20:08,019 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:20:08,019 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:20:08,019 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:20:08,020 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:20:08,020 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:20:08,020 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:20:08,020 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:20:08,020 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:20:08,020 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:20:08,021 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:20:08,021 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:20:08,021 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:20:08,021 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:20:08,021 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:20:08,021 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:20:08,021 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 04:20:08,021 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 04:20:08,022 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:20:08,022 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:20:08,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:20:08,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:20:08,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:20:08,022 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:20:08,022 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 04:20:08,023 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:20:08,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:20:08,023 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_399130d8-fa71-41ea-9e6e-a0a35209d1ad/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 -> aaa39ce28677c06ea4974c4267a7bbc4385d14ab [2018-11-10 04:20:08,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:20:08,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:20:08,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:20:08,056 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:20:08,056 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:20:08,056 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-11-10 04:20:08,095 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/bin-2019/ukojak/data/9d3eaf8b2/a04b0d90109446479863cf2db287c475/FLAGbcda09bd2 [2018-11-10 04:20:08,457 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:20:08,457 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-11-10 04:20:08,466 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/bin-2019/ukojak/data/9d3eaf8b2/a04b0d90109446479863cf2db287c475/FLAGbcda09bd2 [2018-11-10 04:20:08,478 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/bin-2019/ukojak/data/9d3eaf8b2/a04b0d90109446479863cf2db287c475 [2018-11-10 04:20:08,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:20:08,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:20:08,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:20:08,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:20:08,485 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:20:08,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:20:08" (1/1) ... [2018-11-10 04:20:08,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:20:08, skipping insertion in model container [2018-11-10 04:20:08,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:20:08" (1/1) ... [2018-11-10 04:20:08,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:20:08,528 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:20:08,753 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:20:08,756 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:20:08,822 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:20:08,835 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:20:08,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:20:08 WrapperNode [2018-11-10 04:20:08,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:20:08,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:20:08,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:20:08,837 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:20:08,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:20:08" (1/1) ... [2018-11-10 04:20:08,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:20:08" (1/1) ... [2018-11-10 04:20:08,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:20:08,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:20:08,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:20:08,944 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:20:08,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:20:08" (1/1) ... [2018-11-10 04:20:08,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:20:08" (1/1) ... [2018-11-10 04:20:08,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:20:08" (1/1) ... [2018-11-10 04:20:08,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:20:08" (1/1) ... [2018-11-10 04:20:08,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:20:08" (1/1) ... [2018-11-10 04:20:08,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:20:08" (1/1) ... [2018-11-10 04:20:08,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:20:08" (1/1) ... [2018-11-10 04:20:08,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:20:08,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:20:08,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:20:08,987 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:20:08,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:20:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:20:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 04:20:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:20:09,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:20:10,574 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:20:10,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:20:10 BoogieIcfgContainer [2018-11-10 04:20:10,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:20:10,575 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 04:20:10,576 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 04:20:10,583 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 04:20:10,584 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:20:10" (1/1) ... [2018-11-10 04:20:10,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:20:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-10 04:20:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-10 04:20:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 04:20:10,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 147 states and 223 transitions. [2018-11-10 04:20:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 223 transitions. [2018-11-10 04:20:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:20:11,250 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:11,322 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 04:20:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 152 states and 229 transitions. [2018-11-10 04:20:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 229 transitions. [2018-11-10 04:20:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 04:20:11,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 158 states and 240 transitions. [2018-11-10 04:20:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 240 transitions. [2018-11-10 04:20:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:20:11,622 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 04:20:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 236 states and 331 transitions. [2018-11-10 04:20:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 331 transitions. [2018-11-10 04:20:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 04:20:12,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 04:20:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 260 states and 362 transitions. [2018-11-10 04:20:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 362 transitions. [2018-11-10 04:20:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 04:20:12,633 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 04:20:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 271 states and 379 transitions. [2018-11-10 04:20:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 379 transitions. [2018-11-10 04:20:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 04:20:13,150 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 04:20:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 276 states and 384 transitions. [2018-11-10 04:20:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 384 transitions. [2018-11-10 04:20:13,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 04:20:13,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 04:20:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 288 states and 410 transitions. [2018-11-10 04:20:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 410 transitions. [2018-11-10 04:20:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 04:20:13,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 04:20:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 292 states and 417 transitions. [2018-11-10 04:20:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 417 transitions. [2018-11-10 04:20:13,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 04:20:13,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 04:20:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 294 states and 420 transitions. [2018-11-10 04:20:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 420 transitions. [2018-11-10 04:20:14,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 04:20:14,098 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 04:20:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 295 states and 421 transitions. [2018-11-10 04:20:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 421 transitions. [2018-11-10 04:20:14,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 04:20:14,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 04:20:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 301 states and 427 transitions. [2018-11-10 04:20:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 427 transitions. [2018-11-10 04:20:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 04:20:14,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 04:20:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 308 states and 434 transitions. [2018-11-10 04:20:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 434 transitions. [2018-11-10 04:20:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 04:20:14,889 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 04:20:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 312 states and 438 transitions. [2018-11-10 04:20:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 438 transitions. [2018-11-10 04:20:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 04:20:15,038 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 04:20:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 318 states and 444 transitions. [2018-11-10 04:20:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 444 transitions. [2018-11-10 04:20:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 04:20:15,106 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 320 states and 447 transitions. [2018-11-10 04:20:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 447 transitions. [2018-11-10 04:20:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 04:20:15,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 326 states and 457 transitions. [2018-11-10 04:20:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 457 transitions. [2018-11-10 04:20:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 04:20:15,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 329 states and 460 transitions. [2018-11-10 04:20:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 460 transitions. [2018-11-10 04:20:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 04:20:16,286 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 332 states and 463 transitions. [2018-11-10 04:20:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 463 transitions. [2018-11-10 04:20:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 04:20:16,489 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 336 states and 469 transitions. [2018-11-10 04:20:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 469 transitions. [2018-11-10 04:20:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 04:20:16,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 341 states and 474 transitions. [2018-11-10 04:20:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 474 transitions. [2018-11-10 04:20:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 04:20:17,128 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 04:20:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 353 states and 490 transitions. [2018-11-10 04:20:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 490 transitions. [2018-11-10 04:20:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 04:20:17,791 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 04:20:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 357 states and 494 transitions. [2018-11-10 04:20:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 494 transitions. [2018-11-10 04:20:17,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 04:20:17,935 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 363 states and 504 transitions. [2018-11-10 04:20:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 504 transitions. [2018-11-10 04:20:18,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 04:20:18,644 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 364 states and 504 transitions. [2018-11-10 04:20:18,822 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 504 transitions. [2018-11-10 04:20:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 04:20:18,823 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 04:20:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 378 states and 518 transitions. [2018-11-10 04:20:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 518 transitions. [2018-11-10 04:20:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 04:20:18,889 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 424 states and 568 transitions. [2018-11-10 04:20:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 568 transitions. [2018-11-10 04:20:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 04:20:19,371 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 433 states and 578 transitions. [2018-11-10 04:20:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 578 transitions. [2018-11-10 04:20:19,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 04:20:19,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 04:20:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 440 states and 586 transitions. [2018-11-10 04:20:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 586 transitions. [2018-11-10 04:20:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 04:20:19,521 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 454 states and 602 transitions. [2018-11-10 04:20:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 602 transitions. [2018-11-10 04:20:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 04:20:19,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 457 states and 605 transitions. [2018-11-10 04:20:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 605 transitions. [2018-11-10 04:20:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 04:20:19,992 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 471 states and 621 transitions. [2018-11-10 04:20:20,858 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 621 transitions. [2018-11-10 04:20:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 04:20:20,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 04:20:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:21,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 476 states and 632 transitions. [2018-11-10 04:20:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 632 transitions. [2018-11-10 04:20:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 04:20:21,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 04:20:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 482 states and 642 transitions. [2018-11-10 04:20:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 642 transitions. [2018-11-10 04:20:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 04:20:21,597 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 04:20:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 486 states and 649 transitions. [2018-11-10 04:20:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 649 transitions. [2018-11-10 04:20:21,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 04:20:21,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 551 states and 716 transitions. [2018-11-10 04:20:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 716 transitions. [2018-11-10 04:20:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 04:20:23,219 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 04:20:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 552 states and 716 transitions. [2018-11-10 04:20:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 716 transitions. [2018-11-10 04:20:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 04:20:23,326 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 621 states and 799 transitions. [2018-11-10 04:20:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 799 transitions. [2018-11-10 04:20:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 04:20:25,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 626 states and 804 transitions. [2018-11-10 04:20:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 804 transitions. [2018-11-10 04:20:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 04:20:26,081 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 696 states and 879 transitions. [2018-11-10 04:20:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 879 transitions. [2018-11-10 04:20:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 04:20:26,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-10 04:20:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 697 states and 879 transitions. [2018-11-10 04:20:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 879 transitions. [2018-11-10 04:20:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 04:20:27,002 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 115 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 04:20:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 705 states and 892 transitions. [2018-11-10 04:20:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 892 transitions. [2018-11-10 04:20:27,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 04:20:27,695 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 115 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 04:20:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 709 states and 897 transitions. [2018-11-10 04:20:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 897 transitions. [2018-11-10 04:20:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-10 04:20:27,914 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 04:20:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 722 states and 915 transitions. [2018-11-10 04:20:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 915 transitions. [2018-11-10 04:20:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 04:20:28,359 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:20:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 724 states and 917 transitions. [2018-11-10 04:20:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 917 transitions. [2018-11-10 04:20:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 04:20:28,419 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 04:20:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 733 states and 929 transitions. [2018-11-10 04:20:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 929 transitions. [2018-11-10 04:20:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 04:20:29,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 04:20:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 737 states and 934 transitions. [2018-11-10 04:20:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 934 transitions. [2018-11-10 04:20:29,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 04:20:29,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 110 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 04:20:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 756 states and 957 transitions. [2018-11-10 04:20:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 957 transitions. [2018-11-10 04:20:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 04:20:30,078 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 165 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 770 states and 974 transitions. [2018-11-10 04:20:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 974 transitions. [2018-11-10 04:20:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 04:20:31,441 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 04:20:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 772 states and 976 transitions. [2018-11-10 04:20:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 976 transitions. [2018-11-10 04:20:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 04:20:31,729 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 841 states and 1063 transitions. [2018-11-10 04:20:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1063 transitions. [2018-11-10 04:20:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 04:20:36,565 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:38,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 866 states and 1092 transitions. [2018-11-10 04:20:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1092 transitions. [2018-11-10 04:20:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 04:20:38,309 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 877 states and 1104 transitions. [2018-11-10 04:20:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1104 transitions. [2018-11-10 04:20:38,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 04:20:38,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 127 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 04:20:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 950 states and 1188 transitions. [2018-11-10 04:20:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1188 transitions. [2018-11-10 04:20:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 04:20:40,150 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 04:20:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 960 states and 1211 transitions. [2018-11-10 04:20:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1211 transitions. [2018-11-10 04:20:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 04:20:42,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:42,447 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 04:20:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 964 states and 1218 transitions. [2018-11-10 04:20:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1218 transitions. [2018-11-10 04:20:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 04:20:43,105 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 04:20:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 966 states and 1223 transitions. [2018-11-10 04:20:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1223 transitions. [2018-11-10 04:20:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 04:20:43,487 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 04:20:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 969 states and 1226 transitions. [2018-11-10 04:20:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1226 transitions. [2018-11-10 04:20:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 04:20:44,177 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 04:20:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 970 states and 1226 transitions. [2018-11-10 04:20:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1226 transitions. [2018-11-10 04:20:44,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 04:20:44,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:20:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1016 states and 1278 transitions. [2018-11-10 04:20:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1278 transitions. [2018-11-10 04:20:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 04:20:45,583 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 04:20:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1019 states and 1282 transitions. [2018-11-10 04:20:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1282 transitions. [2018-11-10 04:20:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 04:20:46,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:20:46,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1022 states and 1286 transitions. [2018-11-10 04:20:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1286 transitions. [2018-11-10 04:20:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 04:20:46,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1047 states and 1317 transitions. [2018-11-10 04:20:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1317 transitions. [2018-11-10 04:20:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 04:20:48,518 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1051 states and 1322 transitions. [2018-11-10 04:20:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1322 transitions. [2018-11-10 04:20:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 04:20:49,013 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-10 04:20:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1073 states and 1347 transitions. [2018-11-10 04:20:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1347 transitions. [2018-11-10 04:20:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 04:20:49,851 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-10 04:20:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1083 states and 1358 transitions. [2018-11-10 04:20:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1358 transitions. [2018-11-10 04:20:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 04:20:50,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 245 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 04:20:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1092 states and 1368 transitions. [2018-11-10 04:20:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1368 transitions. [2018-11-10 04:20:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 04:20:51,692 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 245 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 04:20:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1096 states and 1372 transitions. [2018-11-10 04:20:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1372 transitions. [2018-11-10 04:20:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 04:20:52,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-10 04:20:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1101 states and 1377 transitions. [2018-11-10 04:20:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1377 transitions. [2018-11-10 04:20:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 04:20:52,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:20:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1142 states and 1427 transitions. [2018-11-10 04:20:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1427 transitions. [2018-11-10 04:20:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 04:20:55,585 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:20:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1157 states and 1443 transitions. [2018-11-10 04:20:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1443 transitions. [2018-11-10 04:20:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 04:20:56,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:20:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1162 states and 1448 transitions. [2018-11-10 04:20:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1448 transitions. [2018-11-10 04:20:57,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 04:20:57,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 138 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:20:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1193 states and 1481 transitions. [2018-11-10 04:20:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1481 transitions. [2018-11-10 04:20:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 04:20:57,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 04:20:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:20:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1264 states and 1555 transitions. [2018-11-10 04:20:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1555 transitions. [2018-11-10 04:20:58,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-10 04:20:58,014 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:20:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:20:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 04:21:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1322 states and 1621 transitions. [2018-11-10 04:21:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1621 transitions. [2018-11-10 04:21:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-10 04:21:02,046 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 04:21:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1342 states and 1641 transitions. [2018-11-10 04:21:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1641 transitions. [2018-11-10 04:21:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 04:21:03,294 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 252 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 04:21:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1384 states and 1694 transitions. [2018-11-10 04:21:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1694 transitions. [2018-11-10 04:21:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 04:21:05,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 252 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 04:21:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1393 states and 1705 transitions. [2018-11-10 04:21:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1705 transitions. [2018-11-10 04:21:05,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-10 04:21:05,742 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 04:21:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1421 states and 1737 transitions. [2018-11-10 04:21:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1737 transitions. [2018-11-10 04:21:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-10 04:21:09,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 04:21:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1441 states and 1755 transitions. [2018-11-10 04:21:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1755 transitions. [2018-11-10 04:21:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-10 04:21:10,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 04:21:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1446 states and 1759 transitions. [2018-11-10 04:21:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1759 transitions. [2018-11-10 04:21:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-10 04:21:11,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-11-10 04:21:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1517 states and 1834 transitions. [2018-11-10 04:21:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1834 transitions. [2018-11-10 04:21:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 04:21:13,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-10 04:21:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1616 states and 1939 transitions. [2018-11-10 04:21:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1939 transitions. [2018-11-10 04:21:14,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 04:21:14,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 288 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:21:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1661 states and 1989 transitions. [2018-11-10 04:21:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 1989 transitions. [2018-11-10 04:21:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 04:21:18,169 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 288 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:21:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1670 states and 1998 transitions. [2018-11-10 04:21:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 1998 transitions. [2018-11-10 04:21:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-10 04:21:19,105 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 229 proven. 134 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:21:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 1717 states and 2057 transitions. [2018-11-10 04:21:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2057 transitions. [2018-11-10 04:21:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-10 04:21:22,012 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-11-10 04:21:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 1738 states and 2077 transitions. [2018-11-10 04:21:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2077 transitions. [2018-11-10 04:21:22,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-10 04:21:22,247 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-11-10 04:21:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 1742 states and 2080 transitions. [2018-11-10 04:21:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2080 transitions. [2018-11-10 04:21:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-10 04:21:22,500 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 396 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-10 04:21:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 1879 states and 2266 transitions. [2018-11-10 04:21:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2266 transitions. [2018-11-10 04:21:33,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-10 04:21:33,428 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:21:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 1890 states and 2281 transitions. [2018-11-10 04:21:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2281 transitions. [2018-11-10 04:21:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-10 04:21:36,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:21:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 1894 states and 2285 transitions. [2018-11-10 04:21:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2285 transitions. [2018-11-10 04:21:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-10 04:21:36,783 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:21:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 1897 states and 2287 transitions. [2018-11-10 04:21:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2287 transitions. [2018-11-10 04:21:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-10 04:21:37,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 274 proven. 50 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:21:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 1910 states and 2307 transitions. [2018-11-10 04:21:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2307 transitions. [2018-11-10 04:21:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-10 04:21:40,720 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 274 proven. 50 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:21:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 1915 states and 2311 transitions. [2018-11-10 04:21:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2311 transitions. [2018-11-10 04:21:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-10 04:21:41,831 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 314 proven. 56 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:21:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 1933 states and 2341 transitions. [2018-11-10 04:21:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2341 transitions. [2018-11-10 04:21:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-10 04:21:46,110 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 314 proven. 56 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:21:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 1959 states and 2367 transitions. [2018-11-10 04:21:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2367 transitions. [2018-11-10 04:21:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-10 04:21:47,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 314 proven. 56 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:21:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 1970 states and 2377 transitions. [2018-11-10 04:21:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2377 transitions. [2018-11-10 04:21:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-10 04:21:48,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-10 04:21:53,522 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-11-10 04:21:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2016 states and 2426 transitions. [2018-11-10 04:21:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2426 transitions. [2018-11-10 04:21:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-10 04:21:56,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-10 04:21:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2022 states and 2433 transitions. [2018-11-10 04:21:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2433 transitions. [2018-11-10 04:21:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-10 04:21:58,177 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-10 04:21:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2026 states and 2438 transitions. [2018-11-10 04:21:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2438 transitions. [2018-11-10 04:21:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-10 04:21:59,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-10 04:22:00,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2027 states and 2441 transitions. [2018-11-10 04:22:00,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2441 transitions. [2018-11-10 04:22:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-10 04:22:00,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 320 proven. 14 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-10 04:22:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2028 states and 2442 transitions. [2018-11-10 04:22:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2442 transitions. [2018-11-10 04:22:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-10 04:22:00,895 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 320 proven. 14 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-10 04:22:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2032 states and 2446 transitions. [2018-11-10 04:22:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2446 transitions. [2018-11-10 04:22:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-10 04:22:01,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-10 04:22:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2059 states and 2478 transitions. [2018-11-10 04:22:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2478 transitions. [2018-11-10 04:22:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-10 04:22:08,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:08,634 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-10 04:22:09,641 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-11-10 04:22:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2071 states and 2491 transitions. [2018-11-10 04:22:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2491 transitions. [2018-11-10 04:22:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-10 04:22:11,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-10 04:22:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2077 states and 2499 transitions. [2018-11-10 04:22:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2499 transitions. [2018-11-10 04:22:11,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-10 04:22:11,917 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-10 04:22:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2089 states and 2511 transitions. [2018-11-10 04:22:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2511 transitions. [2018-11-10 04:22:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-10 04:22:13,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 335 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:22:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2104 states and 2529 transitions. [2018-11-10 04:22:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 2529 transitions. [2018-11-10 04:22:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-10 04:22:17,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 335 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:22:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2112 states and 2545 transitions. [2018-11-10 04:22:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2545 transitions. [2018-11-10 04:22:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-10 04:22:20,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 335 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:22:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2120 states and 2555 transitions. [2018-11-10 04:22:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2555 transitions. [2018-11-10 04:22:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-10 04:22:23,111 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 335 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 04:22:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2121 states and 2555 transitions. [2018-11-10 04:22:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2555 transitions. [2018-11-10 04:22:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-11-10 04:22:23,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:22:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:22:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:22:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:22:23,954 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 112 iterations. [2018-11-10 04:22:24,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 04:22:24 ImpRootNode [2018-11-10 04:22:24,113 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 04:22:24,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:22:24,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:22:24,113 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:22:24,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:20:10" (3/4) ... [2018-11-10 04:22:24,118 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 04:22:24,225 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_399130d8-fa71-41ea-9e6e-a0a35209d1ad/bin-2019/ukojak/witness.graphml [2018-11-10 04:22:24,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:22:24,226 INFO L168 Benchmark]: Toolchain (without parser) took 135744.50 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.6 GB). Free memory was 955.4 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 04:22:24,227 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:22:24,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.21 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 920.5 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:22:24,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:22:24,227 INFO L168 Benchmark]: Boogie Preprocessor took 42.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:22:24,227 INFO L168 Benchmark]: RCFGBuilder took 1588.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 861.9 MB in the end (delta: 232.9 MB). Peak memory consumption was 232.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:22:24,228 INFO L168 Benchmark]: CodeCheck took 133537.50 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 861.9 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-10 04:22:24,228 INFO L168 Benchmark]: Witness Printer took 112.40 ms. Allocated memory is still 3.6 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:22:24,229 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 199 locations, 1 error locations. UNSAFE Result, 133.3s OverallTime, 112 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1147037080 SDtfs, 2088351352 SDslu, 1498308456 SDs, 0 SdLazy, -1541603960 SolverSat, 1113489536 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 295.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135361 GetRequests, 130060 SyntacticMatches, 3919 SemanticMatches, 1382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339091 ImplicationChecksByTransitivity, 115.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 20913 NumberOfCodeBlocks, 20913 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 20512 ConstructedInterpolants, 0 QuantifiedInterpolants, 29838001 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 111 InterpolantComputations, 82 PerfectInterpolantSequences, 23164/24029 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: 392]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] RET return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L262] a16 = 4 [L263] a20 = 0 [L264] RET return 25; VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L239] a20 = 0 [L240] a21 = 1 [L241] a17 = 0 [L242] a8 = 14 [L243] a16 = 4 [L244] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.21 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 920.5 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1588.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 861.9 MB in the end (delta: 232.9 MB). Peak memory consumption was 232.9 MB. Max. memory is 11.5 GB. * CodeCheck took 133537.50 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 861.9 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 112.40 ms. Allocated memory is still 3.6 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...