./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/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_e8b2688b-b9e4-4561-b20b-421390163449/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/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-1dbac8b [2018-11-10 08:49:21,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:49:21,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:49:21,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:49:21,667 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:49:21,667 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:49:21,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:49:21,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:49:21,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:49:21,671 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:49:21,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:49:21,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:49:21,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:49:21,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:49:21,674 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:49:21,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:49:21,675 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:49:21,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:49:21,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:49:21,678 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:49:21,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:49:21,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:49:21,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:49:21,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:49:21,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:49:21,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:49:21,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:49:21,683 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:49:21,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:49:21,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:49:21,684 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:49:21,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:49:21,685 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:49:21,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:49:21,686 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:49:21,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:49:21,686 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 08:49:21,695 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:49:21,695 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:49:21,695 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:49:21,696 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 08:49:21,696 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:49:21,696 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:49:21,696 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:49:21,696 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:49:21,697 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:49:21,697 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:49:21,697 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:49:21,697 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 08:49:21,697 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:49:21,697 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 08:49:21,697 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:49:21,698 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:49:21,698 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 08:49:21,698 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 08:49:21,698 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 08:49:21,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:49:21,698 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:49:21,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 08:49:21,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:49:21,699 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:49:21,699 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 08:49:21,699 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 08:49:21,699 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:49:21,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:49:21,699 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_e8b2688b-b9e4-4561-b20b-421390163449/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-10 08:49:21,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:49:21,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:49:21,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:49:21,734 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:49:21,734 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:49:21,734 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c [2018-11-10 08:49:21,770 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/bin-2019/ukojak/data/b2526f5a9/bfa41c077d9e484eb0a5e8e5fd43a669/FLAG5c25ec595 [2018-11-10 08:49:22,128 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:49:22,128 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c [2018-11-10 08:49:22,137 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/bin-2019/ukojak/data/b2526f5a9/bfa41c077d9e484eb0a5e8e5fd43a669/FLAG5c25ec595 [2018-11-10 08:49:22,149 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/bin-2019/ukojak/data/b2526f5a9/bfa41c077d9e484eb0a5e8e5fd43a669 [2018-11-10 08:49:22,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:49:22,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:49:22,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:49:22,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:49:22,156 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:49:22,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:49:22" (1/1) ... [2018-11-10 08:49:22,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:49:22, skipping insertion in model container [2018-11-10 08:49:22,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:49:22" (1/1) ... [2018-11-10 08:49:22,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:49:22,197 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:49:22,396 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:49:22,400 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:49:22,463 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:49:22,476 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:49:22,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:49:22 WrapperNode [2018-11-10 08:49:22,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:49:22,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:49:22,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:49:22,477 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:49:22,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:49:22" (1/1) ... [2018-11-10 08:49:22,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:49:22" (1/1) ... [2018-11-10 08:49:22,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:49:22,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:49:22,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:49:22,589 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:49:22,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:49:22" (1/1) ... [2018-11-10 08:49:22,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:49:22" (1/1) ... [2018-11-10 08:49:22,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:49:22" (1/1) ... [2018-11-10 08:49:22,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:49:22" (1/1) ... [2018-11-10 08:49:22,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:49:22" (1/1) ... [2018-11-10 08:49:22,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:49:22" (1/1) ... [2018-11-10 08:49:22,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:49:22" (1/1) ... [2018-11-10 08:49:22,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:49:22,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:49:22,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:49:22,632 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:49:22,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:49:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 08:49:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 08:49:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:49:22,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:49:24,163 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:49:24,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:49:24 BoogieIcfgContainer [2018-11-10 08:49:24,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:49:24,165 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 08:49:24,165 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 08:49:24,172 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 08:49:24,172 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:49:24" (1/1) ... [2018-11-10 08:49:24,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-11-10 08:49:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-11-10 08:49:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 08:49:24,235 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:49:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 165 states and 244 transitions. [2018-11-10 08:49:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2018-11-10 08:49:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 08:49:24,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:49:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 245 states and 339 transitions. [2018-11-10 08:49:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 339 transitions. [2018-11-10 08:49:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 08:49:25,275 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:49:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 250 states and 345 transitions. [2018-11-10 08:49:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 345 transitions. [2018-11-10 08:49:25,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 08:49:25,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:25,475 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-10 08:49:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 260 states and 360 transitions. [2018-11-10 08:49:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 360 transitions. [2018-11-10 08:49:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 08:49:25,591 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:25,609 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-10 08:49:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 263 states and 363 transitions. [2018-11-10 08:49:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 363 transitions. [2018-11-10 08:49:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 08:49:25,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:25,656 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-10 08:49:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 268 states and 370 transitions. [2018-11-10 08:49:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2018-11-10 08:49:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 08:49:25,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:25,783 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-10 08:49:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 273 states and 376 transitions. [2018-11-10 08:49:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 376 transitions. [2018-11-10 08:49:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 08:49:25,914 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:25,955 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-10 08:49:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 291 states and 402 transitions. [2018-11-10 08:49:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 402 transitions. [2018-11-10 08:49:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 08:49:26,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:26,124 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-10 08:49:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 292 states and 404 transitions. [2018-11-10 08:49:26,233 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 404 transitions. [2018-11-10 08:49:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 08:49:26,234 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:26,261 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-10 08:49:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 296 states and 408 transitions. [2018-11-10 08:49:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 408 transitions. [2018-11-10 08:49:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 08:49:26,350 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:26,378 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-10 08:49:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 300 states and 413 transitions. [2018-11-10 08:49:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 413 transitions. [2018-11-10 08:49:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 08:49:26,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:26,532 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-10 08:49:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 324 states and 445 transitions. [2018-11-10 08:49:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 445 transitions. [2018-11-10 08:49:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 08:49:26,960 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:26,976 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-10 08:49:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 326 states and 447 transitions. [2018-11-10 08:49:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 447 transitions. [2018-11-10 08:49:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 08:49:27,037 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:27,139 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-10 08:49:27,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 406 states and 530 transitions. [2018-11-10 08:49:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 530 transitions. [2018-11-10 08:49:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 08:49:27,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:27,649 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-10 08:49:28,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 429 states and 561 transitions. [2018-11-10 08:49:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 561 transitions. [2018-11-10 08:49:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 08:49:28,300 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:28,379 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-10 08:49:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 433 states and 565 transitions. [2018-11-10 08:49:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 565 transitions. [2018-11-10 08:49:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 08:49:28,488 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:28,563 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-10 08:49:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 437 states and 569 transitions. [2018-11-10 08:49:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 569 transitions. [2018-11-10 08:49:28,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 08:49:28,676 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:28,922 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-10 08:49:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 471 states and 616 transitions. [2018-11-10 08:49:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 616 transitions. [2018-11-10 08:49:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 08:49:29,982 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:30,039 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-10 08:49:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 475 states and 620 transitions. [2018-11-10 08:49:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 620 transitions. [2018-11-10 08:49:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 08:49:30,187 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:30,205 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-10 08:49:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 477 states and 622 transitions. [2018-11-10 08:49:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 622 transitions. [2018-11-10 08:49:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 08:49:30,307 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:30,333 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-10 08:49:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:30,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 491 states and 642 transitions. [2018-11-10 08:49:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 642 transitions. [2018-11-10 08:49:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 08:49:30,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:30,578 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-10 08:49:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 498 states and 649 transitions. [2018-11-10 08:49:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 649 transitions. [2018-11-10 08:49:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 08:49:30,614 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:30,643 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-10 08:49:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 502 states and 653 transitions. [2018-11-10 08:49:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 653 transitions. [2018-11-10 08:49:30,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 08:49:30,752 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:30,776 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-10 08:49:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 509 states and 661 transitions. [2018-11-10 08:49:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 661 transitions. [2018-11-10 08:49:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 08:49:31,070 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:31,092 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-10 08:49:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 513 states and 668 transitions. [2018-11-10 08:49:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 668 transitions. [2018-11-10 08:49:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 08:49:31,287 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:31,532 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-10 08:49:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 537 states and 700 transitions. [2018-11-10 08:49:32,524 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 700 transitions. [2018-11-10 08:49:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 08:49:32,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:32,570 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-10 08:49:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 543 states and 706 transitions. [2018-11-10 08:49:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 706 transitions. [2018-11-10 08:49:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 08:49:32,907 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:32,954 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-10 08:49:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 547 states and 709 transitions. [2018-11-10 08:49:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 709 transitions. [2018-11-10 08:49:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 08:49:33,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:33,185 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-10 08:49:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 548 states and 710 transitions. [2018-11-10 08:49:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 710 transitions. [2018-11-10 08:49:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 08:49:33,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:33,236 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-10 08:49:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 549 states and 711 transitions. [2018-11-10 08:49:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 711 transitions. [2018-11-10 08:49:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 08:49:33,254 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:33,372 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-10 08:49:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:33,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 570 states and 733 transitions. [2018-11-10 08:49:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 733 transitions. [2018-11-10 08:49:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 08:49:33,639 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:33,756 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-10 08:49:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 589 states and 759 transitions. [2018-11-10 08:49:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 759 transitions. [2018-11-10 08:49:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 08:49:34,625 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:34,711 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-10 08:49:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 593 states and 763 transitions. [2018-11-10 08:49:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 763 transitions. [2018-11-10 08:49:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 08:49:34,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:34,928 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-10 08:49:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 609 states and 781 transitions. [2018-11-10 08:49:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 781 transitions. [2018-11-10 08:49:34,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 08:49:34,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:35,008 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-10 08:49:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 618 states and 791 transitions. [2018-11-10 08:49:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 791 transitions. [2018-11-10 08:49:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 08:49:35,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:35,159 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-10 08:49:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 620 states and 793 transitions. [2018-11-10 08:49:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 793 transitions. [2018-11-10 08:49:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 08:49:35,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:35,208 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-10 08:49:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 622 states and 794 transitions. [2018-11-10 08:49:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 794 transitions. [2018-11-10 08:49:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 08:49:35,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:35,250 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-10 08:49:35,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 629 states and 804 transitions. [2018-11-10 08:49:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 804 transitions. [2018-11-10 08:49:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 08:49:35,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:35,661 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-10 08:49:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 633 states and 809 transitions. [2018-11-10 08:49:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 809 transitions. [2018-11-10 08:49:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 08:49:35,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:35,858 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-10 08:49:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 637 states and 815 transitions. [2018-11-10 08:49:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 815 transitions. [2018-11-10 08:49:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 08:49:36,053 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:36,079 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-10 08:49:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 639 states and 817 transitions. [2018-11-10 08:49:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 817 transitions. [2018-11-10 08:49:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 08:49:36,108 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:36,140 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-10 08:49:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 640 states and 818 transitions. [2018-11-10 08:49:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 818 transitions. [2018-11-10 08:49:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 08:49:36,163 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:36,271 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-10 08:49:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 692 states and 877 transitions. [2018-11-10 08:49:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 877 transitions. [2018-11-10 08:49:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 08:49:36,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:37,034 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-10 08:49:37,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 693 states and 878 transitions. [2018-11-10 08:49:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 878 transitions. [2018-11-10 08:49:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 08:49:37,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:37,063 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-10 08:49:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 699 states and 885 transitions. [2018-11-10 08:49:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 885 transitions. [2018-11-10 08:49:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 08:49:37,253 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:37,322 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-10 08:49:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 700 states and 887 transitions. [2018-11-10 08:49:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 887 transitions. [2018-11-10 08:49:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 08:49:37,523 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:37,592 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-10 08:49:37,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 706 states and 892 transitions. [2018-11-10 08:49:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 892 transitions. [2018-11-10 08:49:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 08:49:37,695 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:37,711 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-10 08:49:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 712 states and 899 transitions. [2018-11-10 08:49:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 899 transitions. [2018-11-10 08:49:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 08:49:38,051 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:38,150 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-10 08:49:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 730 states and 920 transitions. [2018-11-10 08:49:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 920 transitions. [2018-11-10 08:49:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 08:49:38,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:38,714 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-10 08:49:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 734 states and 923 transitions. [2018-11-10 08:49:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 923 transitions. [2018-11-10 08:49:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 08:49:38,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:38,777 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-10 08:49:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 763 states and 955 transitions. [2018-11-10 08:49:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 955 transitions. [2018-11-10 08:49:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 08:49:38,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:39,095 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-10 08:49:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 782 states and 977 transitions. [2018-11-10 08:49:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 977 transitions. [2018-11-10 08:49:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 08:49:39,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:39,842 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-10 08:49:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 783 states and 978 transitions. [2018-11-10 08:49:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 978 transitions. [2018-11-10 08:49:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 08:49:39,881 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:39,899 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-10 08:49:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 789 states and 983 transitions. [2018-11-10 08:49:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 983 transitions. [2018-11-10 08:49:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 08:49:40,097 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:40,156 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-10 08:49:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 811 states and 1013 transitions. [2018-11-10 08:49:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1013 transitions. [2018-11-10 08:49:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 08:49:41,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:41,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-10 08:49:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 815 states and 1017 transitions. [2018-11-10 08:49:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1017 transitions. [2018-11-10 08:49:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 08:49:41,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:41,513 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-10 08:49:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 818 states and 1020 transitions. [2018-11-10 08:49:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1020 transitions. [2018-11-10 08:49:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 08:49:41,532 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:41,613 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-10 08:49:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 843 states and 1046 transitions. [2018-11-10 08:49:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1046 transitions. [2018-11-10 08:49:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 08:49:42,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:42,418 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-10 08:49:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 861 states and 1063 transitions. [2018-11-10 08:49:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1063 transitions. [2018-11-10 08:49:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 08:49:43,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:43,154 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-10 08:49:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 878 states and 1087 transitions. [2018-11-10 08:49:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1087 transitions. [2018-11-10 08:49:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 08:49:43,839 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:43,897 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-10 08:49:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 882 states and 1091 transitions. [2018-11-10 08:49:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1091 transitions. [2018-11-10 08:49:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 08:49:44,078 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:44,136 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-10 08:49:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 886 states and 1095 transitions. [2018-11-10 08:49:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1095 transitions. [2018-11-10 08:49:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 08:49:44,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:44,472 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-10 08:49:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:45,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 904 states and 1117 transitions. [2018-11-10 08:49:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1117 transitions. [2018-11-10 08:49:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 08:49:45,020 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:45,158 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-10 08:49:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 910 states and 1122 transitions. [2018-11-10 08:49:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1122 transitions. [2018-11-10 08:49:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-10 08:49:45,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:45,515 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-10 08:49:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1007 states and 1222 transitions. [2018-11-10 08:49:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1222 transitions. [2018-11-10 08:49:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 08:49:46,109 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 08:49:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1008 states and 1222 transitions. [2018-11-10 08:49:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1222 transitions. [2018-11-10 08:49:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 08:49:46,185 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:46,208 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-10 08:49:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1030 states and 1245 transitions. [2018-11-10 08:49:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1245 transitions. [2018-11-10 08:49:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 08:49:46,539 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:46,597 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-10 08:49:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1035 states and 1250 transitions. [2018-11-10 08:49:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1250 transitions. [2018-11-10 08:49:46,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 08:49:46,875 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:46,950 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-10 08:49:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1047 states and 1265 transitions. [2018-11-10 08:49:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1265 transitions. [2018-11-10 08:49:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-10 08:49:47,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:47,510 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-10 08:49:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1051 states and 1270 transitions. [2018-11-10 08:49:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1270 transitions. [2018-11-10 08:49:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 08:49:47,621 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:47,661 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-10 08:49:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1068 states and 1290 transitions. [2018-11-10 08:49:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1290 transitions. [2018-11-10 08:49:48,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 08:49:48,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:48,305 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-10 08:49:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1074 states and 1296 transitions. [2018-11-10 08:49:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1296 transitions. [2018-11-10 08:49:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 08:49:48,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:48,521 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-10 08:49:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1078 states and 1299 transitions. [2018-11-10 08:49:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1299 transitions. [2018-11-10 08:49:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 08:49:48,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:49,114 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-10 08:49:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1094 states and 1325 transitions. [2018-11-10 08:49:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1325 transitions. [2018-11-10 08:49:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 08:49:50,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:50,629 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-10 08:49:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1107 states and 1337 transitions. [2018-11-10 08:49:50,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1337 transitions. [2018-11-10 08:49:50,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 08:49:50,764 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:50,809 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-10 08:49:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1115 states and 1346 transitions. [2018-11-10 08:49:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1346 transitions. [2018-11-10 08:49:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 08:49:51,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:51,243 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-10 08:49:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1116 states and 1346 transitions. [2018-11-10 08:49:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1346 transitions. [2018-11-10 08:49:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 08:49:51,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:51,582 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-10 08:49:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1141 states and 1371 transitions. [2018-11-10 08:49:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1371 transitions. [2018-11-10 08:49:52,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 08:49:52,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:52,376 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-10 08:49:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:52,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1147 states and 1376 transitions. [2018-11-10 08:49:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1376 transitions. [2018-11-10 08:49:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 08:49:52,429 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:52,577 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-10 08:49:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1186 states and 1420 transitions. [2018-11-10 08:49:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1420 transitions. [2018-11-10 08:49:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 08:49:53,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:53,424 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-10 08:49:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1200 states and 1434 transitions. [2018-11-10 08:49:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1434 transitions. [2018-11-10 08:49:53,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 08:49:53,468 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:53,491 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-10 08:49:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1206 states and 1439 transitions. [2018-11-10 08:49:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1439 transitions. [2018-11-10 08:49:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 08:49:53,707 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:53,735 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-10 08:49:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1209 states and 1441 transitions. [2018-11-10 08:49:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1441 transitions. [2018-11-10 08:49:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 08:49:53,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:54,016 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-10 08:49:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1220 states and 1458 transitions. [2018-11-10 08:49:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1458 transitions. [2018-11-10 08:49:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 08:49:54,962 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:54,989 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-10 08:49:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1224 states and 1463 transitions. [2018-11-10 08:49:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1463 transitions. [2018-11-10 08:49:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 08:49:55,204 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:55,230 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-10 08:49:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1255 states and 1494 transitions. [2018-11-10 08:49:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1494 transitions. [2018-11-10 08:49:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 08:49:55,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:55,480 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-10 08:49:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1283 states and 1523 transitions. [2018-11-10 08:49:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1523 transitions. [2018-11-10 08:49:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 08:49:55,638 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:55,672 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-10 08:49:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1303 states and 1547 transitions. [2018-11-10 08:49:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1547 transitions. [2018-11-10 08:49:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 08:49:56,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:56,238 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-10 08:49:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1308 states and 1556 transitions. [2018-11-10 08:49:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1556 transitions. [2018-11-10 08:49:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 08:49:56,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:56,856 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-10 08:49:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1311 states and 1558 transitions. [2018-11-10 08:49:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1558 transitions. [2018-11-10 08:49:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 08:49:56,966 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:57,001 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-10 08:49:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1330 states and 1578 transitions. [2018-11-10 08:49:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1578 transitions. [2018-11-10 08:49:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 08:49:57,308 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:57,342 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-10 08:49:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1342 states and 1592 transitions. [2018-11-10 08:49:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1592 transitions. [2018-11-10 08:49:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 08:49:57,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:57,936 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-10 08:49:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1346 states and 1596 transitions. [2018-11-10 08:49:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1596 transitions. [2018-11-10 08:49:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 08:49:58,178 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:58,277 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-10 08:49:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1408 states and 1663 transitions. [2018-11-10 08:49:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1663 transitions. [2018-11-10 08:49:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 08:49:59,764 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:59,803 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-10 08:49:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:49:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1423 states and 1678 transitions. [2018-11-10 08:49:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1678 transitions. [2018-11-10 08:49:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 08:49:59,851 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:49:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:00,022 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-10 08:50:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1434 states and 1692 transitions. [2018-11-10 08:50:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1692 transitions. [2018-11-10 08:50:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 08:50:00,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:00,708 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-10 08:50:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1449 states and 1707 transitions. [2018-11-10 08:50:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1707 transitions. [2018-11-10 08:50:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 08:50:01,107 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:01,187 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-10 08:50:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1459 states and 1721 transitions. [2018-11-10 08:50:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1721 transitions. [2018-11-10 08:50:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 08:50:01,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:01,583 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-10 08:50:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1463 states and 1725 transitions. [2018-11-10 08:50:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1725 transitions. [2018-11-10 08:50:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 08:50:01,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:01,938 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-10 08:50:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1467 states and 1729 transitions. [2018-11-10 08:50:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1729 transitions. [2018-11-10 08:50:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 08:50:02,220 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:02,262 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-10 08:50:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1484 states and 1745 transitions. [2018-11-10 08:50:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1745 transitions. [2018-11-10 08:50:02,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 08:50:02,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:02,484 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-10 08:50:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1500 states and 1767 transitions. [2018-11-10 08:50:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1767 transitions. [2018-11-10 08:50:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 08:50:03,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:03,292 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-10 08:50:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1509 states and 1776 transitions. [2018-11-10 08:50:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1776 transitions. [2018-11-10 08:50:03,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 08:50:03,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 08:50:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1514 states and 1782 transitions. [2018-11-10 08:50:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1782 transitions. [2018-11-10 08:50:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 08:50:04,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 08:50:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1516 states and 1785 transitions. [2018-11-10 08:50:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1785 transitions. [2018-11-10 08:50:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 08:50:04,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:04,445 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-10 08:50:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1539 states and 1807 transitions. [2018-11-10 08:50:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1807 transitions. [2018-11-10 08:50:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 08:50:04,842 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:04,870 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-10 08:50:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1577 states and 1847 transitions. [2018-11-10 08:50:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 1847 transitions. [2018-11-10 08:50:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 08:50:05,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:05,183 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-10 08:50:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1578 states and 1847 transitions. [2018-11-10 08:50:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1847 transitions. [2018-11-10 08:50:05,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 08:50:05,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:50:05,236 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-10 08:50:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:50:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1581 states and 1849 transitions. [2018-11-10 08:50:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1849 transitions. [2018-11-10 08:50:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 08:50:05,371 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:50:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:50:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:50:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:50:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:50:05,601 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 110 iterations. [2018-11-10 08:50:05,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 08:50:05 ImpRootNode [2018-11-10 08:50:05,736 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 08:50:05,737 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:50:05,737 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:50:05,737 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:50:05,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:49:24" (3/4) ... [2018-11-10 08:50:05,741 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 08:50:05,849 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e8b2688b-b9e4-4561-b20b-421390163449/bin-2019/ukojak/witness.graphml [2018-11-10 08:50:05,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:50:05,850 INFO L168 Benchmark]: Toolchain (without parser) took 43698.00 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 955.0 MB in the beginning and 1.8 GB in the end (delta: -858.9 MB). Peak memory consumption was 415.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:50:05,851 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:50:05,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.66 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 925.4 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 08:50:05,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 925.4 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:50:05,852 INFO L168 Benchmark]: Boogie Preprocessor took 42.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:50:05,852 INFO L168 Benchmark]: RCFGBuilder took 1532.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 822.5 MB in the end (delta: 249.6 MB). Peak memory consumption was 249.6 MB. Max. memory is 11.5 GB. [2018-11-10 08:50:05,852 INFO L168 Benchmark]: CodeCheck took 41571.78 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 822.5 MB in the beginning and 1.8 GB in the end (delta: -1.0 GB). Peak memory consumption was 169.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:50:05,853 INFO L168 Benchmark]: Witness Printer took 112.95 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:50:05,854 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.3s OverallTime, 110 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1936770304 SDtfs, -1454670936 SDslu, 1820984064 SDs, 0 SdLazy, -2118992088 SolverSat, -1986124936 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 206.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104647 GetRequests, 103397 SyntacticMatches, 574 SemanticMatches, 676 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306692 ImplicationChecksByTransitivity, 32.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 16689 NumberOfCodeBlocks, 16689 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 16366 ConstructedInterpolants, 0 QuantifiedInterpolants, 5262657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 109 InterpolantComputations, 89 PerfectInterpolantSequences, 11050/11241 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.66 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 925.4 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 925.4 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1532.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 822.5 MB in the end (delta: 249.6 MB). Peak memory consumption was 249.6 MB. Max. memory is 11.5 GB. * CodeCheck took 41571.78 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 822.5 MB in the beginning and 1.8 GB in the end (delta: -1.0 GB). Peak memory consumption was 169.1 MB. Max. memory is 11.5 GB. * Witness Printer took 112.95 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...