./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label57_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_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label57_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/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 00372dd9706fe72201713f336fbc903974e88ef8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:19:26,478 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:19:26,479 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:19:26,486 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:19:26,486 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:19:26,487 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:19:26,488 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:19:26,489 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:19:26,490 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:19:26,491 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:19:26,491 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:19:26,492 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:19:26,492 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:19:26,493 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:19:26,494 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:19:26,494 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:19:26,495 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:19:26,496 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:19:26,498 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:19:26,499 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:19:26,499 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:19:26,500 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:19:26,502 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:19:26,502 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:19:26,502 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:19:26,503 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:19:26,504 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:19:26,504 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:19:26,505 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:19:26,506 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:19:26,506 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:19:26,506 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:19:26,507 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:19:26,507 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:19:26,508 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:19:26,508 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:19:26,508 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 13:19:26,519 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:19:26,519 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:19:26,520 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:19:26,520 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 13:19:26,520 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:19:26,520 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:19:26,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:19:26,521 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:19:26,521 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:19:26,521 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:19:26,521 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:19:26,521 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:19:26,521 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:19:26,522 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:19:26,522 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:19:26,522 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:19:26,522 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:19:26,522 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 13:19:26,522 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 13:19:26,522 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:19:26,523 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:19:26,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 13:19:26,523 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:19:26,523 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:19:26,523 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:19:26,523 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 13:19:26,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:19:26,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:19:26,524 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_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/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 -> 00372dd9706fe72201713f336fbc903974e88ef8 [2018-11-10 13:19:26,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:19:26,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:19:26,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:19:26,560 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:19:26,561 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:19:26,561 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label57_false-unreach-call_false-termination.c [2018-11-10 13:19:26,599 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/bin-2019/ukojak/data/0fa35cf0e/d301716edecf4beb8c5453153c857c44/FLAGb1870c0bc [2018-11-10 13:19:26,990 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:19:26,991 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/sv-benchmarks/c/eca-rers2012/Problem01_label57_false-unreach-call_false-termination.c [2018-11-10 13:19:27,000 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/bin-2019/ukojak/data/0fa35cf0e/d301716edecf4beb8c5453153c857c44/FLAGb1870c0bc [2018-11-10 13:19:27,009 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/bin-2019/ukojak/data/0fa35cf0e/d301716edecf4beb8c5453153c857c44 [2018-11-10 13:19:27,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:19:27,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:19:27,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:19:27,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:19:27,017 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:19:27,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:19:27" (1/1) ... [2018-11-10 13:19:27,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c10949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:27, skipping insertion in model container [2018-11-10 13:19:27,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:19:27" (1/1) ... [2018-11-10 13:19:27,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:19:27,060 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:19:27,284 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:19:27,287 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:19:27,356 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:19:27,369 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:19:27,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:27 WrapperNode [2018-11-10 13:19:27,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:19:27,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:19:27,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:19:27,370 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:19:27,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:27" (1/1) ... [2018-11-10 13:19:27,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:27" (1/1) ... [2018-11-10 13:19:27,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:19:27,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:19:27,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:19:27,471 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:19:27,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:27" (1/1) ... [2018-11-10 13:19:27,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:27" (1/1) ... [2018-11-10 13:19:27,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:27" (1/1) ... [2018-11-10 13:19:27,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:27" (1/1) ... [2018-11-10 13:19:27,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:27" (1/1) ... [2018-11-10 13:19:27,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:27" (1/1) ... [2018-11-10 13:19:27,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:27" (1/1) ... [2018-11-10 13:19:27,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:19:27,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:19:27,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:19:27,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:19:27,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/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 13:19:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 13:19:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:19:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:19:29,123 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:19:29,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:19:29 BoogieIcfgContainer [2018-11-10 13:19:29,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:19:29,127 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 13:19:29,128 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 13:19:29,137 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 13:19:29,138 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:19:29" (1/1) ... [2018-11-10 13:19:29,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:19:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-10 13:19:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-10 13:19:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 13:19:29,186 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:29,407 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 13:19:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 147 states and 239 transitions. [2018-11-10 13:19:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 239 transitions. [2018-11-10 13:19:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 13:19:29,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:19:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 148 states and 240 transitions. [2018-11-10 13:19:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 240 transitions. [2018-11-10 13:19:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 13:19:30,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 153 states and 248 transitions. [2018-11-10 13:19:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 248 transitions. [2018-11-10 13:19:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 13:19:30,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 162 states and 264 transitions. [2018-11-10 13:19:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 264 transitions. [2018-11-10 13:19:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 13:19:30,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:19:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 163 states and 265 transitions. [2018-11-10 13:19:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 265 transitions. [2018-11-10 13:19:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 13:19:30,542 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 13:19:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 176 states and 286 transitions. [2018-11-10 13:19:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 286 transitions. [2018-11-10 13:19:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 13:19:30,896 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:31,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 182 states and 293 transitions. [2018-11-10 13:19:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 293 transitions. [2018-11-10 13:19:31,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 13:19:31,053 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 183 states and 294 transitions. [2018-11-10 13:19:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 294 transitions. [2018-11-10 13:19:31,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 13:19:31,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:31,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 198 states and 314 transitions. [2018-11-10 13:19:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 314 transitions. [2018-11-10 13:19:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 13:19:31,629 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 199 states and 316 transitions. [2018-11-10 13:19:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 316 transitions. [2018-11-10 13:19:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 13:19:31,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 209 states and 335 transitions. [2018-11-10 13:19:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 335 transitions. [2018-11-10 13:19:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 13:19:32,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 210 states and 337 transitions. [2018-11-10 13:19:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 337 transitions. [2018-11-10 13:19:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 13:19:32,160 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:19:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 211 states and 338 transitions. [2018-11-10 13:19:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 338 transitions. [2018-11-10 13:19:32,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 13:19:32,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 214 states and 341 transitions. [2018-11-10 13:19:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 341 transitions. [2018-11-10 13:19:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:19:32,264 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 225 states and 359 transitions. [2018-11-10 13:19:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 359 transitions. [2018-11-10 13:19:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 13:19:33,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:19:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 227 states and 360 transitions. [2018-11-10 13:19:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 360 transitions. [2018-11-10 13:19:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 13:19:33,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:19:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 231 states and 364 transitions. [2018-11-10 13:19:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 364 transitions. [2018-11-10 13:19:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 13:19:33,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:19:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 232 states and 365 transitions. [2018-11-10 13:19:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 365 transitions. [2018-11-10 13:19:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 13:19:33,441 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 238 states and 375 transitions. [2018-11-10 13:19:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 375 transitions. [2018-11-10 13:19:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 13:19:33,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:33,780 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 13:19:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 249 states and 391 transitions. [2018-11-10 13:19:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 391 transitions. [2018-11-10 13:19:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 13:19:34,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:34,370 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:19:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 251 states and 392 transitions. [2018-11-10 13:19:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 392 transitions. [2018-11-10 13:19:34,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 13:19:34,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 276 states and 426 transitions. [2018-11-10 13:19:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 426 transitions. [2018-11-10 13:19:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 13:19:35,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:19:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 287 states and 440 transitions. [2018-11-10 13:19:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 440 transitions. [2018-11-10 13:19:36,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 13:19:36,105 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 290 states and 443 transitions. [2018-11-10 13:19:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 443 transitions. [2018-11-10 13:19:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 13:19:36,166 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:19:36,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 292 states and 448 transitions. [2018-11-10 13:19:36,385 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 448 transitions. [2018-11-10 13:19:36,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 13:19:36,386 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 306 states and 470 transitions. [2018-11-10 13:19:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 470 transitions. [2018-11-10 13:19:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 13:19:37,397 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 311 states and 477 transitions. [2018-11-10 13:19:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 477 transitions. [2018-11-10 13:19:37,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 13:19:37,783 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 326 states and 492 transitions. [2018-11-10 13:19:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 492 transitions. [2018-11-10 13:19:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 13:19:38,535 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:38,630 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 13:19:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 337 states and 504 transitions. [2018-11-10 13:19:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 504 transitions. [2018-11-10 13:19:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 13:19:39,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 339 states and 507 transitions. [2018-11-10 13:19:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 507 transitions. [2018-11-10 13:19:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 13:19:39,385 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 361 states and 543 transitions. [2018-11-10 13:19:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 543 transitions. [2018-11-10 13:19:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 13:19:41,001 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 367 states and 552 transitions. [2018-11-10 13:19:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 552 transitions. [2018-11-10 13:19:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 13:19:41,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 373 states and 558 transitions. [2018-11-10 13:19:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 558 transitions. [2018-11-10 13:19:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 13:19:41,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 379 states and 564 transitions. [2018-11-10 13:19:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 564 transitions. [2018-11-10 13:19:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 13:19:42,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 384 states and 570 transitions. [2018-11-10 13:19:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 570 transitions. [2018-11-10 13:19:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 13:19:42,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 388 states and 574 transitions. [2018-11-10 13:19:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 574 transitions. [2018-11-10 13:19:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 13:19:42,808 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 402 states and 595 transitions. [2018-11-10 13:19:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 595 transitions. [2018-11-10 13:19:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 13:19:44,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:44,225 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 13:19:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 413 states and 608 transitions. [2018-11-10 13:19:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 608 transitions. [2018-11-10 13:19:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 13:19:44,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:19:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 420 states and 617 transitions. [2018-11-10 13:19:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 617 transitions. [2018-11-10 13:19:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 13:19:45,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:19:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 422 states and 618 transitions. [2018-11-10 13:19:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 618 transitions. [2018-11-10 13:19:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 13:19:45,618 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 439 states and 639 transitions. [2018-11-10 13:19:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 639 transitions. [2018-11-10 13:19:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 13:19:46,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:46,715 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 458 states and 667 transitions. [2018-11-10 13:19:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 667 transitions. [2018-11-10 13:19:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 13:19:47,966 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 465 states and 674 transitions. [2018-11-10 13:19:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 674 transitions. [2018-11-10 13:19:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 13:19:48,122 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 475 states and 684 transitions. [2018-11-10 13:19:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 684 transitions. [2018-11-10 13:19:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 13:19:48,389 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 476 states and 684 transitions. [2018-11-10 13:19:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 684 transitions. [2018-11-10 13:19:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 13:19:48,551 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 547 states and 764 transitions. [2018-11-10 13:19:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 764 transitions. [2018-11-10 13:19:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 13:19:48,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:49,121 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 13:19:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 556 states and 772 transitions. [2018-11-10 13:19:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 772 transitions. [2018-11-10 13:19:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 13:19:49,804 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 565 states and 783 transitions. [2018-11-10 13:19:49,863 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 783 transitions. [2018-11-10 13:19:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 13:19:49,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 574 states and 797 transitions. [2018-11-10 13:19:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 797 transitions. [2018-11-10 13:19:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 13:19:50,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 581 states and 803 transitions. [2018-11-10 13:19:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 803 transitions. [2018-11-10 13:19:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 13:19:50,776 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 586 states and 807 transitions. [2018-11-10 13:19:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 807 transitions. [2018-11-10 13:19:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 13:19:51,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 599 states and 822 transitions. [2018-11-10 13:19:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 822 transitions. [2018-11-10 13:19:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 13:19:51,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:19:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 601 states and 823 transitions. [2018-11-10 13:19:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 823 transitions. [2018-11-10 13:19:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 13:19:51,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 605 states and 826 transitions. [2018-11-10 13:19:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 826 transitions. [2018-11-10 13:19:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 13:19:51,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 619 states and 842 transitions. [2018-11-10 13:19:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 842 transitions. [2018-11-10 13:19:52,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 13:19:52,000 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:19:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 621 states and 843 transitions. [2018-11-10 13:19:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 843 transitions. [2018-11-10 13:19:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 13:19:52,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:19:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 623 states and 846 transitions. [2018-11-10 13:19:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 846 transitions. [2018-11-10 13:19:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 13:19:52,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 668 states and 894 transitions. [2018-11-10 13:19:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 894 transitions. [2018-11-10 13:19:54,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 13:19:54,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 13:19:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 765 states and 999 transitions. [2018-11-10 13:19:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 999 transitions. [2018-11-10 13:19:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 13:19:55,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 779 states and 1018 transitions. [2018-11-10 13:19:56,147 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1018 transitions. [2018-11-10 13:19:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:19:56,148 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 787 states and 1028 transitions. [2018-11-10 13:19:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1028 transitions. [2018-11-10 13:19:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:19:56,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 792 states and 1032 transitions. [2018-11-10 13:19:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1032 transitions. [2018-11-10 13:19:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:19:57,087 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:19:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 806 states and 1063 transitions. [2018-11-10 13:19:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1063 transitions. [2018-11-10 13:19:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:19:58,160 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:19:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 811 states and 1070 transitions. [2018-11-10 13:19:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1070 transitions. [2018-11-10 13:19:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:19:58,594 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:19:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:19:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 816 states and 1081 transitions. [2018-11-10 13:19:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1081 transitions. [2018-11-10 13:19:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 13:19:59,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:19:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:20:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 857 states and 1135 transitions. [2018-11-10 13:20:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1135 transitions. [2018-11-10 13:20:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 13:20:01,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:20:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 873 states and 1149 transitions. [2018-11-10 13:20:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1149 transitions. [2018-11-10 13:20:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 13:20:02,188 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:20:02,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 877 states and 1153 transitions. [2018-11-10 13:20:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1153 transitions. [2018-11-10 13:20:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 13:20:02,441 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:20:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 887 states and 1178 transitions. [2018-11-10 13:20:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1178 transitions. [2018-11-10 13:20:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 13:20:03,960 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 13:20:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 890 states and 1181 transitions. [2018-11-10 13:20:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1181 transitions. [2018-11-10 13:20:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 13:20:04,122 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:20:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 905 states and 1200 transitions. [2018-11-10 13:20:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1200 transitions. [2018-11-10 13:20:04,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 13:20:04,646 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:20:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 922 states and 1217 transitions. [2018-11-10 13:20:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1217 transitions. [2018-11-10 13:20:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 13:20:04,758 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:05,204 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 13:20:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 953 states and 1252 transitions. [2018-11-10 13:20:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1252 transitions. [2018-11-10 13:20:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 13:20:06,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:06,675 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 13:20:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 978 states and 1279 transitions. [2018-11-10 13:20:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1279 transitions. [2018-11-10 13:20:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 13:20:08,059 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:20:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 979 states and 1279 transitions. [2018-11-10 13:20:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1279 transitions. [2018-11-10 13:20:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 13:20:08,129 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:08,795 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 13:20:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1018 states and 1330 transitions. [2018-11-10 13:20:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1330 transitions. [2018-11-10 13:20:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 13:20:11,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:11,306 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 13:20:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1049 states and 1360 transitions. [2018-11-10 13:20:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1360 transitions. [2018-11-10 13:20:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 13:20:11,980 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:20:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1066 states and 1378 transitions. [2018-11-10 13:20:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1378 transitions. [2018-11-10 13:20:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 13:20:12,115 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:12,161 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 13:20:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1107 states and 1421 transitions. [2018-11-10 13:20:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1421 transitions. [2018-11-10 13:20:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 13:20:12,992 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:20:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1118 states and 1433 transitions. [2018-11-10 13:20:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1433 transitions. [2018-11-10 13:20:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 13:20:13,248 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:20:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1124 states and 1442 transitions. [2018-11-10 13:20:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1442 transitions. [2018-11-10 13:20:13,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 13:20:13,576 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:20:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1129 states and 1450 transitions. [2018-11-10 13:20:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1450 transitions. [2018-11-10 13:20:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 13:20:13,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:20:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1130 states and 1450 transitions. [2018-11-10 13:20:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1450 transitions. [2018-11-10 13:20:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 13:20:14,347 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:20:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1150 states and 1473 transitions. [2018-11-10 13:20:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1473 transitions. [2018-11-10 13:20:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 13:20:15,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 131 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 13:20:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1175 states and 1500 transitions. [2018-11-10 13:20:17,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1500 transitions. [2018-11-10 13:20:17,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:20:17,486 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:20:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1242 states and 1579 transitions. [2018-11-10 13:20:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1579 transitions. [2018-11-10 13:20:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:20:19,273 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:20:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1247 states and 1585 transitions. [2018-11-10 13:20:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1585 transitions. [2018-11-10 13:20:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:20:20,128 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:20:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1252 states and 1591 transitions. [2018-11-10 13:20:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1591 transitions. [2018-11-10 13:20:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:20:20,467 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:20:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1253 states and 1591 transitions. [2018-11-10 13:20:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1591 transitions. [2018-11-10 13:20:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:20:20,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:20:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1266 states and 1612 transitions. [2018-11-10 13:20:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1612 transitions. [2018-11-10 13:20:22,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:20:22,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:20:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1271 states and 1617 transitions. [2018-11-10 13:20:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1617 transitions. [2018-11-10 13:20:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:20:22,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:20:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1287 states and 1633 transitions. [2018-11-10 13:20:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1633 transitions. [2018-11-10 13:20:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:20:23,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:20:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1298 states and 1649 transitions. [2018-11-10 13:20:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1649 transitions. [2018-11-10 13:20:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:20:24,621 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:20:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1299 states and 1649 transitions. [2018-11-10 13:20:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1649 transitions. [2018-11-10 13:20:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:20:25,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:20:26,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1304 states and 1654 transitions. [2018-11-10 13:20:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1654 transitions. [2018-11-10 13:20:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 13:20:26,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 13:20:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1329 states and 1681 transitions. [2018-11-10 13:20:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1681 transitions. [2018-11-10 13:20:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 13:20:26,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 13:20:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1330 states and 1682 transitions. [2018-11-10 13:20:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1682 transitions. [2018-11-10 13:20:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 13:20:26,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 13:20:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1337 states and 1689 transitions. [2018-11-10 13:20:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1689 transitions. [2018-11-10 13:20:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 13:20:26,769 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 13:20:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1341 states and 1698 transitions. [2018-11-10 13:20:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1698 transitions. [2018-11-10 13:20:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 13:20:27,491 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 13:20:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1355 states and 1716 transitions. [2018-11-10 13:20:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1716 transitions. [2018-11-10 13:20:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 13:20:28,770 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 13:20:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1361 states and 1726 transitions. [2018-11-10 13:20:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1726 transitions. [2018-11-10 13:20:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 13:20:29,439 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 13:20:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1371 states and 1738 transitions. [2018-11-10 13:20:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1738 transitions. [2018-11-10 13:20:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 13:20:30,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 13:20:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1376 states and 1743 transitions. [2018-11-10 13:20:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1743 transitions. [2018-11-10 13:20:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 13:20:30,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:31,745 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 13:20:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1386 states and 1756 transitions. [2018-11-10 13:20:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1756 transitions. [2018-11-10 13:20:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 13:20:33,385 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:33,448 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 13:20:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1411 states and 1782 transitions. [2018-11-10 13:20:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1782 transitions. [2018-11-10 13:20:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 13:20:35,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:35,456 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 13:20:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1439 states and 1813 transitions. [2018-11-10 13:20:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1813 transitions. [2018-11-10 13:20:36,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 13:20:36,276 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:20:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1505 states and 1888 transitions. [2018-11-10 13:20:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1888 transitions. [2018-11-10 13:20:39,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 13:20:39,631 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:20:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1517 states and 1901 transitions. [2018-11-10 13:20:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1901 transitions. [2018-11-10 13:20:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 13:20:41,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:20:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1538 states and 1924 transitions. [2018-11-10 13:20:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1924 transitions. [2018-11-10 13:20:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 13:20:43,302 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 114 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 13:20:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 1661 states and 2058 transitions. [2018-11-10 13:20:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2058 transitions. [2018-11-10 13:20:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 13:20:45,663 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:45,705 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 13:20:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 1681 states and 2079 transitions. [2018-11-10 13:20:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2079 transitions. [2018-11-10 13:20:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 13:20:48,317 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:48,378 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 13:20:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 1688 states and 2084 transitions. [2018-11-10 13:20:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2084 transitions. [2018-11-10 13:20:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 13:20:49,701 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:50,226 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 13:20:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 1728 states and 2127 transitions. [2018-11-10 13:20:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2127 transitions. [2018-11-10 13:20:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 13:20:52,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:20:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 1776 states and 2175 transitions. [2018-11-10 13:20:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2175 transitions. [2018-11-10 13:20:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 13:20:56,621 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:56,668 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 13:20:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 1778 states and 2176 transitions. [2018-11-10 13:20:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2176 transitions. [2018-11-10 13:20:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 13:20:56,755 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:56,802 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 13:20:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:20:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 1780 states and 2177 transitions. [2018-11-10 13:20:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2177 transitions. [2018-11-10 13:20:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 13:20:57,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:20:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 13:21:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 1845 states and 2245 transitions. [2018-11-10 13:21:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2245 transitions. [2018-11-10 13:21:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 13:21:02,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:02,717 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 13:21:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 1876 states and 2282 transitions. [2018-11-10 13:21:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2282 transitions. [2018-11-10 13:21:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 13:21:04,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:05,162 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 13:21:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 1945 states and 2372 transitions. [2018-11-10 13:21:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2372 transitions. [2018-11-10 13:21:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 13:21:12,475 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 118 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 13:21:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 1968 states and 2395 transitions. [2018-11-10 13:21:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2395 transitions. [2018-11-10 13:21:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 13:21:13,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 204 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:21:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2047 states and 2492 transitions. [2018-11-10 13:21:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2492 transitions. [2018-11-10 13:21:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 13:21:20,499 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 137 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-10 13:21:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2052 states and 2496 transitions. [2018-11-10 13:21:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2496 transitions. [2018-11-10 13:21:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 13:21:20,855 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 137 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-10 13:21:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2060 states and 2504 transitions. [2018-11-10 13:21:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2504 transitions. [2018-11-10 13:21:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 13:21:21,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 13:21:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2131 states and 2578 transitions. [2018-11-10 13:21:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2578 transitions. [2018-11-10 13:21:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 13:21:22,412 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:21:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2184 states and 2633 transitions. [2018-11-10 13:21:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2633 transitions. [2018-11-10 13:21:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-10 13:21:28,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-10 13:21:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2185 states and 2633 transitions. [2018-11-10 13:21:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2633 transitions. [2018-11-10 13:21:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-10 13:21:28,360 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-10 13:21:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2193 states and 2641 transitions. [2018-11-10 13:21:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2641 transitions. [2018-11-10 13:21:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-10 13:21:28,813 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-10 13:21:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2198 states and 2645 transitions. [2018-11-10 13:21:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 2645 transitions. [2018-11-10 13:21:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 13:21:29,276 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 347 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 13:21:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2180 states and 2626 transitions. [2018-11-10 13:21:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2626 transitions. [2018-11-10 13:21:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-10 13:21:31,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-10 13:21:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:21:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2186 states and 2635 transitions. [2018-11-10 13:21:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2635 transitions. [2018-11-10 13:21:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-10 13:21:31,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:21:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:21:32,122 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 131 iterations. [2018-11-10 13:21:32,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 01:21:32 ImpRootNode [2018-11-10 13:21:32,270 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 13:21:32,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:21:32,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:21:32,271 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:21:32,271 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:19:29" (3/4) ... [2018-11-10 13:21:32,273 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 13:21:32,396 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0d6a0aac-596e-4cb9-93c2-4e3e9402a44b/bin-2019/ukojak/witness.graphml [2018-11-10 13:21:32,396 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:21:32,397 INFO L168 Benchmark]: Toolchain (without parser) took 125383.89 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 951.1 MB in the beginning and 1.7 GB in the end (delta: -730.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-11-10 13:21:32,397 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:21:32,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.39 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 924.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:21:32,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 924.2 MB in the beginning and 1.1 GB in the end (delta: -206.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:21:32,398 INFO L168 Benchmark]: Boogie Preprocessor took 45.54 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:21:32,398 INFO L168 Benchmark]: RCFGBuilder took 1611.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.7 MB in the end (delta: 232.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:21:32,398 INFO L168 Benchmark]: CodeCheck took 123143.01 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 891.7 MB in the beginning and 1.7 GB in the end (delta: -841.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-10 13:21:32,399 INFO L168 Benchmark]: Witness Printer took 125.22 ms. Allocated memory is still 3.7 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:21:32,400 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, 122.9s OverallTime, 131 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1316931196 SDtfs, 1329561164 SDslu, -1698067552 SDs, 0 SdLazy, 510005124 SolverSat, -1977165960 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 332.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128478 GetRequests, 124193 SyntacticMatches, 2811 SemanticMatches, 1474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490990 ImplicationChecksByTransitivity, 108.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 18415 NumberOfCodeBlocks, 18415 NumberOfCodeBlocksAsserted, 131 NumberOfCheckSat, 18016 ConstructedInterpolants, 0 QuantifiedInterpolants, 13225829 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 130 InterpolantComputations, 100 PerfectInterpolantSequences, 11533/12040 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: 410]: 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 TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] RET return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND 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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND TRUE ((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5)) [L366] a21 = 1 [L367] a7 = 0 [L368] a17 = 0 [L369] a8 = 14 [L370] a20 = 0 [L371] RET return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] 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=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] __VERIFIER_error() VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.39 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 924.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 924.2 MB in the beginning and 1.1 GB in the end (delta: -206.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.54 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1611.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.7 MB in the end (delta: 232.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 11.5 GB. * CodeCheck took 123143.01 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 891.7 MB in the beginning and 1.7 GB in the end (delta: -841.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 125.22 ms. Allocated memory is still 3.7 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...