./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label21_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_554e398e-1150-45e7-8034-a7447c6f7f0a/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label21_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/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 dd54b1bc34218a081600cff9517fd9b1806e0ce2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 06:14:37,294 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:14:37,295 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:14:37,304 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:14:37,304 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:14:37,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:14:37,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:14:37,307 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:14:37,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:14:37,309 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:14:37,310 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:14:37,310 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:14:37,311 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:14:37,311 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:14:37,312 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:14:37,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:14:37,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:14:37,314 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:14:37,315 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:14:37,316 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:14:37,317 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:14:37,318 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:14:37,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:14:37,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:14:37,319 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:14:37,320 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:14:37,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:14:37,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:14:37,322 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:14:37,323 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:14:37,323 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:14:37,323 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:14:37,324 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:14:37,324 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:14:37,325 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:14:37,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:14:37,325 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 06:14:37,334 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:14:37,334 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:14:37,335 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 06:14:37,335 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 06:14:37,335 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:14:37,335 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:14:37,335 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:14:37,336 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:14:37,336 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:14:37,336 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:14:37,336 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:14:37,336 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 06:14:37,336 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 06:14:37,336 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 06:14:37,336 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:14:37,337 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:14:37,337 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 06:14:37,337 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 06:14:37,337 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 06:14:37,337 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:14:37,337 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 06:14:37,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 06:14:37,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:14:37,338 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 06:14:37,338 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 06:14:37,338 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 06:14:37,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 06:14:37,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 06:14:37,338 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_554e398e-1150-45e7-8034-a7447c6f7f0a/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 -> dd54b1bc34218a081600cff9517fd9b1806e0ce2 [2018-11-10 06:14:37,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:14:37,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:14:37,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:14:37,381 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:14:37,382 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:14:37,383 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label21_false-unreach-call_false-termination.c [2018-11-10 06:14:37,434 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/bin-2019/ukojak/data/9d3c16870/a00421b1a3534457b1a6cbee3a6ac511/FLAG4c145ecc2 [2018-11-10 06:14:37,825 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:14:37,826 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/sv-benchmarks/c/eca-rers2012/Problem01_label21_false-unreach-call_false-termination.c [2018-11-10 06:14:37,836 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/bin-2019/ukojak/data/9d3c16870/a00421b1a3534457b1a6cbee3a6ac511/FLAG4c145ecc2 [2018-11-10 06:14:37,850 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/bin-2019/ukojak/data/9d3c16870/a00421b1a3534457b1a6cbee3a6ac511 [2018-11-10 06:14:37,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:14:37,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:14:37,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:14:37,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:14:37,860 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:14:37,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:14:37" (1/1) ... [2018-11-10 06:14:37,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e7f328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:14:37, skipping insertion in model container [2018-11-10 06:14:37,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:14:37" (1/1) ... [2018-11-10 06:14:37,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:14:37,915 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:14:38,194 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:14:38,198 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:14:38,272 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:14:38,287 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:14:38,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:14:38 WrapperNode [2018-11-10 06:14:38,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:14:38,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:14:38,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:14:38,288 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:14:38,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:14:38" (1/1) ... [2018-11-10 06:14:38,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:14:38" (1/1) ... [2018-11-10 06:14:38,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:14:38,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:14:38,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:14:38,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:14:38,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:14:38" (1/1) ... [2018-11-10 06:14:38,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:14:38" (1/1) ... [2018-11-10 06:14:38,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:14:38" (1/1) ... [2018-11-10 06:14:38,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:14:38" (1/1) ... [2018-11-10 06:14:38,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:14:38" (1/1) ... [2018-11-10 06:14:38,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:14:38" (1/1) ... [2018-11-10 06:14:38,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:14:38" (1/1) ... [2018-11-10 06:14:38,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:14:38,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:14:38,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:14:38,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:14:38,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:14:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/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 06:14:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 06:14:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:14:38,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:14:40,621 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:14:40,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:14:40 BoogieIcfgContainer [2018-11-10 06:14:40,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:14:40,623 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 06:14:40,623 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 06:14:40,634 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 06:14:40,635 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:14:40" (1/1) ... [2018-11-10 06:14:40,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:14:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-10 06:14:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-10 06:14:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 06:14:40,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:41,043 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 06:14:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 147 states and 223 transitions. [2018-11-10 06:14:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 223 transitions. [2018-11-10 06:14:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 06:14:41,483 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:41,562 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 06:14:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 152 states and 229 transitions. [2018-11-10 06:14:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 229 transitions. [2018-11-10 06:14:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 06:14:41,720 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:41,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:14:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 158 states and 240 transitions. [2018-11-10 06:14:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 240 transitions. [2018-11-10 06:14:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 06:14:41,890 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:14:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 229 states and 320 transitions. [2018-11-10 06:14:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 320 transitions. [2018-11-10 06:14:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 06:14:42,510 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:14:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 240 states and 337 transitions. [2018-11-10 06:14:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 337 transitions. [2018-11-10 06:14:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 06:14:42,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:14:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 252 states and 357 transitions. [2018-11-10 06:14:43,510 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 357 transitions. [2018-11-10 06:14:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 06:14:43,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:14:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 254 states and 359 transitions. [2018-11-10 06:14:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 359 transitions. [2018-11-10 06:14:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 06:14:43,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:14:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 258 states and 363 transitions. [2018-11-10 06:14:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 363 transitions. [2018-11-10 06:14:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 06:14:43,791 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:14:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 262 states and 367 transitions. [2018-11-10 06:14:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 367 transitions. [2018-11-10 06:14:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 06:14:43,936 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 06:14:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 274 states and 382 transitions. [2018-11-10 06:14:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 382 transitions. [2018-11-10 06:14:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 06:14:44,282 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:14:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 276 states and 385 transitions. [2018-11-10 06:14:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 385 transitions. [2018-11-10 06:14:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 06:14:44,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:14:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 286 states and 399 transitions. [2018-11-10 06:14:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 399 transitions. [2018-11-10 06:14:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 06:14:44,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 06:14:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 294 states and 408 transitions. [2018-11-10 06:14:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 408 transitions. [2018-11-10 06:14:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 06:14:45,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:14:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 299 states and 413 transitions. [2018-11-10 06:14:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 413 transitions. [2018-11-10 06:14:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 06:14:45,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 06:14:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 311 states and 429 transitions. [2018-11-10 06:14:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 429 transitions. [2018-11-10 06:14:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 06:14:46,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 06:14:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 315 states and 433 transitions. [2018-11-10 06:14:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 433 transitions. [2018-11-10 06:14:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 06:14:46,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:14:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 330 states and 450 transitions. [2018-11-10 06:14:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 450 transitions. [2018-11-10 06:14:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 06:14:47,205 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:14:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 336 states and 461 transitions. [2018-11-10 06:14:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 461 transitions. [2018-11-10 06:14:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 06:14:47,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:14:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 337 states and 461 transitions. [2018-11-10 06:14:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 461 transitions. [2018-11-10 06:14:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 06:14:48,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 06:14:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 354 states and 479 transitions. [2018-11-10 06:14:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 479 transitions. [2018-11-10 06:14:48,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 06:14:48,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:14:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 385 states and 515 transitions. [2018-11-10 06:14:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 515 transitions. [2018-11-10 06:14:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 06:14:48,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:14:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 399 states and 530 transitions. [2018-11-10 06:14:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 530 transitions. [2018-11-10 06:14:49,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 06:14:49,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:14:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 402 states and 534 transitions. [2018-11-10 06:14:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 534 transitions. [2018-11-10 06:14:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 06:14:49,532 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:14:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 416 states and 549 transitions. [2018-11-10 06:14:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 549 transitions. [2018-11-10 06:14:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 06:14:50,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 06:14:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 428 states and 571 transitions. [2018-11-10 06:14:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 571 transitions. [2018-11-10 06:14:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 06:14:51,197 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 06:14:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:51,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 434 states and 580 transitions. [2018-11-10 06:14:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 580 transitions. [2018-11-10 06:14:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 06:14:51,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 06:14:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 438 states and 586 transitions. [2018-11-10 06:14:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 586 transitions. [2018-11-10 06:14:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 06:14:51,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:14:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 446 states and 601 transitions. [2018-11-10 06:14:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 601 transitions. [2018-11-10 06:14:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 06:14:53,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:14:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 452 states and 610 transitions. [2018-11-10 06:14:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 610 transitions. [2018-11-10 06:14:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 06:14:54,181 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:14:54,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 466 states and 626 transitions. [2018-11-10 06:14:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 626 transitions. [2018-11-10 06:14:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 06:14:54,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 06:14:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 477 states and 638 transitions. [2018-11-10 06:14:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 638 transitions. [2018-11-10 06:14:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 06:14:54,692 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 82 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:14:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 526 states and 700 transitions. [2018-11-10 06:14:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 700 transitions. [2018-11-10 06:14:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 06:14:56,961 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 82 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:14:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 531 states and 705 transitions. [2018-11-10 06:14:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 705 transitions. [2018-11-10 06:14:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 06:14:57,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:14:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 553 states and 731 transitions. [2018-11-10 06:14:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 731 transitions. [2018-11-10 06:14:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 06:14:57,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 06:14:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 555 states and 734 transitions. [2018-11-10 06:14:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 734 transitions. [2018-11-10 06:14:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 06:14:57,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 06:14:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:14:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 562 states and 741 transitions. [2018-11-10 06:14:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 741 transitions. [2018-11-10 06:14:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 06:14:57,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:14:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:14:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 599 states and 789 transitions. [2018-11-10 06:15:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 789 transitions. [2018-11-10 06:15:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 06:15:00,315 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 605 states and 796 transitions. [2018-11-10 06:15:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 796 transitions. [2018-11-10 06:15:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 06:15:01,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 670 states and 863 transitions. [2018-11-10 06:15:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 863 transitions. [2018-11-10 06:15:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 06:15:03,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 06:15:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 684 states and 876 transitions. [2018-11-10 06:15:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 876 transitions. [2018-11-10 06:15:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 06:15:03,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 06:15:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 685 states and 876 transitions. [2018-11-10 06:15:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 876 transitions. [2018-11-10 06:15:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 06:15:03,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 724 states and 929 transitions. [2018-11-10 06:15:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 929 transitions. [2018-11-10 06:15:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 06:15:06,287 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 759 states and 964 transitions. [2018-11-10 06:15:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 964 transitions. [2018-11-10 06:15:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 06:15:07,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 798 states and 1003 transitions. [2018-11-10 06:15:07,459 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1003 transitions. [2018-11-10 06:15:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 06:15:07,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 06:15:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 804 states and 1009 transitions. [2018-11-10 06:15:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1009 transitions. [2018-11-10 06:15:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 06:15:07,666 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 06:15:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 813 states and 1021 transitions. [2018-11-10 06:15:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1021 transitions. [2018-11-10 06:15:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 06:15:08,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 06:15:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 817 states and 1026 transitions. [2018-11-10 06:15:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1026 transitions. [2018-11-10 06:15:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 06:15:08,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 06:15:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 846 states and 1066 transitions. [2018-11-10 06:15:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1066 transitions. [2018-11-10 06:15:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 06:15:11,352 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 06:15:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 852 states and 1073 transitions. [2018-11-10 06:15:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1073 transitions. [2018-11-10 06:15:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 06:15:11,967 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 871 states and 1096 transitions. [2018-11-10 06:15:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1096 transitions. [2018-11-10 06:15:12,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 06:15:12,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:15:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 873 states and 1098 transitions. [2018-11-10 06:15:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1098 transitions. [2018-11-10 06:15:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 06:15:13,219 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 06:15:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 887 states and 1122 transitions. [2018-11-10 06:15:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1122 transitions. [2018-11-10 06:15:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 06:15:14,468 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 06:15:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:15,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 895 states and 1133 transitions. [2018-11-10 06:15:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1133 transitions. [2018-11-10 06:15:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 06:15:15,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 06:15:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 899 states and 1137 transitions. [2018-11-10 06:15:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1137 transitions. [2018-11-10 06:15:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-10 06:15:15,759 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 06:15:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 964 states and 1203 transitions. [2018-11-10 06:15:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1203 transitions. [2018-11-10 06:15:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 06:15:16,305 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 101 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 06:15:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1034 states and 1280 transitions. [2018-11-10 06:15:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1280 transitions. [2018-11-10 06:15:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 06:15:18,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 06:15:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1037 states and 1283 transitions. [2018-11-10 06:15:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1283 transitions. [2018-11-10 06:15:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 06:15:18,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1081 states and 1337 transitions. [2018-11-10 06:15:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1337 transitions. [2018-11-10 06:15:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 06:15:22,597 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:22,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1085 states and 1342 transitions. [2018-11-10 06:15:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1342 transitions. [2018-11-10 06:15:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 06:15:22,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 183 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 06:15:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1090 states and 1350 transitions. [2018-11-10 06:15:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1350 transitions. [2018-11-10 06:15:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 06:15:23,851 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 183 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 06:15:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1094 states and 1354 transitions. [2018-11-10 06:15:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1354 transitions. [2018-11-10 06:15:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 06:15:24,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 06:15:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1104 states and 1365 transitions. [2018-11-10 06:15:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1365 transitions. [2018-11-10 06:15:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 06:15:24,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1122 states and 1395 transitions. [2018-11-10 06:15:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1395 transitions. [2018-11-10 06:15:27,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 06:15:27,896 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1131 states and 1406 transitions. [2018-11-10 06:15:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1406 transitions. [2018-11-10 06:15:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 06:15:29,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 06:15:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1133 states and 1407 transitions. [2018-11-10 06:15:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1407 transitions. [2018-11-10 06:15:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 06:15:29,871 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1134 states and 1407 transitions. [2018-11-10 06:15:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1407 transitions. [2018-11-10 06:15:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 06:15:30,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1162 states and 1443 transitions. [2018-11-10 06:15:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1443 transitions. [2018-11-10 06:15:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 06:15:33,106 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1170 states and 1451 transitions. [2018-11-10 06:15:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1451 transitions. [2018-11-10 06:15:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 06:15:34,368 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 06:15:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1174 states and 1454 transitions. [2018-11-10 06:15:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1454 transitions. [2018-11-10 06:15:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 06:15:35,189 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 06:15:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1206 states and 1493 transitions. [2018-11-10 06:15:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1493 transitions. [2018-11-10 06:15:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 06:15:37,861 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1260 states and 1558 transitions. [2018-11-10 06:15:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1558 transitions. [2018-11-10 06:15:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 06:15:43,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1262 states and 1559 transitions. [2018-11-10 06:15:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1559 transitions. [2018-11-10 06:15:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 06:15:43,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 06:15:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1264 states and 1560 transitions. [2018-11-10 06:15:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1560 transitions. [2018-11-10 06:15:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 06:15:44,731 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 06:15:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1271 states and 1568 transitions. [2018-11-10 06:15:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1568 transitions. [2018-11-10 06:15:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 06:15:45,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 06:15:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1276 states and 1573 transitions. [2018-11-10 06:15:45,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1573 transitions. [2018-11-10 06:15:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 06:15:45,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:15:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1323 states and 1626 transitions. [2018-11-10 06:15:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1626 transitions. [2018-11-10 06:15:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 06:15:48,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 06:15:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1325 states and 1627 transitions. [2018-11-10 06:15:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1627 transitions. [2018-11-10 06:15:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 06:15:49,021 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 192 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 06:15:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1353 states and 1663 transitions. [2018-11-10 06:15:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1663 transitions. [2018-11-10 06:15:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 06:15:51,025 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 192 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 06:15:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1357 states and 1672 transitions. [2018-11-10 06:15:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1672 transitions. [2018-11-10 06:15:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 06:15:51,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1389 states and 1705 transitions. [2018-11-10 06:15:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1705 transitions. [2018-11-10 06:15:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 06:15:54,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:15:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1390 states and 1705 transitions. [2018-11-10 06:15:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1705 transitions. [2018-11-10 06:15:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 06:15:55,428 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 06:15:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:15:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1438 states and 1755 transitions. [2018-11-10 06:15:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1755 transitions. [2018-11-10 06:15:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 06:15:59,730 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:15:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:15:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 06:16:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1438 states and 1754 transitions. [2018-11-10 06:16:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1754 transitions. [2018-11-10 06:16:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 06:16:00,445 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 280 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1440 states and 1759 transitions. [2018-11-10 06:16:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1759 transitions. [2018-11-10 06:16:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 06:16:02,379 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 280 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1444 states and 1763 transitions. [2018-11-10 06:16:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1763 transitions. [2018-11-10 06:16:03,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 06:16:03,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 280 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1448 states and 1767 transitions. [2018-11-10 06:16:03,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1767 transitions. [2018-11-10 06:16:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-10 06:16:03,669 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-10 06:16:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1519 states and 1841 transitions. [2018-11-10 06:16:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1841 transitions. [2018-11-10 06:16:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 06:16:04,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1531 states and 1861 transitions. [2018-11-10 06:16:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1861 transitions. [2018-11-10 06:16:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 06:16:07,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1538 states and 1867 transitions. [2018-11-10 06:16:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1867 transitions. [2018-11-10 06:16:08,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 06:16:08,391 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1542 states and 1871 transitions. [2018-11-10 06:16:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1871 transitions. [2018-11-10 06:16:08,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 06:16:08,959 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 144 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1596 states and 1933 transitions. [2018-11-10 06:16:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1933 transitions. [2018-11-10 06:16:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 06:16:13,739 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 144 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1632 states and 1971 transitions. [2018-11-10 06:16:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1971 transitions. [2018-11-10 06:16:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-10 06:16:16,180 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-10 06:16:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 1703 states and 2045 transitions. [2018-11-10 06:16:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2045 transitions. [2018-11-10 06:16:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-10 06:16:17,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 177 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 1746 states and 2091 transitions. [2018-11-10 06:16:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2091 transitions. [2018-11-10 06:16:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-10 06:16:22,332 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 177 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 1762 states and 2109 transitions. [2018-11-10 06:16:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2109 transitions. [2018-11-10 06:16:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 06:16:23,791 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 06:16:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 1813 states and 2164 transitions. [2018-11-10 06:16:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2164 transitions. [2018-11-10 06:16:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 06:16:31,428 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 06:16:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 1817 states and 2168 transitions. [2018-11-10 06:16:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2168 transitions. [2018-11-10 06:16:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 06:16:32,958 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 179 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 06:16:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 1822 states and 2173 transitions. [2018-11-10 06:16:34,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2173 transitions. [2018-11-10 06:16:34,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-10 06:16:34,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 06:16:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 1870 states and 2224 transitions. [2018-11-10 06:16:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2224 transitions. [2018-11-10 06:16:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-10 06:16:40,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 06:16:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 1884 states and 2236 transitions. [2018-11-10 06:16:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2236 transitions. [2018-11-10 06:16:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-10 06:16:42,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 191 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 1886 states and 2238 transitions. [2018-11-10 06:16:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2238 transitions. [2018-11-10 06:16:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-10 06:16:43,971 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 191 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 1917 states and 2270 transitions. [2018-11-10 06:16:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2270 transitions. [2018-11-10 06:16:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-10 06:16:47,603 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 191 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:16:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 1939 states and 2292 transitions. [2018-11-10 06:16:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2292 transitions. [2018-11-10 06:16:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 06:16:49,000 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-11-10 06:16:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2009 states and 2364 transitions. [2018-11-10 06:16:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2364 transitions. [2018-11-10 06:16:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-10 06:16:50,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 204 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 06:16:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2011 states and 2366 transitions. [2018-11-10 06:16:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2366 transitions. [2018-11-10 06:16:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-10 06:16:50,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-10 06:16:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2013 states and 2368 transitions. [2018-11-10 06:16:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2368 transitions. [2018-11-10 06:16:51,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 06:16:51,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 06:16:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:16:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2077 states and 2448 transitions. [2018-11-10 06:16:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2448 transitions. [2018-11-10 06:16:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 06:16:57,534 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:16:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:16:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 06:17:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2116 states and 2502 transitions. [2018-11-10 06:17:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2502 transitions. [2018-11-10 06:17:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 06:17:02,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 06:17:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2133 states and 2523 transitions. [2018-11-10 06:17:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2523 transitions. [2018-11-10 06:17:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 06:17:04,590 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 06:17:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2159 states and 2553 transitions. [2018-11-10 06:17:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2553 transitions. [2018-11-10 06:17:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 06:17:06,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 06:17:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2191 states and 2601 transitions. [2018-11-10 06:17:11,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 2601 transitions. [2018-11-10 06:17:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 06:17:11,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 06:17:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2207 states and 2617 transitions. [2018-11-10 06:17:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2617 transitions. [2018-11-10 06:17:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 06:17:12,503 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 06:17:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2223 states and 2634 transitions. [2018-11-10 06:17:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2634 transitions. [2018-11-10 06:17:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 06:17:13,253 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 06:17:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2248 states and 2662 transitions. [2018-11-10 06:17:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 2662 transitions. [2018-11-10 06:17:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 06:17:15,197 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 06:17:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2263 states and 2678 transitions. [2018-11-10 06:17:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2678 transitions. [2018-11-10 06:17:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 06:17:16,026 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 06:17:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2269 states and 2687 transitions. [2018-11-10 06:17:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 2687 transitions. [2018-11-10 06:17:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 06:17:16,729 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 06:17:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2276 states and 2700 transitions. [2018-11-10 06:17:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 2700 transitions. [2018-11-10 06:17:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-10 06:17:17,877 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 289 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:17:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2303 states and 2731 transitions. [2018-11-10 06:17:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2731 transitions. [2018-11-10 06:17:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-10 06:17:23,405 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 289 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:17:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2328 states and 2764 transitions. [2018-11-10 06:17:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2764 transitions. [2018-11-10 06:17:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-10 06:17:30,875 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 289 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:17:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2360 states and 2797 transitions. [2018-11-10 06:17:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2797 transitions. [2018-11-10 06:17:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-10 06:17:37,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 289 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:17:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2365 states and 2800 transitions. [2018-11-10 06:17:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 2800 transitions. [2018-11-10 06:17:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-10 06:17:40,409 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 289 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:17:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2367 states and 2805 transitions. [2018-11-10 06:17:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2805 transitions. [2018-11-10 06:17:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-10 06:17:42,129 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 346 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:17:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2378 states and 2818 transitions. [2018-11-10 06:17:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 2818 transitions. [2018-11-10 06:17:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-10 06:17:45,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 346 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:17:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2382 states and 2822 transitions. [2018-11-10 06:17:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 2822 transitions. [2018-11-10 06:17:46,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-10 06:17:46,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 346 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:17:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2386 states and 2826 transitions. [2018-11-10 06:17:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2826 transitions. [2018-11-10 06:17:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-10 06:17:47,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 308 proven. 22 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 06:17:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 06:17:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2426 states and 2868 transitions. [2018-11-10 06:17:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 2868 transitions. [2018-11-10 06:17:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-10 06:17:53,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 06:17:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:53,885 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 127 iterations. [2018-11-10 06:17:54,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 06:17:54 ImpRootNode [2018-11-10 06:17:54,035 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 06:17:54,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:17:54,036 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:17:54,036 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:17:54,036 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:14:40" (3/4) ... [2018-11-10 06:17:54,038 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 06:17:54,153 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_554e398e-1150-45e7-8034-a7447c6f7f0a/bin-2019/ukojak/witness.graphml [2018-11-10 06:17:54,153 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:17:54,154 INFO L168 Benchmark]: Toolchain (without parser) took 196300.51 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 955.0 MB in the beginning and 1.8 GB in the end (delta: -817.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-10 06:17:54,155 INFO L168 Benchmark]: CDTParser took 0.18 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 06:17:54,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.94 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 919.0 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2018-11-10 06:17:54,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 919.0 MB in the beginning and 1.1 GB in the end (delta: -213.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:17:54,156 INFO L168 Benchmark]: Boogie Preprocessor took 51.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:17:54,156 INFO L168 Benchmark]: RCFGBuilder took 2137.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 890.8 MB in the end (delta: 236.7 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:17:54,156 INFO L168 Benchmark]: CodeCheck took 193412.65 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 890.8 MB in the beginning and 1.8 GB in the end (delta: -929.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 06:17:54,157 INFO L168 Benchmark]: Witness Printer took 117.85 ms. Allocated memory is still 3.5 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:17:54,158 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 199 locations, 1 error locations. UNSAFE Result, 193.2s OverallTime, 127 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1055522792 SDtfs, -394007530 SDslu, -927196164 SDs, 0 SdLazy, 424510140 SolverSat, -703048110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 429.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145056 GetRequests, 137769 SyntacticMatches, 5795 SemanticMatches, 1492 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1563247 ImplicationChecksByTransitivity, 171.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 21974 NumberOfCodeBlocks, 21974 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 21588 ConstructedInterpolants, 0 QuantifiedInterpolants, 31978340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 126 InterpolantComputations, 80 PerfectInterpolantSequences, 20014/20980 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: 425]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND TRUE ((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13))))))) [L383] a20 = 0 [L384] a21 = 1 [L385] a8 = 14 [L386] a17 = 0 [L387] a16 = 5 [L388] a7 = 1 [L389] RET return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L425] __VERIFIER_error() VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 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 431.94 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 919.0 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 144.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 919.0 MB in the beginning and 1.1 GB in the end (delta: -213.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2137.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 890.8 MB in the end (delta: 236.7 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. * CodeCheck took 193412.65 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 890.8 MB in the beginning and 1.8 GB in the end (delta: -929.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 117.85 ms. Allocated memory is still 3.5 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...