./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label50_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_efedc9cf-3763-4cc9-a02b-6626f99257bf/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/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 c88dc41bb0c5752717ba5895f8d33afd40276a61 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:53:15,526 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:53:15,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:53:15,535 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:53:15,535 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:53:15,536 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:53:15,537 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:53:15,538 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:53:15,540 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:53:15,540 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:53:15,541 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:53:15,541 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:53:15,542 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:53:15,543 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:53:15,544 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:53:15,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:53:15,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:53:15,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:53:15,548 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:53:15,549 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:53:15,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:53:15,550 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:53:15,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:53:15,552 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:53:15,552 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:53:15,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:53:15,554 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:53:15,555 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:53:15,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:53:15,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:53:15,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:53:15,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:53:15,557 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:53:15,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:53:15,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:53:15,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:53:15,558 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 17:53:15,569 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:53:15,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:53:15,570 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:53:15,570 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 17:53:15,571 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 17:53:15,571 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 17:53:15,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:53:15,571 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:53:15,571 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:53:15,571 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:53:15,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:53:15,572 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:53:15,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:53:15,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:53:15,572 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:53:15,572 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:53:15,572 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:53:15,572 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:53:15,573 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 17:53:15,573 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 17:53:15,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:53:15,573 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:53:15,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 17:53:15,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:53:15,574 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:53:15,574 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:53:15,574 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 17:53:15,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:53:15,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:53:15,574 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_efedc9cf-3763-4cc9-a02b-6626f99257bf/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 -> c88dc41bb0c5752717ba5895f8d33afd40276a61 [2018-11-18 17:53:15,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:53:15,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:53:15,610 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:53:15,612 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:53:15,612 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:53:15,612 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c [2018-11-18 17:53:15,651 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/bin-2019/ukojak/data/15c06a1f2/416fe68a702043cd9eb5b043e5b77c20/FLAG7560167c5 [2018-11-18 17:53:16,028 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:53:16,028 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c [2018-11-18 17:53:16,037 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/bin-2019/ukojak/data/15c06a1f2/416fe68a702043cd9eb5b043e5b77c20/FLAG7560167c5 [2018-11-18 17:53:16,413 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/bin-2019/ukojak/data/15c06a1f2/416fe68a702043cd9eb5b043e5b77c20 [2018-11-18 17:53:16,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:53:16,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:53:16,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:53:16,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:53:16,420 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:53:16,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:53:16" (1/1) ... [2018-11-18 17:53:16,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac16c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:16, skipping insertion in model container [2018-11-18 17:53:16,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:53:16" (1/1) ... [2018-11-18 17:53:16,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:53:16,459 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:53:16,713 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:53:16,717 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:53:16,781 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:53:16,794 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:53:16,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:16 WrapperNode [2018-11-18 17:53:16,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:53:16,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:53:16,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:53:16,795 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:53:16,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:16" (1/1) ... [2018-11-18 17:53:16,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:16" (1/1) ... [2018-11-18 17:53:16,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:53:16,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:53:16,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:53:16,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:53:16,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:16" (1/1) ... [2018-11-18 17:53:16,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:16" (1/1) ... [2018-11-18 17:53:16,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:16" (1/1) ... [2018-11-18 17:53:16,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:16" (1/1) ... [2018-11-18 17:53:16,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:16" (1/1) ... [2018-11-18 17:53:16,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:16" (1/1) ... [2018-11-18 17:53:16,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:16" (1/1) ... [2018-11-18 17:53:16,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:53:16,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:53:16,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:53:16,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:53:16,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/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 17:53:16,981 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 17:53:16,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:53:16,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:53:18,429 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:53:18,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:53:18 BoogieIcfgContainer [2018-11-18 17:53:18,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:53:18,430 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 17:53:18,431 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 17:53:18,439 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 17:53:18,440 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:53:18" (1/1) ... [2018-11-18 17:53:18,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:53:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-11-18 17:53:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-11-18 17:53:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 17:53:18,486 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:18,720 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 17:53:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 165 states and 244 transitions. [2018-11-18 17:53:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2018-11-18 17:53:19,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-18 17:53:19,126 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:19,203 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 17:53:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 245 states and 339 transitions. [2018-11-18 17:53:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 339 transitions. [2018-11-18 17:53:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 17:53:19,538 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:19,584 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 17:53:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 250 states and 345 transitions. [2018-11-18 17:53:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 345 transitions. [2018-11-18 17:53:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 17:53:19,689 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 260 states and 360 transitions. [2018-11-18 17:53:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 360 transitions. [2018-11-18 17:53:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-18 17:53:19,827 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 263 states and 363 transitions. [2018-11-18 17:53:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 363 transitions. [2018-11-18 17:53:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 17:53:19,871 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 268 states and 370 transitions. [2018-11-18 17:53:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2018-11-18 17:53:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 17:53:20,037 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 17:53:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 273 states and 376 transitions. [2018-11-18 17:53:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 376 transitions. [2018-11-18 17:53:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-18 17:53:20,271 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 291 states and 402 transitions. [2018-11-18 17:53:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 402 transitions. [2018-11-18 17:53:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 17:53:20,561 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 17:53:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 292 states and 404 transitions. [2018-11-18 17:53:20,655 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 404 transitions. [2018-11-18 17:53:20,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 17:53:20,656 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 17:53:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 296 states and 408 transitions. [2018-11-18 17:53:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 408 transitions. [2018-11-18 17:53:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 17:53:20,747 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:20,766 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 17:53:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 300 states and 413 transitions. [2018-11-18 17:53:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 413 transitions. [2018-11-18 17:53:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 17:53:20,826 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:20,916 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 17:53:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 324 states and 445 transitions. [2018-11-18 17:53:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 445 transitions. [2018-11-18 17:53:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 17:53:21,444 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 326 states and 447 transitions. [2018-11-18 17:53:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 447 transitions. [2018-11-18 17:53:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 17:53:21,532 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 17:53:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 406 states and 530 transitions. [2018-11-18 17:53:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 530 transitions. [2018-11-18 17:53:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 17:53:22,112 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:22,205 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 17:53:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 429 states and 561 transitions. [2018-11-18 17:53:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 561 transitions. [2018-11-18 17:53:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 17:53:22,844 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:22,909 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 17:53:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 433 states and 565 transitions. [2018-11-18 17:53:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 565 transitions. [2018-11-18 17:53:23,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 17:53:23,006 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:23,065 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 17:53:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 437 states and 569 transitions. [2018-11-18 17:53:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 569 transitions. [2018-11-18 17:53:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 17:53:23,160 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 471 states and 616 transitions. [2018-11-18 17:53:24,442 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 616 transitions. [2018-11-18 17:53:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 17:53:24,443 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 475 states and 620 transitions. [2018-11-18 17:53:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 620 transitions. [2018-11-18 17:53:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 17:53:24,646 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 17:53:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 477 states and 622 transitions. [2018-11-18 17:53:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 622 transitions. [2018-11-18 17:53:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 17:53:24,760 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 491 states and 642 transitions. [2018-11-18 17:53:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 642 transitions. [2018-11-18 17:53:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 17:53:25,041 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 17:53:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 498 states and 649 transitions. [2018-11-18 17:53:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 649 transitions. [2018-11-18 17:53:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 17:53:25,088 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 502 states and 653 transitions. [2018-11-18 17:53:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 653 transitions. [2018-11-18 17:53:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 17:53:25,193 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 17:53:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 509 states and 661 transitions. [2018-11-18 17:53:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 661 transitions. [2018-11-18 17:53:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 17:53:25,454 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 17:53:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 513 states and 668 transitions. [2018-11-18 17:53:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 668 transitions. [2018-11-18 17:53:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 17:53:25,643 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 537 states and 700 transitions. [2018-11-18 17:53:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 700 transitions. [2018-11-18 17:53:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 17:53:26,803 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 543 states and 706 transitions. [2018-11-18 17:53:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 706 transitions. [2018-11-18 17:53:27,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 17:53:27,142 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 547 states and 709 transitions. [2018-11-18 17:53:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 709 transitions. [2018-11-18 17:53:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 17:53:27,323 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 17:53:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 548 states and 710 transitions. [2018-11-18 17:53:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 710 transitions. [2018-11-18 17:53:27,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 17:53:27,364 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:53:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 549 states and 711 transitions. [2018-11-18 17:53:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 711 transitions. [2018-11-18 17:53:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 17:53:27,418 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 17:53:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 570 states and 733 transitions. [2018-11-18 17:53:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 733 transitions. [2018-11-18 17:53:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 17:53:27,789 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 589 states and 759 transitions. [2018-11-18 17:53:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 759 transitions. [2018-11-18 17:53:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 17:53:28,938 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:29,006 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 593 states and 763 transitions. [2018-11-18 17:53:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 763 transitions. [2018-11-18 17:53:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 17:53:29,198 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 609 states and 781 transitions. [2018-11-18 17:53:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 781 transitions. [2018-11-18 17:53:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 17:53:29,270 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 17:53:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 618 states and 791 transitions. [2018-11-18 17:53:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 791 transitions. [2018-11-18 17:53:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 17:53:29,405 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 620 states and 793 transitions. [2018-11-18 17:53:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 793 transitions. [2018-11-18 17:53:29,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-18 17:53:29,435 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 17:53:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 622 states and 794 transitions. [2018-11-18 17:53:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 794 transitions. [2018-11-18 17:53:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-18 17:53:29,470 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 17:53:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 629 states and 804 transitions. [2018-11-18 17:53:29,924 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 804 transitions. [2018-11-18 17:53:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-18 17:53:29,924 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 17:53:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 633 states and 809 transitions. [2018-11-18 17:53:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 809 transitions. [2018-11-18 17:53:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 17:53:30,130 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:53:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 637 states and 815 transitions. [2018-11-18 17:53:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 815 transitions. [2018-11-18 17:53:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 17:53:30,390 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 639 states and 817 transitions. [2018-11-18 17:53:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 817 transitions. [2018-11-18 17:53:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 17:53:30,422 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:53:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 640 states and 818 transitions. [2018-11-18 17:53:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 818 transitions. [2018-11-18 17:53:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-18 17:53:30,459 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:30,536 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-18 17:53:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 692 states and 877 transitions. [2018-11-18 17:53:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 877 transitions. [2018-11-18 17:53:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-18 17:53:31,284 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:53:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 693 states and 878 transitions. [2018-11-18 17:53:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 878 transitions. [2018-11-18 17:53:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 17:53:31,330 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 17:53:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 699 states and 885 transitions. [2018-11-18 17:53:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 885 transitions. [2018-11-18 17:53:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 17:53:31,571 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:53:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 700 states and 887 transitions. [2018-11-18 17:53:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 887 transitions. [2018-11-18 17:53:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-18 17:53:31,812 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 17:53:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 706 states and 892 transitions. [2018-11-18 17:53:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 892 transitions. [2018-11-18 17:53:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-18 17:53:31,972 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 17:53:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 712 states and 899 transitions. [2018-11-18 17:53:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 899 transitions. [2018-11-18 17:53:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 17:53:32,353 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:53:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 730 states and 920 transitions. [2018-11-18 17:53:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 920 transitions. [2018-11-18 17:53:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 17:53:32,970 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 17:53:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 734 states and 923 transitions. [2018-11-18 17:53:33,004 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 923 transitions. [2018-11-18 17:53:33,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 17:53:33,005 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 763 states and 955 transitions. [2018-11-18 17:53:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 955 transitions. [2018-11-18 17:53:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-18 17:53:33,222 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:53:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 782 states and 977 transitions. [2018-11-18 17:53:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 977 transitions. [2018-11-18 17:53:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-18 17:53:33,919 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:33,996 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:53:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 783 states and 978 transitions. [2018-11-18 17:53:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 978 transitions. [2018-11-18 17:53:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-18 17:53:34,034 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 17:53:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 789 states and 983 transitions. [2018-11-18 17:53:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 983 transitions. [2018-11-18 17:53:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 17:53:34,243 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 811 states and 1013 transitions. [2018-11-18 17:53:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1013 transitions. [2018-11-18 17:53:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 17:53:35,362 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 815 states and 1017 transitions. [2018-11-18 17:53:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1017 transitions. [2018-11-18 17:53:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 17:53:35,617 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:53:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 818 states and 1020 transitions. [2018-11-18 17:53:35,668 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1020 transitions. [2018-11-18 17:53:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 17:53:35,669 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:35,741 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 17:53:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 843 states and 1046 transitions. [2018-11-18 17:53:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1046 transitions. [2018-11-18 17:53:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 17:53:36,476 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:53:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 861 states and 1063 transitions. [2018-11-18 17:53:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1063 transitions. [2018-11-18 17:53:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 17:53:37,214 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 878 states and 1087 transitions. [2018-11-18 17:53:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1087 transitions. [2018-11-18 17:53:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 17:53:37,956 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 882 states and 1091 transitions. [2018-11-18 17:53:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1091 transitions. [2018-11-18 17:53:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 17:53:38,175 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 886 states and 1095 transitions. [2018-11-18 17:53:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1095 transitions. [2018-11-18 17:53:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 17:53:38,403 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 904 states and 1117 transitions. [2018-11-18 17:53:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1117 transitions. [2018-11-18 17:53:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 17:53:39,092 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 910 states and 1122 transitions. [2018-11-18 17:53:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1122 transitions. [2018-11-18 17:53:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-18 17:53:39,572 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-18 17:53:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1007 states and 1222 transitions. [2018-11-18 17:53:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1222 transitions. [2018-11-18 17:53:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-18 17:53:40,175 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-18 17:53:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1008 states and 1222 transitions. [2018-11-18 17:53:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1222 transitions. [2018-11-18 17:53:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 17:53:40,242 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1030 states and 1245 transitions. [2018-11-18 17:53:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1245 transitions. [2018-11-18 17:53:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-18 17:53:40,592 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-18 17:53:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1035 states and 1250 transitions. [2018-11-18 17:53:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1250 transitions. [2018-11-18 17:53:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-18 17:53:40,900 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1047 states and 1265 transitions. [2018-11-18 17:53:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1265 transitions. [2018-11-18 17:53:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-18 17:53:41,543 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1051 states and 1270 transitions. [2018-11-18 17:53:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1270 transitions. [2018-11-18 17:53:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 17:53:41,677 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 17:53:42,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1068 states and 1290 transitions. [2018-11-18 17:53:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1290 transitions. [2018-11-18 17:53:42,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 17:53:42,282 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 17:53:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1074 states and 1296 transitions. [2018-11-18 17:53:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1296 transitions. [2018-11-18 17:53:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 17:53:42,494 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 17:53:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1078 states and 1299 transitions. [2018-11-18 17:53:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1299 transitions. [2018-11-18 17:53:42,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-18 17:53:42,738 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1094 states and 1325 transitions. [2018-11-18 17:53:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1325 transitions. [2018-11-18 17:53:44,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-18 17:53:44,592 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 17:53:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1107 states and 1337 transitions. [2018-11-18 17:53:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1337 transitions. [2018-11-18 17:53:44,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-18 17:53:44,749 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1115 states and 1346 transitions. [2018-11-18 17:53:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1346 transitions. [2018-11-18 17:53:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 17:53:45,200 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 17:53:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1116 states and 1346 transitions. [2018-11-18 17:53:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1346 transitions. [2018-11-18 17:53:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-18 17:53:45,386 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1141 states and 1371 transitions. [2018-11-18 17:53:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1371 transitions. [2018-11-18 17:53:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 17:53:46,267 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 17:53:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1147 states and 1376 transitions. [2018-11-18 17:53:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1376 transitions. [2018-11-18 17:53:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 17:53:46,377 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 17:53:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1186 states and 1420 transitions. [2018-11-18 17:53:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1420 transitions. [2018-11-18 17:53:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 17:53:47,348 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 17:53:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1200 states and 1434 transitions. [2018-11-18 17:53:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1434 transitions. [2018-11-18 17:53:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 17:53:47,425 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 17:53:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1206 states and 1439 transitions. [2018-11-18 17:53:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1439 transitions. [2018-11-18 17:53:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 17:53:47,668 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-18 17:53:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1209 states and 1441 transitions. [2018-11-18 17:53:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1441 transitions. [2018-11-18 17:53:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 17:53:47,805 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 17:53:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1220 states and 1458 transitions. [2018-11-18 17:53:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1458 transitions. [2018-11-18 17:53:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 17:53:48,831 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 17:53:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1224 states and 1463 transitions. [2018-11-18 17:53:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1463 transitions. [2018-11-18 17:53:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 17:53:49,067 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:53:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1255 states and 1494 transitions. [2018-11-18 17:53:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1494 transitions. [2018-11-18 17:53:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-18 17:53:49,284 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-18 17:53:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:49,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1283 states and 1523 transitions. [2018-11-18 17:53:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1523 transitions. [2018-11-18 17:53:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-18 17:53:49,517 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1303 states and 1547 transitions. [2018-11-18 17:53:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1547 transitions. [2018-11-18 17:53:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 17:53:49,919 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 17:53:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1308 states and 1556 transitions. [2018-11-18 17:53:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1556 transitions. [2018-11-18 17:53:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-18 17:53:50,639 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-18 17:53:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1311 states and 1558 transitions. [2018-11-18 17:53:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1558 transitions. [2018-11-18 17:53:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-18 17:53:50,794 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 104 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 17:53:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1342 states and 1592 transitions. [2018-11-18 17:53:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1592 transitions. [2018-11-18 17:53:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-18 17:53:51,647 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 104 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 17:53:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1346 states and 1596 transitions. [2018-11-18 17:53:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1596 transitions. [2018-11-18 17:53:51,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-18 17:53:51,910 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 126 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-18 17:53:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1408 states and 1663 transitions. [2018-11-18 17:53:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1663 transitions. [2018-11-18 17:53:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-18 17:53:53,474 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 17:53:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1423 states and 1678 transitions. [2018-11-18 17:53:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1678 transitions. [2018-11-18 17:53:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-18 17:53:53,577 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 56 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-18 17:53:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1434 states and 1692 transitions. [2018-11-18 17:53:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1692 transitions. [2018-11-18 17:53:54,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-18 17:53:54,366 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 120 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1459 states and 1721 transitions. [2018-11-18 17:53:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1721 transitions. [2018-11-18 17:53:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-18 17:53:55,162 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 120 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1463 states and 1725 transitions. [2018-11-18 17:53:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1725 transitions. [2018-11-18 17:53:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-18 17:53:55,464 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 120 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1467 states and 1729 transitions. [2018-11-18 17:53:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1729 transitions. [2018-11-18 17:53:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-18 17:53:55,789 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-18 17:53:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1484 states and 1745 transitions. [2018-11-18 17:53:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1745 transitions. [2018-11-18 17:53:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-18 17:53:55,969 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 17:53:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1500 states and 1767 transitions. [2018-11-18 17:53:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1767 transitions. [2018-11-18 17:53:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-18 17:53:56,766 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 17:53:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1509 states and 1776 transitions. [2018-11-18 17:53:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1776 transitions. [2018-11-18 17:53:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-18 17:53:57,242 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1524 states and 1795 transitions. [2018-11-18 17:53:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1795 transitions. [2018-11-18 17:53:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-18 17:53:58,375 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:53:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1547 states and 1817 transitions. [2018-11-18 17:53:58,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1817 transitions. [2018-11-18 17:53:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-18 17:53:58,803 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:53:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1585 states and 1857 transitions. [2018-11-18 17:53:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 1857 transitions. [2018-11-18 17:53:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 17:53:59,068 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-18 17:53:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1586 states and 1857 transitions. [2018-11-18 17:53:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1857 transitions. [2018-11-18 17:53:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 17:53:59,131 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 17:53:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:53:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1589 states and 1859 transitions. [2018-11-18 17:53:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1859 transitions. [2018-11-18 17:53:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-18 17:53:59,286 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:53:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:53:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:53:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:53:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:53:59,514 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 107 iterations. [2018-11-18 17:53:59,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 05:53:59 ImpRootNode [2018-11-18 17:53:59,639 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 17:53:59,640 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:53:59,640 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:53:59,640 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:53:59,640 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:53:18" (3/4) ... [2018-11-18 17:53:59,644 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 17:53:59,775 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_efedc9cf-3763-4cc9-a02b-6626f99257bf/bin-2019/ukojak/witness.graphml [2018-11-18 17:53:59,775 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:53:59,775 INFO L168 Benchmark]: Toolchain (without parser) took 43359.74 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 956.4 MB in the beginning and 1.5 GB in the end (delta: -592.1 MB). Peak memory consumption was 738.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:53:59,776 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:53:59,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.49 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 916.1 MB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:53:59,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 916.1 MB in the beginning and 1.2 GB in the end (delta: -237.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:53:59,777 INFO L168 Benchmark]: Boogie Preprocessor took 43.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:53:59,779 INFO L168 Benchmark]: RCFGBuilder took 1490.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 903.0 MB in the end (delta: 246.9 MB). Peak memory consumption was 246.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:53:59,780 INFO L168 Benchmark]: CodeCheck took 41208.94 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 903.0 MB in the beginning and 1.6 GB in the end (delta: -674.4 MB). Peak memory consumption was 492.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:53:59,780 INFO L168 Benchmark]: Witness Printer took 135.24 ms. Allocated memory is still 2.4 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:53:59,782 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 228 locations, 1 error locations. UNSAFE Result, 41.0s OverallTime, 107 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 294903232 SDtfs, 1968208808 SDslu, -1918696640 SDs, 0 SdLazy, -1871480536 SolverSat, 1899534840 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 206.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101263 GetRequests, 100017 SyntacticMatches, 564 SemanticMatches, 682 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312236 ImplicationChecksByTransitivity, 32.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 16114 NumberOfCodeBlocks, 16114 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 15794 ConstructedInterpolants, 0 QuantifiedInterpolants, 5072931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 106 InterpolantComputations, 88 PerfectInterpolantSequences, 10601/10760 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: 415]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] RET return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] RET return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L55] a28 = 7 [L56] a11 = 1 [L57] a25 = 0 [L58] RET return -1; VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L415] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.49 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 916.1 MB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 916.1 MB in the beginning and 1.2 GB in the end (delta: -237.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1490.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 903.0 MB in the end (delta: 246.9 MB). Peak memory consumption was 246.9 MB. Max. memory is 11.5 GB. * CodeCheck took 41208.94 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 903.0 MB in the beginning and 1.6 GB in the end (delta: -674.4 MB). Peak memory consumption was 492.6 MB. Max. memory is 11.5 GB. * Witness Printer took 135.24 ms. Allocated memory is still 2.4 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...