./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/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 5d9bfdaf23db32516d1ccf8929c6af5e4a9d3bd0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-5842f4b [2018-11-18 15:38:29,319 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:38:29,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:38:29,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:38:29,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:38:29,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:38:29,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:38:29,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:38:29,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:38:29,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:38:29,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:38:29,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:38:29,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:38:29,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:38:29,334 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:38:29,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:38:29,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:38:29,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:38:29,338 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:38:29,339 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:38:29,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:38:29,340 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:38:29,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:38:29,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:38:29,342 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:38:29,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:38:29,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:38:29,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:38:29,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:38:29,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:38:29,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:38:29,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:38:29,346 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:38:29,346 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:38:29,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:38:29,347 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:38:29,347 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 15:38:29,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:38:29,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:38:29,358 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:38:29,358 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 15:38:29,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:38:29,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:38:29,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:38:29,359 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:38:29,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:38:29,359 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:38:29,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:38:29,359 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:38:29,359 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:38:29,359 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:38:29,359 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:38:29,359 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:38:29,360 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:38:29,360 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:38:29,360 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 15:38:29,360 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 15:38:29,360 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:38:29,360 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:38:29,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 15:38:29,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:38:29,361 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:38:29,361 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:38:29,361 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 15:38:29,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:38:29,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:38:29,361 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_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/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 -> 5d9bfdaf23db32516d1ccf8929c6af5e4a9d3bd0 [2018-11-18 15:38:29,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:38:29,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:38:29,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:38:29,397 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:38:29,398 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:38:29,398 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c [2018-11-18 15:38:29,443 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/bin-2019/ukojak/data/5a819688e/fc92c06406304506a51c0664da7faac8/FLAG68283d51b [2018-11-18 15:38:29,899 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:38:29,899 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c [2018-11-18 15:38:29,910 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/bin-2019/ukojak/data/5a819688e/fc92c06406304506a51c0664da7faac8/FLAG68283d51b [2018-11-18 15:38:30,417 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/bin-2019/ukojak/data/5a819688e/fc92c06406304506a51c0664da7faac8 [2018-11-18 15:38:30,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:38:30,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:38:30,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:38:30,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:38:30,423 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:38:30,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:38:30" (1/1) ... [2018-11-18 15:38:30,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cfef79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:38:30, skipping insertion in model container [2018-11-18 15:38:30,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:38:30" (1/1) ... [2018-11-18 15:38:30,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:38:30,464 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:38:30,699 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:38:30,702 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:38:30,768 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:38:30,777 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:38:30,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:38:30 WrapperNode [2018-11-18 15:38:30,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:38:30,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:38:30,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:38:30,778 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:38:30,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:38:30" (1/1) ... [2018-11-18 15:38:30,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:38:30" (1/1) ... [2018-11-18 15:38:30,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:38:30,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:38:30,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:38:30,880 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:38:30,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:38:30" (1/1) ... [2018-11-18 15:38:30,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:38:30" (1/1) ... [2018-11-18 15:38:30,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:38:30" (1/1) ... [2018-11-18 15:38:30,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:38:30" (1/1) ... [2018-11-18 15:38:30,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:38:30" (1/1) ... [2018-11-18 15:38:30,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:38:30" (1/1) ... [2018-11-18 15:38:30,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:38:30" (1/1) ... [2018-11-18 15:38:30,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:38:30,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:38:30,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:38:30,920 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:38:30,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:38:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 15:38:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 15:38:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:38:30,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:38:32,202 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:38:32,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:38:32 BoogieIcfgContainer [2018-11-18 15:38:32,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:38:32,203 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 15:38:32,203 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 15:38:32,210 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 15:38:32,210 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:38:32" (1/1) ... [2018-11-18 15:38:32,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-18 15:38:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-18 15:38:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 15:38:32,245 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 147 states and 234 transitions. [2018-11-18 15:38:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 234 transitions. [2018-11-18 15:38:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 15:38:32,842 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 212 states and 322 transitions. [2018-11-18 15:38:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 322 transitions. [2018-11-18 15:38:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 15:38:33,250 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 217 states and 330 transitions. [2018-11-18 15:38:33,365 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 330 transitions. [2018-11-18 15:38:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 15:38:33,367 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 288 states and 404 transitions. [2018-11-18 15:38:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2018-11-18 15:38:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 15:38:33,833 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:38:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 289 states and 405 transitions. [2018-11-18 15:38:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 405 transitions. [2018-11-18 15:38:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-18 15:38:33,890 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:38:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 302 states and 425 transitions. [2018-11-18 15:38:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2018-11-18 15:38:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 15:38:34,161 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 317 states and 443 transitions. [2018-11-18 15:38:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 443 transitions. [2018-11-18 15:38:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 15:38:34,617 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:38:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 326 states and 456 transitions. [2018-11-18 15:38:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 456 transitions. [2018-11-18 15:38:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 15:38:34,921 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:38:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 329 states and 459 transitions. [2018-11-18 15:38:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 459 transitions. [2018-11-18 15:38:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 15:38:35,028 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 333 states and 464 transitions. [2018-11-18 15:38:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 464 transitions. [2018-11-18 15:38:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 15:38:35,204 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 349 states and 486 transitions. [2018-11-18 15:38:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 486 transitions. [2018-11-18 15:38:35,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 15:38:35,777 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 356 states and 495 transitions. [2018-11-18 15:38:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 495 transitions. [2018-11-18 15:38:36,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 15:38:36,119 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:38:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 361 states and 500 transitions. [2018-11-18 15:38:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 500 transitions. [2018-11-18 15:38:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 15:38:36,173 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:38:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 366 states and 506 transitions. [2018-11-18 15:38:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 506 transitions. [2018-11-18 15:38:36,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-18 15:38:36,263 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 384 states and 526 transitions. [2018-11-18 15:38:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 526 transitions. [2018-11-18 15:38:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 15:38:36,603 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 390 states and 533 transitions. [2018-11-18 15:38:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 533 transitions. [2018-11-18 15:38:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 15:38:36,661 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 401 states and 547 transitions. [2018-11-18 15:38:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 547 transitions. [2018-11-18 15:38:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-18 15:38:36,877 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:38:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 408 states and 555 transitions. [2018-11-18 15:38:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 555 transitions. [2018-11-18 15:38:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 15:38:37,121 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:37,142 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:38:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 409 states and 557 transitions. [2018-11-18 15:38:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 557 transitions. [2018-11-18 15:38:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 15:38:37,257 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:38:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 410 states and 559 transitions. [2018-11-18 15:38:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 559 transitions. [2018-11-18 15:38:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 15:38:37,380 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 424 states and 574 transitions. [2018-11-18 15:38:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 574 transitions. [2018-11-18 15:38:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 15:38:37,736 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:38:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 433 states and 583 transitions. [2018-11-18 15:38:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 583 transitions. [2018-11-18 15:38:37,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 15:38:37,972 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:38:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 440 states and 589 transitions. [2018-11-18 15:38:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2018-11-18 15:38:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 15:38:38,097 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:38:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 445 states and 594 transitions. [2018-11-18 15:38:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 594 transitions. [2018-11-18 15:38:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 15:38:38,161 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:38:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 450 states and 600 transitions. [2018-11-18 15:38:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 600 transitions. [2018-11-18 15:38:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 15:38:38,277 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 457 states and 610 transitions. [2018-11-18 15:38:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 610 transitions. [2018-11-18 15:38:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 15:38:38,888 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:38:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 464 states and 617 transitions. [2018-11-18 15:38:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 617 transitions. [2018-11-18 15:38:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 15:38:38,952 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:38:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 471 states and 624 transitions. [2018-11-18 15:38:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 624 transitions. [2018-11-18 15:38:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 15:38:39,022 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 491 states and 646 transitions. [2018-11-18 15:38:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 646 transitions. [2018-11-18 15:38:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 15:38:39,759 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:38:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 493 states and 648 transitions. [2018-11-18 15:38:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 648 transitions. [2018-11-18 15:38:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 15:38:39,804 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:38:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 495 states and 650 transitions. [2018-11-18 15:38:39,865 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 650 transitions. [2018-11-18 15:38:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 15:38:39,865 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 525 states and 687 transitions. [2018-11-18 15:38:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 687 transitions. [2018-11-18 15:38:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 15:38:40,890 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 531 states and 696 transitions. [2018-11-18 15:38:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 696 transitions. [2018-11-18 15:38:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 15:38:41,182 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 535 states and 701 transitions. [2018-11-18 15:38:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 701 transitions. [2018-11-18 15:38:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-18 15:38:41,220 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:41,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 548 states and 716 transitions. [2018-11-18 15:38:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 716 transitions. [2018-11-18 15:38:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-18 15:38:41,635 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 553 states and 725 transitions. [2018-11-18 15:38:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 725 transitions. [2018-11-18 15:38:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 15:38:42,050 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:42,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 559 states and 731 transitions. [2018-11-18 15:38:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 731 transitions. [2018-11-18 15:38:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 15:38:42,138 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:38:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 568 states and 740 transitions. [2018-11-18 15:38:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 740 transitions. [2018-11-18 15:38:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 15:38:42,391 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:38:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 571 states and 742 transitions. [2018-11-18 15:38:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 742 transitions. [2018-11-18 15:38:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 15:38:42,427 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 598 states and 785 transitions. [2018-11-18 15:38:43,629 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 785 transitions. [2018-11-18 15:38:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 15:38:43,630 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 615 states and 807 transitions. [2018-11-18 15:38:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 807 transitions. [2018-11-18 15:38:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 15:38:44,182 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:38:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 627 states and 819 transitions. [2018-11-18 15:38:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 819 transitions. [2018-11-18 15:38:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 15:38:44,232 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:38:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:44,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 639 states and 832 transitions. [2018-11-18 15:38:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 832 transitions. [2018-11-18 15:38:44,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 15:38:44,356 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 650 states and 853 transitions. [2018-11-18 15:38:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 853 transitions. [2018-11-18 15:38:45,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 15:38:45,111 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 653 states and 856 transitions. [2018-11-18 15:38:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 856 transitions. [2018-11-18 15:38:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 15:38:45,261 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:38:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 660 states and 864 transitions. [2018-11-18 15:38:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 864 transitions. [2018-11-18 15:38:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 15:38:45,441 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 679 states and 886 transitions. [2018-11-18 15:38:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 886 transitions. [2018-11-18 15:38:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 15:38:45,641 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:38:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 729 states and 942 transitions. [2018-11-18 15:38:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 942 transitions. [2018-11-18 15:38:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 15:38:46,502 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:38:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 773 states and 988 transitions. [2018-11-18 15:38:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 988 transitions. [2018-11-18 15:38:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 15:38:47,265 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:38:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 778 states and 995 transitions. [2018-11-18 15:38:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 995 transitions. [2018-11-18 15:38:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 15:38:47,456 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:38:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 780 states and 996 transitions. [2018-11-18 15:38:47,625 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 996 transitions. [2018-11-18 15:38:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 15:38:47,626 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:38:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 790 states and 1010 transitions. [2018-11-18 15:38:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1010 transitions. [2018-11-18 15:38:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 15:38:48,187 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:38:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 792 states and 1012 transitions. [2018-11-18 15:38:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1012 transitions. [2018-11-18 15:38:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 15:38:48,484 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:38:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 794 states and 1014 transitions. [2018-11-18 15:38:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1014 transitions. [2018-11-18 15:38:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 15:38:48,836 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:48,919 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-18 15:38:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 879 states and 1107 transitions. [2018-11-18 15:38:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1107 transitions. [2018-11-18 15:38:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 15:38:49,553 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 15:38:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 893 states and 1127 transitions. [2018-11-18 15:38:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1127 transitions. [2018-11-18 15:38:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 15:38:50,154 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 15:38:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 895 states and 1129 transitions. [2018-11-18 15:38:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1129 transitions. [2018-11-18 15:38:50,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 15:38:50,378 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 923 states and 1162 transitions. [2018-11-18 15:38:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1162 transitions. [2018-11-18 15:38:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 15:38:50,926 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:38:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 924 states and 1164 transitions. [2018-11-18 15:38:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1164 transitions. [2018-11-18 15:38:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-18 15:38:51,009 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:38:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 925 states and 1165 transitions. [2018-11-18 15:38:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1165 transitions. [2018-11-18 15:38:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 15:38:51,078 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-18 15:38:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 927 states and 1166 transitions. [2018-11-18 15:38:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1166 transitions. [2018-11-18 15:38:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-18 15:38:51,152 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:38:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 957 states and 1200 transitions. [2018-11-18 15:38:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1200 transitions. [2018-11-18 15:38:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 15:38:51,781 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:38:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 988 states and 1230 transitions. [2018-11-18 15:38:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1230 transitions. [2018-11-18 15:38:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-18 15:38:52,541 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:38:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1016 states and 1265 transitions. [2018-11-18 15:38:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1265 transitions. [2018-11-18 15:38:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 15:38:54,063 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 15:38:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1027 states and 1277 transitions. [2018-11-18 15:38:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1277 transitions. [2018-11-18 15:38:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 15:38:54,148 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 15:38:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1038 states and 1289 transitions. [2018-11-18 15:38:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1289 transitions. [2018-11-18 15:38:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 15:38:54,238 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 15:38:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1039 states and 1290 transitions. [2018-11-18 15:38:54,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1290 transitions. [2018-11-18 15:38:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 15:38:54,300 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 15:38:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1040 states and 1291 transitions. [2018-11-18 15:38:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1291 transitions. [2018-11-18 15:38:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 15:38:54,363 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 15:38:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1061 states and 1318 transitions. [2018-11-18 15:38:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1318 transitions. [2018-11-18 15:38:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 15:38:55,664 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 15:38:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1062 states and 1319 transitions. [2018-11-18 15:38:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1319 transitions. [2018-11-18 15:38:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 15:38:55,752 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 15:38:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1117 states and 1376 transitions. [2018-11-18 15:38:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1376 transitions. [2018-11-18 15:38:56,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 15:38:56,238 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 15:38:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1128 states and 1400 transitions. [2018-11-18 15:38:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1400 transitions. [2018-11-18 15:38:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 15:38:57,297 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 15:38:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1131 states and 1403 transitions. [2018-11-18 15:38:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1403 transitions. [2018-11-18 15:38:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 15:38:57,531 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 15:38:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1197 states and 1479 transitions. [2018-11-18 15:38:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1479 transitions. [2018-11-18 15:38:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 15:38:59,311 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 15:38:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:38:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1214 states and 1501 transitions. [2018-11-18 15:38:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1501 transitions. [2018-11-18 15:38:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 15:38:59,909 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:38:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 15:39:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1217 states and 1503 transitions. [2018-11-18 15:39:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1503 transitions. [2018-11-18 15:39:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 15:39:00,182 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 15:39:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1226 states and 1513 transitions. [2018-11-18 15:39:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1513 transitions. [2018-11-18 15:39:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 15:39:00,571 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 15:39:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1232 states and 1525 transitions. [2018-11-18 15:39:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1525 transitions. [2018-11-18 15:39:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-18 15:39:01,073 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:39:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1247 states and 1546 transitions. [2018-11-18 15:39:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1546 transitions. [2018-11-18 15:39:01,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-18 15:39:01,975 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:39:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1251 states and 1554 transitions. [2018-11-18 15:39:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1554 transitions. [2018-11-18 15:39:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 15:39:02,185 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 15:39:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1267 states and 1570 transitions. [2018-11-18 15:39:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1570 transitions. [2018-11-18 15:39:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 15:39:02,432 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 15:39:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1274 states and 1577 transitions. [2018-11-18 15:39:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1577 transitions. [2018-11-18 15:39:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 15:39:02,667 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:02,691 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 15:39:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1281 states and 1583 transitions. [2018-11-18 15:39:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1583 transitions. [2018-11-18 15:39:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 15:39:03,020 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:39:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1333 states and 1655 transitions. [2018-11-18 15:39:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1655 transitions. [2018-11-18 15:39:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 15:39:07,105 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:39:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1340 states and 1664 transitions. [2018-11-18 15:39:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1664 transitions. [2018-11-18 15:39:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 15:39:07,934 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 15:39:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1350 states and 1680 transitions. [2018-11-18 15:39:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1680 transitions. [2018-11-18 15:39:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-18 15:39:09,066 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 15:39:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1408 states and 1739 transitions. [2018-11-18 15:39:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1739 transitions. [2018-11-18 15:39:09,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-18 15:39:09,548 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 15:39:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1465 states and 1799 transitions. [2018-11-18 15:39:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1799 transitions. [2018-11-18 15:39:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-18 15:39:10,195 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:39:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1473 states and 1808 transitions. [2018-11-18 15:39:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1808 transitions. [2018-11-18 15:39:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-18 15:39:10,432 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-18 15:39:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1488 states and 1829 transitions. [2018-11-18 15:39:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1829 transitions. [2018-11-18 15:39:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-18 15:39:11,503 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:39:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1521 states and 1867 transitions. [2018-11-18 15:39:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1867 transitions. [2018-11-18 15:39:12,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-18 15:39:12,352 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:39:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1528 states and 1874 transitions. [2018-11-18 15:39:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1874 transitions. [2018-11-18 15:39:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-18 15:39:12,855 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 15:39:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1533 states and 1885 transitions. [2018-11-18 15:39:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1885 transitions. [2018-11-18 15:39:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-18 15:39:14,363 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 15:39:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1536 states and 1889 transitions. [2018-11-18 15:39:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1889 transitions. [2018-11-18 15:39:14,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 15:39:14,770 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:39:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1573 states and 1930 transitions. [2018-11-18 15:39:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1930 transitions. [2018-11-18 15:39:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 15:39:16,616 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:39:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1578 states and 1935 transitions. [2018-11-18 15:39:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1935 transitions. [2018-11-18 15:39:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 15:39:17,197 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-18 15:39:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1591 states and 1950 transitions. [2018-11-18 15:39:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1950 transitions. [2018-11-18 15:39:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 15:39:18,167 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-18 15:39:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1596 states and 1956 transitions. [2018-11-18 15:39:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1956 transitions. [2018-11-18 15:39:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 15:39:18,442 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 15:39:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1615 states and 1975 transitions. [2018-11-18 15:39:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1975 transitions. [2018-11-18 15:39:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-18 15:39:18,627 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 15:39:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1630 states and 1994 transitions. [2018-11-18 15:39:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1994 transitions. [2018-11-18 15:39:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-18 15:39:19,142 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 15:39:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 1640 states and 2004 transitions. [2018-11-18 15:39:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2004 transitions. [2018-11-18 15:39:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-18 15:39:19,546 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 15:39:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 1642 states and 2005 transitions. [2018-11-18 15:39:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2005 transitions. [2018-11-18 15:39:19,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 15:39:19,847 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 15:39:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 1652 states and 2017 transitions. [2018-11-18 15:39:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2017 transitions. [2018-11-18 15:39:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 15:39:20,250 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:39:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 1657 states and 2023 transitions. [2018-11-18 15:39:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2023 transitions. [2018-11-18 15:39:20,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-18 15:39:20,612 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 15:39:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 1667 states and 2036 transitions. [2018-11-18 15:39:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2036 transitions. [2018-11-18 15:39:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-18 15:39:21,220 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 15:39:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1668 states and 2037 transitions. [2018-11-18 15:39:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2037 transitions. [2018-11-18 15:39:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 15:39:21,520 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 15:39:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 1681 states and 2051 transitions. [2018-11-18 15:39:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2051 transitions. [2018-11-18 15:39:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 15:39:21,827 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 15:39:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 1682 states and 2052 transitions. [2018-11-18 15:39:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2052 transitions. [2018-11-18 15:39:22,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 15:39:22,116 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 15:39:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 1687 states and 2057 transitions. [2018-11-18 15:39:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2057 transitions. [2018-11-18 15:39:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 15:39:22,304 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-18 15:39:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 1775 states and 2148 transitions. [2018-11-18 15:39:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2148 transitions. [2018-11-18 15:39:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 15:39:23,264 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:39:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 1777 states and 2149 transitions. [2018-11-18 15:39:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2149 transitions. [2018-11-18 15:39:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 15:39:23,801 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 191 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 15:39:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1801 states and 2174 transitions. [2018-11-18 15:39:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2174 transitions. [2018-11-18 15:39:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 15:39:24,433 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 15:39:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 1832 states and 2221 transitions. [2018-11-18 15:39:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2221 transitions. [2018-11-18 15:39:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 15:39:26,191 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 15:39:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 1837 states and 2225 transitions. [2018-11-18 15:39:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2225 transitions. [2018-11-18 15:39:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 15:39:26,564 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 15:39:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 1844 states and 2232 transitions. [2018-11-18 15:39:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2232 transitions. [2018-11-18 15:39:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 15:39:26,910 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 15:39:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 1869 states and 2264 transitions. [2018-11-18 15:39:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2264 transitions. [2018-11-18 15:39:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 15:39:27,979 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 15:39:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 1881 states and 2278 transitions. [2018-11-18 15:39:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2278 transitions. [2018-11-18 15:39:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 15:39:28,443 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 15:39:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1882 states and 2279 transitions. [2018-11-18 15:39:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2279 transitions. [2018-11-18 15:39:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-18 15:39:28,580 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 15:39:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 1883 states and 2281 transitions. [2018-11-18 15:39:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2281 transitions. [2018-11-18 15:39:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 15:39:28,671 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 15:39:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 1906 states and 2308 transitions. [2018-11-18 15:39:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2308 transitions. [2018-11-18 15:39:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 15:39:29,999 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 15:39:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1917 states and 2318 transitions. [2018-11-18 15:39:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2318 transitions. [2018-11-18 15:39:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 15:39:30,745 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 15:39:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 1965 states and 2366 transitions. [2018-11-18 15:39:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2366 transitions. [2018-11-18 15:39:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 15:39:34,898 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:39:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 1980 states and 2385 transitions. [2018-11-18 15:39:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2385 transitions. [2018-11-18 15:39:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 15:39:35,492 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:39:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2011 states and 2416 transitions. [2018-11-18 15:39:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2416 transitions. [2018-11-18 15:39:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-18 15:39:37,668 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 15:39:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2054 states and 2462 transitions. [2018-11-18 15:39:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2462 transitions. [2018-11-18 15:39:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-18 15:39:38,566 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 15:39:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2071 states and 2478 transitions. [2018-11-18 15:39:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2478 transitions. [2018-11-18 15:39:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-18 15:39:39,128 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 15:39:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2084 states and 2490 transitions. [2018-11-18 15:39:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2490 transitions. [2018-11-18 15:39:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-18 15:39:39,348 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 15:39:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2115 states and 2520 transitions. [2018-11-18 15:39:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2520 transitions. [2018-11-18 15:39:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-18 15:39:40,642 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-18 15:39:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2139 states and 2545 transitions. [2018-11-18 15:39:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2545 transitions. [2018-11-18 15:39:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-18 15:39:41,255 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:39:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2217 states and 2635 transitions. [2018-11-18 15:39:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2635 transitions. [2018-11-18 15:39:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-18 15:39:44,820 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 191 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:39:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2229 states and 2655 transitions. [2018-11-18 15:39:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2655 transitions. [2018-11-18 15:39:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-18 15:39:47,272 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:39:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2236 states and 2666 transitions. [2018-11-18 15:39:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2666 transitions. [2018-11-18 15:39:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 15:39:47,347 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 203 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:39:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2248 states and 2683 transitions. [2018-11-18 15:39:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 2683 transitions. [2018-11-18 15:39:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-18 15:39:50,131 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 175 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:39:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2323 states and 2766 transitions. [2018-11-18 15:39:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 2766 transitions. [2018-11-18 15:39:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 15:39:52,676 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-18 15:39:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2332 states and 2781 transitions. [2018-11-18 15:39:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2781 transitions. [2018-11-18 15:39:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 15:39:53,751 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-18 15:39:54,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2335 states and 2783 transitions. [2018-11-18 15:39:54,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 2783 transitions. [2018-11-18 15:39:54,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 15:39:54,141 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-18 15:39:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:55,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2355 states and 2806 transitions. [2018-11-18 15:39:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 2806 transitions. [2018-11-18 15:39:55,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 15:39:55,053 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-18 15:39:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2366 states and 2816 transitions. [2018-11-18 15:39:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 2816 transitions. [2018-11-18 15:39:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-18 15:39:55,828 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-18 15:39:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2437 states and 2890 transitions. [2018-11-18 15:39:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 2890 transitions. [2018-11-18 15:39:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-18 15:39:56,867 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-18 15:39:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2495 states and 2951 transitions. [2018-11-18 15:39:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2951 transitions. [2018-11-18 15:39:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-18 15:39:59,675 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:39:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-18 15:39:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:39:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2516 states and 2971 transitions. [2018-11-18 15:39:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 2971 transitions. [2018-11-18 15:39:59,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 15:39:59,995 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-18 15:40:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 2538 states and 3000 transitions. [2018-11-18 15:40:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3000 transitions. [2018-11-18 15:40:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 15:40:01,557 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-18 15:40:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 2564 states and 3026 transitions. [2018-11-18 15:40:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3026 transitions. [2018-11-18 15:40:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 15:40:02,706 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-18 15:40:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 2632 states and 3098 transitions. [2018-11-18 15:40:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 3098 transitions. [2018-11-18 15:40:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 15:40:04,491 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-18 15:40:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 2643 states and 3108 transitions. [2018-11-18 15:40:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3108 transitions. [2018-11-18 15:40:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 15:40:05,026 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-18 15:40:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 2644 states and 3108 transitions. [2018-11-18 15:40:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3108 transitions. [2018-11-18 15:40:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-18 15:40:05,321 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-11-18 15:40:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 2645 states and 3109 transitions. [2018-11-18 15:40:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3109 transitions. [2018-11-18 15:40:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-18 15:40:05,603 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-11-18 15:40:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 2657 states and 3122 transitions. [2018-11-18 15:40:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3122 transitions. [2018-11-18 15:40:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-18 15:40:06,404 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-11-18 15:40:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 2659 states and 3123 transitions. [2018-11-18 15:40:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 3123 transitions. [2018-11-18 15:40:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-18 15:40:06,830 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:40:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 2702 states and 3180 transitions. [2018-11-18 15:40:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3180 transitions. [2018-11-18 15:40:10,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-18 15:40:10,762 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:40:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 2732 states and 3212 transitions. [2018-11-18 15:40:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3212 transitions. [2018-11-18 15:40:12,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-18 15:40:12,558 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:40:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 2746 states and 3230 transitions. [2018-11-18 15:40:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 3230 transitions. [2018-11-18 15:40:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-18 15:40:13,663 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:40:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 2748 states and 3231 transitions. [2018-11-18 15:40:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3231 transitions. [2018-11-18 15:40:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-18 15:40:14,131 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:40:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 2750 states and 3235 transitions. [2018-11-18 15:40:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3235 transitions. [2018-11-18 15:40:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-18 15:40:14,620 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 161 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:40:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3283 states to 2792 states and 3283 transitions. [2018-11-18 15:40:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3283 transitions. [2018-11-18 15:40:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-18 15:40:18,268 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 161 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:40:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 2797 states and 3287 transitions. [2018-11-18 15:40:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3287 transitions. [2018-11-18 15:40:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-18 15:40:18,798 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 161 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:40:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 2812 states and 3306 transitions. [2018-11-18 15:40:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3306 transitions. [2018-11-18 15:40:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-18 15:40:19,792 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 161 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:40:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 2814 states and 3308 transitions. [2018-11-18 15:40:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3308 transitions. [2018-11-18 15:40:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-18 15:40:20,332 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 74 proven. 194 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 15:40:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:40:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 2825 states and 3325 transitions. [2018-11-18 15:40:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3325 transitions. [2018-11-18 15:40:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-18 15:40:22,667 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:40:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:22,887 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 160 iterations. [2018-11-18 15:40:23,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 03:40:23 ImpRootNode [2018-11-18 15:40:23,023 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 15:40:23,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:40:23,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:40:23,023 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:40:23,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:38:32" (3/4) ... [2018-11-18 15:40:23,027 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 15:40:23,125 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_03d74ff6-fb1b-47e1-8c63-96536b89e9f3/bin-2019/ukojak/witness.graphml [2018-11-18 15:40:23,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:40:23,126 INFO L168 Benchmark]: Toolchain (without parser) took 112705.73 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 952.8 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 517.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:23,126 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:40:23,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.14 ms. Allocated memory is still 1.0 GB. Free memory was 952.8 MB in the beginning and 920.6 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:23,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 920.6 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:23,127 INFO L168 Benchmark]: Boogie Preprocessor took 40.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:23,127 INFO L168 Benchmark]: RCFGBuilder took 1282.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.6 MB in the end (delta: 225.9 MB). Peak memory consumption was 225.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:23,127 INFO L168 Benchmark]: CodeCheck took 110820.27 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 893.6 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 269.3 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:23,128 INFO L168 Benchmark]: Witness Printer took 101.84 ms. Allocated memory is still 3.8 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:23,129 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 199 locations, 1 error locations. UNSAFE Result, 110.6s OverallTime, 160 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1818363972 SDtfs, -2125478176 SDslu, 1662009888 SDs, 0 SdLazy, 667032372 SolverSat, -191483468 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 510.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166960 GetRequests, 163270 SyntacticMatches, 2260 SemanticMatches, 1430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1461901 ImplicationChecksByTransitivity, 94.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.5s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 24744 NumberOfCodeBlocks, 24744 NumberOfCodeBlocksAsserted, 160 NumberOfCheckSat, 24345 ConstructedInterpolants, 0 QuantifiedInterpolants, 12672434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 159 InterpolantComputations, 130 PerfectInterpolantSequences, 19373/20354 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: 422]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=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] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=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] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=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] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=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] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=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] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=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] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=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] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=6, a17=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] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=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] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=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] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=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] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=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] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=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] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=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] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=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] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=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] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=6, a17=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] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=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] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=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] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=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] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=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] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=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] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=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] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=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] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=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] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=6, a17=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] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=6, a17=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] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=6, a17=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] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=6, a17=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] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=6, a17=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] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=6, a17=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] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=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] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=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] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=6, a17=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] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=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] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=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] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=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] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=6, a17=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] [L278] COND TRUE (((((((!(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)) [L279] a20 = 1 [L280] a8 = 13 [L281] a16 = 4 [L282] a7 = 0 [L283] a21 = 1 [L284] a17 = 0 [L285] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L421] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L422] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.14 ms. Allocated memory is still 1.0 GB. Free memory was 952.8 MB in the beginning and 920.6 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 920.6 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1282.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.6 MB in the end (delta: 225.9 MB). Peak memory consumption was 225.9 MB. Max. memory is 11.5 GB. * CodeCheck took 110820.27 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 893.6 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 269.3 MB. Max. memory is 11.5 GB. * Witness Printer took 101.84 ms. Allocated memory is still 3.8 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...