./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/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_74833352-0dd3-4aa9-af2f-cc2947943d99/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/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-635dfa2 [2018-12-02 02:58:39,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:58:39,888 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:58:39,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:58:39,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:58:39,894 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:58:39,895 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:58:39,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:58:39,897 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:58:39,897 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:58:39,897 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:58:39,897 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:58:39,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:58:39,898 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:58:39,899 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:58:39,899 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:58:39,900 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:58:39,900 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:58:39,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:58:39,902 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:58:39,903 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:58:39,903 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:58:39,904 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:58:39,904 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:58:39,904 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:58:39,905 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:58:39,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:58:39,906 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:58:39,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:58:39,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:58:39,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:58:39,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:58:39,907 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:58:39,907 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:58:39,908 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:58:39,908 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:58:39,908 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-02 02:58:39,915 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:58:39,916 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:58:39,916 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:58:39,916 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-02 02:58:39,916 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:58:39,917 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:58:39,917 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:58:39,917 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:58:39,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:58:39,917 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:58:39,917 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:58:39,917 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 02:58:39,917 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:58:39,917 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 02:58:39,917 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:58:39,917 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:58:39,917 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:58:39,918 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 02:58:39,918 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-02 02:58:39,918 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-02 02:58:39,918 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:58:39,918 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:58:39,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 02:58:39,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:58:39,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:58:39,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 02:58:39,918 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-02 02:58:39,918 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:58:39,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:58:39,919 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_74833352-0dd3-4aa9-af2f-cc2947943d99/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-12-02 02:58:39,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:58:39,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:58:39,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:58:39,946 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:58:39,946 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:58:39,947 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-12-02 02:58:39,985 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/bin-2019/ukojak/data/4f3a7d580/336a83d4991d4485b073e294ea8c050f/FLAG58a961356 [2018-12-02 02:58:40,464 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:58:40,465 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-12-02 02:58:40,471 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/bin-2019/ukojak/data/4f3a7d580/336a83d4991d4485b073e294ea8c050f/FLAG58a961356 [2018-12-02 02:58:40,480 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/bin-2019/ukojak/data/4f3a7d580/336a83d4991d4485b073e294ea8c050f [2018-12-02 02:58:40,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:58:40,483 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:58:40,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:58:40,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:58:40,485 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:58:40,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:58:40" (1/1) ... [2018-12-02 02:58:40,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f79c046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40, skipping insertion in model container [2018-12-02 02:58:40,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:58:40" (1/1) ... [2018-12-02 02:58:40,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:58:40,516 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:58:40,696 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:58:40,699 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:58:40,782 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:58:40,791 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:58:40,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40 WrapperNode [2018-12-02 02:58:40,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:58:40,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:58:40,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:58:40,792 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:58:40,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2018-12-02 02:58:40,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2018-12-02 02:58:40,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:58:40,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:58:40,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:58:40,833 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:58:40,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2018-12-02 02:58:40,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2018-12-02 02:58:40,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2018-12-02 02:58:40,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2018-12-02 02:58:40,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2018-12-02 02:58:40,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2018-12-02 02:58:40,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2018-12-02 02:58:40,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:58:40,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:58:40,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:58:40,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:58:40,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 02:58:40,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:58:40,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:58:41,902 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:58:41,903 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 02:58:41,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:41 BoogieIcfgContainer [2018-12-02 02:58:41,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:58:41,904 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-02 02:58:41,904 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-02 02:58:41,913 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-02 02:58:41,913 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:41" (1/1) ... [2018-12-02 02:58:41,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:58:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-02 02:58:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-02 02:58:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 02:58:41,954 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:58:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 145 states and 221 transitions. [2018-12-02 02:58:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 221 transitions. [2018-12-02 02:58:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 02:58:42,423 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:58:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 149 states and 226 transitions. [2018-12-02 02:58:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2018-12-02 02:58:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 02:58:42,588 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:58:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 154 states and 236 transitions. [2018-12-02 02:58:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 236 transitions. [2018-12-02 02:58:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 02:58:42,703 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 02:58:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 230 states and 325 transitions. [2018-12-02 02:58:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2018-12-02 02:58:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 02:58:43,125 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 02:58:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 252 states and 354 transitions. [2018-12-02 02:58:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 354 transitions. [2018-12-02 02:58:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 02:58:43,431 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:58:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 262 states and 370 transitions. [2018-12-02 02:58:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 370 transitions. [2018-12-02 02:58:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 02:58:43,951 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 02:58:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 267 states and 375 transitions. [2018-12-02 02:58:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 375 transitions. [2018-12-02 02:58:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 02:58:43,991 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:58:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 278 states and 400 transitions. [2018-12-02 02:58:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 400 transitions. [2018-12-02 02:58:44,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 02:58:44,561 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:58:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 284 states and 408 transitions. [2018-12-02 02:58:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 408 transitions. [2018-12-02 02:58:44,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 02:58:44,808 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:58:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 286 states and 411 transitions. [2018-12-02 02:58:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 411 transitions. [2018-12-02 02:58:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 02:58:44,917 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:58:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 289 states and 414 transitions. [2018-12-02 02:58:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 414 transitions. [2018-12-02 02:58:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 02:58:45,076 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:58:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 292 states and 418 transitions. [2018-12-02 02:58:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 418 transitions. [2018-12-02 02:58:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 02:58:45,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:58:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 293 states and 419 transitions. [2018-12-02 02:58:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 419 transitions. [2018-12-02 02:58:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 02:58:45,386 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:58:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 295 states and 421 transitions. [2018-12-02 02:58:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 421 transitions. [2018-12-02 02:58:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 02:58:45,508 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:58:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 298 states and 424 transitions. [2018-12-02 02:58:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 424 transitions. [2018-12-02 02:58:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 02:58:45,618 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 02:58:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 304 states and 430 transitions. [2018-12-02 02:58:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2018-12-02 02:58:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 02:58:45,662 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 02:58:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 310 states and 441 transitions. [2018-12-02 02:58:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 441 transitions. [2018-12-02 02:58:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 02:58:46,099 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 02:58:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 313 states and 445 transitions. [2018-12-02 02:58:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 445 transitions. [2018-12-02 02:58:46,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 02:58:46,266 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 02:58:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 316 states and 451 transitions. [2018-12-02 02:58:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 451 transitions. [2018-12-02 02:58:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 02:58:46,411 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 02:58:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 319 states and 454 transitions. [2018-12-02 02:58:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 454 transitions. [2018-12-02 02:58:46,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 02:58:46,581 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 02:58:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 321 states and 457 transitions. [2018-12-02 02:58:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 457 transitions. [2018-12-02 02:58:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 02:58:46,783 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 02:58:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 326 states and 464 transitions. [2018-12-02 02:58:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 464 transitions. [2018-12-02 02:58:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 02:58:47,274 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-02 02:58:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 337 states and 480 transitions. [2018-12-02 02:58:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 480 transitions. [2018-12-02 02:58:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 02:58:47,963 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-02 02:58:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 340 states and 483 transitions. [2018-12-02 02:58:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 483 transitions. [2018-12-02 02:58:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 02:58:48,107 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 02:58:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 348 states and 500 transitions. [2018-12-02 02:58:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 500 transitions. [2018-12-02 02:58:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 02:58:48,597 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 02:58:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 350 states and 503 transitions. [2018-12-02 02:58:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 503 transitions. [2018-12-02 02:58:48,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 02:58:48,727 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 02:58:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 353 states and 509 transitions. [2018-12-02 02:58:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 509 transitions. [2018-12-02 02:58:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 02:58:48,875 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 02:58:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 367 states and 523 transitions. [2018-12-02 02:58:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 523 transitions. [2018-12-02 02:58:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-02 02:58:48,950 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 02:58:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 378 states and 535 transitions. [2018-12-02 02:58:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 535 transitions. [2018-12-02 02:58:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 02:58:49,059 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:58:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 423 states and 584 transitions. [2018-12-02 02:58:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 584 transitions. [2018-12-02 02:58:49,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-02 02:58:49,534 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-02 02:58:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 425 states and 587 transitions. [2018-12-02 02:58:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 587 transitions. [2018-12-02 02:58:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-02 02:58:49,725 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 02:58:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 432 states and 596 transitions. [2018-12-02 02:58:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 596 transitions. [2018-12-02 02:58:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 02:58:49,894 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 02:58:50,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 450 states and 615 transitions. [2018-12-02 02:58:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 615 transitions. [2018-12-02 02:58:50,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-02 02:58:50,291 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-02 02:58:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 478 states and 656 transitions. [2018-12-02 02:58:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 656 transitions. [2018-12-02 02:58:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-02 02:58:52,118 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-02 02:58:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 483 states and 660 transitions. [2018-12-02 02:58:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 660 transitions. [2018-12-02 02:58:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 02:58:52,476 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:58:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 548 states and 727 transitions. [2018-12-02 02:58:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 727 transitions. [2018-12-02 02:58:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-02 02:58:53,876 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:58:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:58:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 604 states and 788 transitions. [2018-12-02 02:58:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 788 transitions. [2018-12-02 02:58:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 02:58:56,971 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:58:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:58:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 672 states and 871 transitions. [2018-12-02 02:59:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 871 transitions. [2018-12-02 02:59:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 02:59:00,766 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 680 states and 879 transitions. [2018-12-02 02:59:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 879 transitions. [2018-12-02 02:59:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 02:59:01,423 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 02:59:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 681 states and 879 transitions. [2018-12-02 02:59:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 879 transitions. [2018-12-02 02:59:01,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-02 02:59:01,556 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 750 states and 953 transitions. [2018-12-02 02:59:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 953 transitions. [2018-12-02 02:59:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-02 02:59:02,551 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 106 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:59:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 759 states and 968 transitions. [2018-12-02 02:59:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 968 transitions. [2018-12-02 02:59:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-02 02:59:03,441 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 106 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:59:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 764 states and 974 transitions. [2018-12-02 02:59:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 974 transitions. [2018-12-02 02:59:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 02:59:03,721 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 835 states and 1045 transitions. [2018-12-02 02:59:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1045 transitions. [2018-12-02 02:59:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-02 02:59:04,909 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 02:59:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 848 states and 1063 transitions. [2018-12-02 02:59:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1063 transitions. [2018-12-02 02:59:05,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-02 02:59:05,347 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 02:59:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 850 states and 1064 transitions. [2018-12-02 02:59:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1064 transitions. [2018-12-02 02:59:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 02:59:05,586 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 02:59:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 860 states and 1080 transitions. [2018-12-02 02:59:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1080 transitions. [2018-12-02 02:59:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 02:59:06,555 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 02:59:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 863 states and 1084 transitions. [2018-12-02 02:59:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1084 transitions. [2018-12-02 02:59:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 02:59:06,792 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 155 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 02:59:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 877 states and 1101 transitions. [2018-12-02 02:59:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1101 transitions. [2018-12-02 02:59:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 02:59:08,541 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 155 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 02:59:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 879 states and 1102 transitions. [2018-12-02 02:59:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1102 transitions. [2018-12-02 02:59:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 02:59:08,897 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-02 02:59:08,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 881 states and 1104 transitions. [2018-12-02 02:59:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1104 transitions. [2018-12-02 02:59:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-02 02:59:08,999 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 946 states and 1181 transitions. [2018-12-02 02:59:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1181 transitions. [2018-12-02 02:59:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-02 02:59:14,218 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 965 states and 1204 transitions. [2018-12-02 02:59:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1204 transitions. [2018-12-02 02:59:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-02 02:59:15,220 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 972 states and 1212 transitions. [2018-12-02 02:59:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1212 transitions. [2018-12-02 02:59:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 02:59:16,019 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-02 02:59:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 979 states and 1230 transitions. [2018-12-02 02:59:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1230 transitions. [2018-12-02 02:59:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 02:59:17,939 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-02 02:59:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 983 states and 1239 transitions. [2018-12-02 02:59:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1239 transitions. [2018-12-02 02:59:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 02:59:19,496 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-02 02:59:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 984 states and 1240 transitions. [2018-12-02 02:59:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1240 transitions. [2018-12-02 02:59:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 02:59:19,857 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-02 02:59:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 986 states and 1242 transitions. [2018-12-02 02:59:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1242 transitions. [2018-12-02 02:59:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-02 02:59:20,144 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-02 02:59:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 989 states and 1246 transitions. [2018-12-02 02:59:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1246 transitions. [2018-12-02 02:59:20,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 02:59:20,384 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 02:59:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1034 states and 1298 transitions. [2018-12-02 02:59:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1298 transitions. [2018-12-02 02:59:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-02 02:59:21,632 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 02:59:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1040 states and 1305 transitions. [2018-12-02 02:59:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1305 transitions. [2018-12-02 02:59:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-02 02:59:22,054 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 233 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 02:59:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1046 states and 1312 transitions. [2018-12-02 02:59:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1312 transitions. [2018-12-02 02:59:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-02 02:59:22,912 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 233 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 02:59:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1049 states and 1315 transitions. [2018-12-02 02:59:23,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1315 transitions. [2018-12-02 02:59:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-02 02:59:23,227 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-12-02 02:59:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1079 states and 1349 transitions. [2018-12-02 02:59:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1349 transitions. [2018-12-02 02:59:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-02 02:59:24,303 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1148 states and 1438 transitions. [2018-12-02 02:59:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1438 transitions. [2018-12-02 02:59:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-02 02:59:35,216 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1167 states and 1460 transitions. [2018-12-02 02:59:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1460 transitions. [2018-12-02 02:59:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-02 02:59:37,978 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1181 states and 1474 transitions. [2018-12-02 02:59:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1474 transitions. [2018-12-02 02:59:41,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-02 02:59:41,951 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1183 states and 1475 transitions. [2018-12-02 02:59:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1475 transitions. [2018-12-02 02:59:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-02 02:59:42,579 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-02 02:59:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1222 states and 1517 transitions. [2018-12-02 02:59:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1517 transitions. [2018-12-02 02:59:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-02 02:59:46,007 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-02 02:59:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1224 states and 1518 transitions. [2018-12-02 02:59:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1518 transitions. [2018-12-02 02:59:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-02 02:59:46,416 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 02:59:51,454 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-12-02 02:59:52,644 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-02 02:59:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1228 states and 1525 transitions. [2018-12-02 02:59:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1525 transitions. [2018-12-02 02:59:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-02 02:59:55,425 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 02:59:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 02:59:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1231 states and 1529 transitions. [2018-12-02 02:59:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1529 transitions. [2018-12-02 02:59:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-02 02:59:56,453 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 02:59:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 03:00:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1289 states and 1595 transitions. [2018-12-02 03:00:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1595 transitions. [2018-12-02 03:00:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-02 03:00:02,110 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 03:00:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1291 states and 1596 transitions. [2018-12-02 03:00:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1596 transitions. [2018-12-02 03:00:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-02 03:00:02,532 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-02 03:00:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1361 states and 1669 transitions. [2018-12-02 03:00:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1669 transitions. [2018-12-02 03:00:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-02 03:00:03,267 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 240 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 03:00:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1399 states and 1719 transitions. [2018-12-02 03:00:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1719 transitions. [2018-12-02 03:00:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-02 03:00:08,429 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 240 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 03:00:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1407 states and 1730 transitions. [2018-12-02 03:00:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1730 transitions. [2018-12-02 03:00:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-02 03:00:10,376 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 240 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 03:00:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1409 states and 1733 transitions. [2018-12-02 03:00:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1733 transitions. [2018-12-02 03:00:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-02 03:00:10,464 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 03:00:12,612 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-02 03:00:15,317 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-12-02 03:00:17,053 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2018-12-02 03:00:17,675 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-02 03:00:19,568 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-02 03:00:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1457 states and 1784 transitions. [2018-12-02 03:00:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1784 transitions. [2018-12-02 03:00:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-02 03:00:22,200 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 03:00:23,200 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-12-02 03:00:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1459 states and 1784 transitions. [2018-12-02 03:00:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1784 transitions. [2018-12-02 03:00:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 03:00:23,560 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 239 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 03:00:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1508 states and 1837 transitions. [2018-12-02 03:00:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1837 transitions. [2018-12-02 03:00:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 03:00:29,614 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 239 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 03:00:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1513 states and 1841 transitions. [2018-12-02 03:00:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1841 transitions. [2018-12-02 03:00:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-02 03:00:30,724 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 03:00:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1583 states and 1915 transitions. [2018-12-02 03:00:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1915 transitions. [2018-12-02 03:00:32,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-02 03:00:32,297 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 164 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-02 03:00:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1608 states and 1945 transitions. [2018-12-02 03:00:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1945 transitions. [2018-12-02 03:00:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-02 03:00:36,185 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 164 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-02 03:00:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1610 states and 1946 transitions. [2018-12-02 03:00:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1946 transitions. [2018-12-02 03:00:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-02 03:00:36,848 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-02 03:00:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 1706 states and 2049 transitions. [2018-12-02 03:00:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2049 transitions. [2018-12-02 03:00:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-02 03:00:38,157 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 256 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 03:00:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1736 states and 2090 transitions. [2018-12-02 03:00:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2090 transitions. [2018-12-02 03:00:45,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-02 03:00:45,683 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 256 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 03:00:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 1741 states and 2095 transitions. [2018-12-02 03:00:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2095 transitions. [2018-12-02 03:00:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-02 03:00:47,110 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 221 proven. 128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 03:00:49,928 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-12-02 03:00:50,194 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-02 03:00:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 1787 states and 2156 transitions. [2018-12-02 03:00:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2156 transitions. [2018-12-02 03:00:54,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-02 03:00:54,978 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 221 proven. 128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 03:00:56,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:00:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 1803 states and 2173 transitions. [2018-12-02 03:00:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2173 transitions. [2018-12-02 03:00:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-12-02 03:00:56,799 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:00:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 368 proven. 18 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-02 03:01:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:01:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 1903 states and 2325 transitions. [2018-12-02 03:01:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2325 transitions. [2018-12-02 03:01:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-02 03:01:17,827 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:01:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:01:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-02 03:01:24,977 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-02 03:01:27,229 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-02 03:01:34,728 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-12-02 03:01:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:01:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 1963 states and 2391 transitions. [2018-12-02 03:01:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2391 transitions. [2018-12-02 03:01:37,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-02 03:01:37,811 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:01:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:01:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-02 03:01:44,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:01:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2002 states and 2433 transitions. [2018-12-02 03:01:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2433 transitions. [2018-12-02 03:01:44,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-12-02 03:01:44,245 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:01:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:01:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 03:01:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:01:48,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2007 states and 2442 transitions. [2018-12-02 03:01:48,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2442 transitions. [2018-12-02 03:01:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-12-02 03:01:48,525 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:01:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:01:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 03:01:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:01:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2018 states and 2453 transitions. [2018-12-02 03:01:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2453 transitions. [2018-12-02 03:01:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-12-02 03:01:51,015 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:01:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:01:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 03:01:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:01:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2019 states and 2453 transitions. [2018-12-02 03:01:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2453 transitions. [2018-12-02 03:01:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-02 03:01:52,148 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:01:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:01:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-02 03:01:57,826 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2018-12-02 03:02:01,818 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2018-12-02 03:02:03,099 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-02 03:02:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:02:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2126 states and 2574 transitions. [2018-12-02 03:02:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2574 transitions. [2018-12-02 03:02:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-02 03:02:03,180 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:02:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:02:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-02 03:02:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:02:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2153 states and 2612 transitions. [2018-12-02 03:02:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 2612 transitions. [2018-12-02 03:02:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-12-02 03:02:15,507 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:02:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:02:18,822 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-12-02 03:02:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-02 03:02:21,616 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-12-02 03:02:27,233 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-02 03:02:29,613 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-12-02 03:02:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:02:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2185 states and 2648 transitions. [2018-12-02 03:02:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2648 transitions. [2018-12-02 03:02:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-02 03:02:32,719 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:02:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:02:34,401 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-12-02 03:02:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 03:02:38,816 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-12-02 03:02:42,124 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-12-02 03:02:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:02:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2211 states and 2678 transitions. [2018-12-02 03:02:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2678 transitions. [2018-12-02 03:02:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-02 03:02:46,388 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:02:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:02:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 03:02:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:02:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2219 states and 2687 transitions. [2018-12-02 03:02:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2687 transitions. [2018-12-02 03:02:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-02 03:02:50,337 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:02:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:02:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 03:02:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:02:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2227 states and 2696 transitions. [2018-12-02 03:02:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 2696 transitions. [2018-12-02 03:02:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-02 03:02:53,185 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:02:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:02:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 03:02:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:02:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2229 states and 2700 transitions. [2018-12-02 03:02:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2700 transitions. [2018-12-02 03:02:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-02 03:02:54,930 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:02:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:02:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 03:02:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:02:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2240 states and 2710 transitions. [2018-12-02 03:02:56,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2710 transitions. [2018-12-02 03:02:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-02 03:02:56,950 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:02:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:03:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 03:03:08,314 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2018-12-02 03:03:13,366 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-02 03:03:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:03:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2296 states and 2771 transitions. [2018-12-02 03:03:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 2771 transitions. [2018-12-02 03:03:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-02 03:03:15,492 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:03:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:03:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 03:03:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:03:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2301 states and 2776 transitions. [2018-12-02 03:03:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2776 transitions. [2018-12-02 03:03:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-02 03:03:19,197 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:03:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:03:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 03:03:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:03:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2304 states and 2779 transitions. [2018-12-02 03:03:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 2779 transitions. [2018-12-02 03:03:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-02 03:03:20,207 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:03:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:03:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 03:03:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:03:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2311 states and 2786 transitions. [2018-12-02 03:03:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 2786 transitions. [2018-12-02 03:03:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-02 03:03:21,909 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:03:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:03:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 03:03:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:03:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2316 states and 2790 transitions. [2018-12-02 03:03:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 2790 transitions. [2018-12-02 03:03:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-02 03:03:25,315 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:03:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:03:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:03:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:03:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:03:25,556 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 110 iterations. [2018-12-02 03:03:25,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 03:03:25 ImpRootNode [2018-12-02 03:03:25,703 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-02 03:03:25,703 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:03:25,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:03:25,704 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:03:25,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:41" (3/4) ... [2018-12-02 03:03:25,706 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 03:03:25,807 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_74833352-0dd3-4aa9-af2f-cc2947943d99/bin-2019/ukojak/witness.graphml [2018-12-02 03:03:25,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:03:25,808 INFO L168 Benchmark]: Toolchain (without parser) took 285325.33 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 791.7 MB). Free memory was 945.3 MB in the beginning and 1.0 GB in the end (delta: -57.6 MB). Peak memory consumption was 734.1 MB. Max. memory is 11.5 GB. [2018-12-02 03:03:25,808 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:03:25,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2018-12-02 03:03:25,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.47 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: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-12-02 03:03:25,809 INFO L168 Benchmark]: Boogie Preprocessor took 30.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:03:25,809 INFO L168 Benchmark]: RCFGBuilder took 1039.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 871.1 MB in the end (delta: 217.9 MB). Peak memory consumption was 217.9 MB. Max. memory is 11.5 GB. [2018-12-02 03:03:25,809 INFO L168 Benchmark]: CodeCheck took 283799.25 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 671.1 MB). Free memory was 871.1 MB in the beginning and 1.0 GB in the end (delta: -169.4 MB). Peak memory consumption was 501.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:03:25,809 INFO L168 Benchmark]: Witness Printer took 103.84 ms. Allocated memory is still 1.8 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:03:25,811 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 198 locations, 1 error locations. UNSAFE Result, 283.6s OverallTime, 110 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1982441008 SDtfs, 1223144896 SDslu, 106010384 SDs, 0 SdLazy, -908089120 SolverSat, 302489864 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 344.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129378 GetRequests, 124027 SyntacticMatches, 3757 SemanticMatches, 1594 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1895854 ImplicationChecksByTransitivity, 263.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 33.2s InterpolantComputationTime, 19589 NumberOfCodeBlocks, 19589 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 19197 ConstructedInterpolants, 0 QuantifiedInterpolants, 27526344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 109 InterpolantComputations, 84 PerfectInterpolantSequences, 21109/21759 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)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L262] a16 = 4 [L263] a20 = 0 [L264] 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] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=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] 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] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 308.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.47 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: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1039.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 871.1 MB in the end (delta: 217.9 MB). Peak memory consumption was 217.9 MB. Max. memory is 11.5 GB. * CodeCheck took 283799.25 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 671.1 MB). Free memory was 871.1 MB in the beginning and 1.0 GB in the end (delta: -169.4 MB). Peak memory consumption was 501.7 MB. Max. memory is 11.5 GB. * Witness Printer took 103.84 ms. Allocated memory is still 1.8 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...