./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label35_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label35_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/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 e1627e38bed35af1698e9f3e6e9827d6a9566f03 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-635dfa2 [2018-12-01 18:10:14,075 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 18:10:14,076 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 18:10:14,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 18:10:14,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 18:10:14,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 18:10:14,084 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 18:10:14,084 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 18:10:14,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 18:10:14,086 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 18:10:14,086 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 18:10:14,086 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 18:10:14,087 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 18:10:14,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 18:10:14,088 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 18:10:14,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 18:10:14,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 18:10:14,089 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 18:10:14,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 18:10:14,091 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 18:10:14,091 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 18:10:14,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 18:10:14,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 18:10:14,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 18:10:14,093 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 18:10:14,093 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 18:10:14,094 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 18:10:14,094 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 18:10:14,095 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 18:10:14,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 18:10:14,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 18:10:14,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 18:10:14,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 18:10:14,096 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 18:10:14,096 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 18:10:14,096 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 18:10:14,097 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-01 18:10:14,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 18:10:14,104 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 18:10:14,104 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 18:10:14,104 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-01 18:10:14,104 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 18:10:14,105 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 18:10:14,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 18:10:14,105 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 18:10:14,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 18:10:14,105 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 18:10:14,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 18:10:14,105 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 18:10:14,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 18:10:14,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 18:10:14,105 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 18:10:14,105 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 18:10:14,105 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 18:10:14,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 18:10:14,106 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-01 18:10:14,106 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-01 18:10:14,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 18:10:14,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 18:10:14,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 18:10:14,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 18:10:14,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 18:10:14,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 18:10:14,106 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-01 18:10:14,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 18:10:14,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 18:10:14,107 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_7fa404e3-f567-475d-bf90-91486e0b0201/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 -> e1627e38bed35af1698e9f3e6e9827d6a9566f03 [2018-12-01 18:10:14,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 18:10:14,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 18:10:14,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 18:10:14,132 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 18:10:14,133 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 18:10:14,133 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label35_false-unreach-call_false-termination.c [2018-12-01 18:10:14,168 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/bin-2019/ukojak/data/115244b7c/960df921adfc44cda4dbd0a47edab466/FLAG350d3e82a [2018-12-01 18:10:14,607 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 18:10:14,607 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/sv-benchmarks/c/eca-rers2012/Problem01_label35_false-unreach-call_false-termination.c [2018-12-01 18:10:14,614 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/bin-2019/ukojak/data/115244b7c/960df921adfc44cda4dbd0a47edab466/FLAG350d3e82a [2018-12-01 18:10:14,622 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/bin-2019/ukojak/data/115244b7c/960df921adfc44cda4dbd0a47edab466 [2018-12-01 18:10:14,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 18:10:14,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 18:10:14,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 18:10:14,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 18:10:14,627 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 18:10:14,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:10:14" (1/1) ... [2018-12-01 18:10:14,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2caf47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:10:14, skipping insertion in model container [2018-12-01 18:10:14,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:10:14" (1/1) ... [2018-12-01 18:10:14,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 18:10:14,658 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 18:10:14,832 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:10:14,835 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 18:10:14,883 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:10:14,940 INFO L195 MainTranslator]: Completed translation [2018-12-01 18:10:14,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:10:14 WrapperNode [2018-12-01 18:10:14,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 18:10:14,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 18:10:14,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 18:10:14,941 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 18:10:14,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:10:14" (1/1) ... [2018-12-01 18:10:14,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:10:14" (1/1) ... [2018-12-01 18:10:14,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 18:10:14,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 18:10:14,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 18:10:14,985 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 18:10:14,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:10:14" (1/1) ... [2018-12-01 18:10:14,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:10:14" (1/1) ... [2018-12-01 18:10:14,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:10:14" (1/1) ... [2018-12-01 18:10:14,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:10:14" (1/1) ... [2018-12-01 18:10:15,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:10:14" (1/1) ... [2018-12-01 18:10:15,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:10:14" (1/1) ... [2018-12-01 18:10:15,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:10:14" (1/1) ... [2018-12-01 18:10:15,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 18:10:15,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 18:10:15,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 18:10:15,014 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 18:10:15,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:10:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/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-12-01 18:10:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 18:10:15,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 18:10:16,067 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 18:10:16,068 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-01 18:10:16,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:10:16 BoogieIcfgContainer [2018-12-01 18:10:16,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 18:10:16,069 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-01 18:10:16,069 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-01 18:10:16,079 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-01 18:10:16,080 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:10:16" (1/1) ... [2018-12-01 18:10:16,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:10:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-01 18:10:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-01 18:10:16,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-01 18:10:16,138 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:16,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 145 states and 239 transitions. [2018-12-01 18:10:16,676 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 239 transitions. [2018-12-01 18:10:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-01 18:10:16,677 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 146 states and 240 transitions. [2018-12-01 18:10:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 240 transitions. [2018-12-01 18:10:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-01 18:10:16,938 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 150 states and 247 transitions. [2018-12-01 18:10:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 247 transitions. [2018-12-01 18:10:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-01 18:10:17,045 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 151 states and 249 transitions. [2018-12-01 18:10:17,099 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 249 transitions. [2018-12-01 18:10:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 18:10:17,102 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 221 states and 323 transitions. [2018-12-01 18:10:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 323 transitions. [2018-12-01 18:10:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-01 18:10:17,533 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 228 states and 337 transitions. [2018-12-01 18:10:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2018-12-01 18:10:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-01 18:10:17,763 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 18:10:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 229 states and 338 transitions. [2018-12-01 18:10:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 338 transitions. [2018-12-01 18:10:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-01 18:10:17,803 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 233 states and 344 transitions. [2018-12-01 18:10:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 344 transitions. [2018-12-01 18:10:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-01 18:10:17,961 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 241 states and 360 transitions. [2018-12-01 18:10:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 360 transitions. [2018-12-01 18:10:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-01 18:10:18,435 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-01 18:10:18,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 246 states and 369 transitions. [2018-12-01 18:10:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 369 transitions. [2018-12-01 18:10:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-01 18:10:18,583 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 250 states and 376 transitions. [2018-12-01 18:10:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2018-12-01 18:10:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-01 18:10:18,847 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 255 states and 383 transitions. [2018-12-01 18:10:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 383 transitions. [2018-12-01 18:10:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 18:10:18,934 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 261 states and 392 transitions. [2018-12-01 18:10:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 392 transitions. [2018-12-01 18:10:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 18:10:19,148 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 264 states and 395 transitions. [2018-12-01 18:10:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 395 transitions. [2018-12-01 18:10:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 18:10:19,251 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 278 states and 418 transitions. [2018-12-01 18:10:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 418 transitions. [2018-12-01 18:10:19,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-01 18:10:19,912 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 282 states and 427 transitions. [2018-12-01 18:10:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 427 transitions. [2018-12-01 18:10:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-01 18:10:20,220 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 283 states and 427 transitions. [2018-12-01 18:10:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 427 transitions. [2018-12-01 18:10:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-01 18:10:20,311 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 18:10:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 285 states and 428 transitions. [2018-12-01 18:10:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 428 transitions. [2018-12-01 18:10:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-01 18:10:20,432 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2018-12-01 18:10:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2018-12-01 18:10:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-01 18:10:20,772 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 18:10:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 292 states and 437 transitions. [2018-12-01 18:10:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 437 transitions. [2018-12-01 18:10:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 18:10:20,934 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 297 states and 442 transitions. [2018-12-01 18:10:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 442 transitions. [2018-12-01 18:10:20,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 18:10:20,986 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 298 states and 442 transitions. [2018-12-01 18:10:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 442 transitions. [2018-12-01 18:10:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 18:10:21,065 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 305 states and 451 transitions. [2018-12-01 18:10:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 451 transitions. [2018-12-01 18:10:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 18:10:21,392 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 323 states and 480 transitions. [2018-12-01 18:10:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 480 transitions. [2018-12-01 18:10:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 18:10:23,137 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 18:10:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 328 states and 488 transitions. [2018-12-01 18:10:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 488 transitions. [2018-12-01 18:10:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-01 18:10:23,375 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 18:10:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 335 states and 498 transitions. [2018-12-01 18:10:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 498 transitions. [2018-12-01 18:10:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-01 18:10:23,528 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 18:10:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 337 states and 500 transitions. [2018-12-01 18:10:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 500 transitions. [2018-12-01 18:10:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-01 18:10:23,817 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:10:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 338 states and 502 transitions. [2018-12-01 18:10:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2018-12-01 18:10:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-01 18:10:23,930 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 345 states and 511 transitions. [2018-12-01 18:10:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 511 transitions. [2018-12-01 18:10:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-01 18:10:24,069 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:10:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 347 states and 513 transitions. [2018-12-01 18:10:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 513 transitions. [2018-12-01 18:10:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-01 18:10:24,173 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 374 states and 551 transitions. [2018-12-01 18:10:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 551 transitions. [2018-12-01 18:10:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 18:10:25,285 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 396 states and 591 transitions. [2018-12-01 18:10:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 591 transitions. [2018-12-01 18:10:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 18:10:26,523 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 398 states and 593 transitions. [2018-12-01 18:10:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 593 transitions. [2018-12-01 18:10:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 18:10:26,569 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 414 states and 612 transitions. [2018-12-01 18:10:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 612 transitions. [2018-12-01 18:10:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-01 18:10:27,333 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 18:10:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 422 states and 622 transitions. [2018-12-01 18:10:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 622 transitions. [2018-12-01 18:10:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 18:10:27,632 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:10:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 427 states and 627 transitions. [2018-12-01 18:10:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 627 transitions. [2018-12-01 18:10:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 18:10:27,667 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:10:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 429 states and 630 transitions. [2018-12-01 18:10:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 630 transitions. [2018-12-01 18:10:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-01 18:10:27,868 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 432 states and 633 transitions. [2018-12-01 18:10:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 633 transitions. [2018-12-01 18:10:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-01 18:10:28,005 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 453 states and 658 transitions. [2018-12-01 18:10:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 658 transitions. [2018-12-01 18:10:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-01 18:10:28,607 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 464 states and 670 transitions. [2018-12-01 18:10:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 670 transitions. [2018-12-01 18:10:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 18:10:29,123 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 478 states and 691 transitions. [2018-12-01 18:10:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 691 transitions. [2018-12-01 18:10:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 18:10:31,026 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 484 states and 698 transitions. [2018-12-01 18:10:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 698 transitions. [2018-12-01 18:10:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 18:10:31,332 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 491 states and 706 transitions. [2018-12-01 18:10:31,542 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 706 transitions. [2018-12-01 18:10:31,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 18:10:31,542 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 498 states and 713 transitions. [2018-12-01 18:10:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 713 transitions. [2018-12-01 18:10:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-01 18:10:31,585 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 500 states and 717 transitions. [2018-12-01 18:10:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 717 transitions. [2018-12-01 18:10:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-01 18:10:31,694 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 502 states and 719 transitions. [2018-12-01 18:10:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 719 transitions. [2018-12-01 18:10:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-01 18:10:31,726 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 18:10:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 506 states and 725 transitions. [2018-12-01 18:10:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 725 transitions. [2018-12-01 18:10:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-01 18:10:32,236 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 537 states and 762 transitions. [2018-12-01 18:10:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 762 transitions. [2018-12-01 18:10:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-01 18:10:35,039 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 557 states and 790 transitions. [2018-12-01 18:10:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 790 transitions. [2018-12-01 18:10:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-01 18:10:36,175 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:36,209 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 563 states and 798 transitions. [2018-12-01 18:10:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 798 transitions. [2018-12-01 18:10:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-01 18:10:36,681 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 576 states and 813 transitions. [2018-12-01 18:10:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 813 transitions. [2018-12-01 18:10:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-01 18:10:37,289 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 581 states and 819 transitions. [2018-12-01 18:10:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 819 transitions. [2018-12-01 18:10:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-01 18:10:37,560 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 601 states and 847 transitions. [2018-12-01 18:10:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 847 transitions. [2018-12-01 18:10:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-01 18:10:39,062 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 608 states and 853 transitions. [2018-12-01 18:10:39,560 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 853 transitions. [2018-12-01 18:10:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-01 18:10:39,561 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 622 states and 869 transitions. [2018-12-01 18:10:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 869 transitions. [2018-12-01 18:10:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-01 18:10:39,951 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 631 states and 882 transitions. [2018-12-01 18:10:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 882 transitions. [2018-12-01 18:10:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-01 18:10:40,209 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 636 states and 891 transitions. [2018-12-01 18:10:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 891 transitions. [2018-12-01 18:10:40,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-01 18:10:40,881 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 643 states and 903 transitions. [2018-12-01 18:10:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 903 transitions. [2018-12-01 18:10:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-01 18:10:42,392 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 644 states and 904 transitions. [2018-12-01 18:10:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 904 transitions. [2018-12-01 18:10:42,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-01 18:10:42,685 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 645 states and 905 transitions. [2018-12-01 18:10:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 905 transitions. [2018-12-01 18:10:42,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-01 18:10:42,932 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 651 states and 913 transitions. [2018-12-01 18:10:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 913 transitions. [2018-12-01 18:10:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-01 18:10:43,429 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 18:10:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 660 states and 921 transitions. [2018-12-01 18:10:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 921 transitions. [2018-12-01 18:10:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-01 18:10:44,002 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 685 states and 962 transitions. [2018-12-01 18:10:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 962 transitions. [2018-12-01 18:10:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-01 18:10:45,618 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:10:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 710 states and 988 transitions. [2018-12-01 18:10:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 988 transitions. [2018-12-01 18:10:46,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-01 18:10:46,360 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 725 states and 1011 transitions. [2018-12-01 18:10:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1011 transitions. [2018-12-01 18:10:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-01 18:10:47,609 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 732 states and 1019 transitions. [2018-12-01 18:10:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1019 transitions. [2018-12-01 18:10:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-01 18:10:48,264 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 733 states and 1020 transitions. [2018-12-01 18:10:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1020 transitions. [2018-12-01 18:10:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-01 18:10:48,573 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 735 states and 1021 transitions. [2018-12-01 18:10:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1021 transitions. [2018-12-01 18:10:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-01 18:10:48,740 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 737 states and 1022 transitions. [2018-12-01 18:10:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1022 transitions. [2018-12-01 18:10:48,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-01 18:10:48,895 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 747 states and 1033 transitions. [2018-12-01 18:10:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1033 transitions. [2018-12-01 18:10:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-01 18:10:48,938 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:10:49,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 748 states and 1034 transitions. [2018-12-01 18:10:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1034 transitions. [2018-12-01 18:10:49,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-01 18:10:49,080 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:10:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 761 states and 1056 transitions. [2018-12-01 18:10:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1056 transitions. [2018-12-01 18:10:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-01 18:10:50,356 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 801 states and 1098 transitions. [2018-12-01 18:10:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1098 transitions. [2018-12-01 18:10:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-01 18:10:52,502 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 811 states and 1120 transitions. [2018-12-01 18:10:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1120 transitions. [2018-12-01 18:10:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-01 18:10:53,760 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 812 states and 1120 transitions. [2018-12-01 18:10:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1120 transitions. [2018-12-01 18:10:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-01 18:10:53,939 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 813 states and 1121 transitions. [2018-12-01 18:10:54,206 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1121 transitions. [2018-12-01 18:10:54,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-01 18:10:54,207 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 814 states and 1122 transitions. [2018-12-01 18:10:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1122 transitions. [2018-12-01 18:10:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-01 18:10:54,512 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:10:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 826 states and 1137 transitions. [2018-12-01 18:10:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1137 transitions. [2018-12-01 18:10:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-01 18:10:55,525 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:10:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 833 states and 1145 transitions. [2018-12-01 18:10:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1145 transitions. [2018-12-01 18:10:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-01 18:10:55,991 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 847 states and 1167 transitions. [2018-12-01 18:10:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1167 transitions. [2018-12-01 18:10:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-01 18:10:58,027 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 850 states and 1171 transitions. [2018-12-01 18:10:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1171 transitions. [2018-12-01 18:10:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-01 18:10:59,070 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 852 states and 1173 transitions. [2018-12-01 18:10:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1173 transitions. [2018-12-01 18:10:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-01 18:10:59,623 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:10:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:10:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 857 states and 1179 transitions. [2018-12-01 18:10:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1179 transitions. [2018-12-01 18:10:59,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 18:10:59,938 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:10:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:10:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:11:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 889 states and 1221 transitions. [2018-12-01 18:11:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1221 transitions. [2018-12-01 18:11:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 18:11:04,238 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-01 18:11:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 890 states and 1222 transitions. [2018-12-01 18:11:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1222 transitions. [2018-12-01 18:11:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 18:11:04,271 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-01 18:11:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 892 states and 1225 transitions. [2018-12-01 18:11:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1225 transitions. [2018-12-01 18:11:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 18:11:04,432 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:11:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 896 states and 1228 transitions. [2018-12-01 18:11:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1228 transitions. [2018-12-01 18:11:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 18:11:04,941 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:11:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 940 states and 1274 transitions. [2018-12-01 18:11:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1274 transitions. [2018-12-01 18:11:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 18:11:05,746 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-01 18:11:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 941 states and 1274 transitions. [2018-12-01 18:11:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1274 transitions. [2018-12-01 18:11:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 18:11:05,906 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:11:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 955 states and 1286 transitions. [2018-12-01 18:11:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1286 transitions. [2018-12-01 18:11:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 18:11:07,162 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:11:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 956 states and 1286 transitions. [2018-12-01 18:11:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1286 transitions. [2018-12-01 18:11:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 18:11:07,204 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:11:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 957 states and 1286 transitions. [2018-12-01 18:11:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1286 transitions. [2018-12-01 18:11:07,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-01 18:11:07,415 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 18:11:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 981 states and 1322 transitions. [2018-12-01 18:11:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1322 transitions. [2018-12-01 18:11:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-01 18:11:11,883 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-01 18:11:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 983 states and 1325 transitions. [2018-12-01 18:11:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1325 transitions. [2018-12-01 18:11:12,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-01 18:11:12,294 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-01 18:11:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 996 states and 1349 transitions. [2018-12-01 18:11:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1349 transitions. [2018-12-01 18:11:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-01 18:11:15,653 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-01 18:11:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 998 states and 1352 transitions. [2018-12-01 18:11:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1352 transitions. [2018-12-01 18:11:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-01 18:11:16,017 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-01 18:11:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 999 states and 1352 transitions. [2018-12-01 18:11:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1352 transitions. [2018-12-01 18:11:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-01 18:11:16,055 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-01 18:11:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1000 states and 1353 transitions. [2018-12-01 18:11:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1353 transitions. [2018-12-01 18:11:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-01 18:11:16,408 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:11:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1070 states and 1427 transitions. [2018-12-01 18:11:17,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1427 transitions. [2018-12-01 18:11:17,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-01 18:11:17,931 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:11:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1093 states and 1453 transitions. [2018-12-01 18:11:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1453 transitions. [2018-12-01 18:11:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-01 18:11:20,132 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:11:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1096 states and 1455 transitions. [2018-12-01 18:11:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1455 transitions. [2018-12-01 18:11:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-01 18:11:20,791 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-01 18:11:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1098 states and 1456 transitions. [2018-12-01 18:11:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1456 transitions. [2018-12-01 18:11:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-01 18:11:21,183 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-01 18:11:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1100 states and 1457 transitions. [2018-12-01 18:11:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1457 transitions. [2018-12-01 18:11:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-01 18:11:22,133 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:11:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1111 states and 1471 transitions. [2018-12-01 18:11:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1471 transitions. [2018-12-01 18:11:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-01 18:11:23,833 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:11:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1126 states and 1492 transitions. [2018-12-01 18:11:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1492 transitions. [2018-12-01 18:11:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-01 18:11:29,419 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:11:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1127 states and 1493 transitions. [2018-12-01 18:11:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1493 transitions. [2018-12-01 18:11:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-01 18:11:29,506 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:11:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1194 states and 1565 transitions. [2018-12-01 18:11:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1565 transitions. [2018-12-01 18:11:37,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-01 18:11:37,080 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-01 18:11:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1207 states and 1584 transitions. [2018-12-01 18:11:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1584 transitions. [2018-12-01 18:11:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-01 18:11:38,870 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:11:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1320 states and 1712 transitions. [2018-12-01 18:11:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1712 transitions. [2018-12-01 18:11:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-01 18:11:53,379 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:11:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1342 states and 1737 transitions. [2018-12-01 18:11:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1737 transitions. [2018-12-01 18:11:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-01 18:11:58,925 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:11:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:11:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1348 states and 1742 transitions. [2018-12-01 18:11:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1742 transitions. [2018-12-01 18:11:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-01 18:11:59,337 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:11:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:11:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:12:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1374 states and 1767 transitions. [2018-12-01 18:12:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1767 transitions. [2018-12-01 18:12:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 18:12:00,121 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-01 18:12:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1399 states and 1797 transitions. [2018-12-01 18:12:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1797 transitions. [2018-12-01 18:12:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 18:12:04,380 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-01 18:12:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1410 states and 1809 transitions. [2018-12-01 18:12:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1809 transitions. [2018-12-01 18:12:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 18:12:04,462 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-01 18:12:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1424 states and 1828 transitions. [2018-12-01 18:12:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1828 transitions. [2018-12-01 18:12:05,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 18:12:05,619 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-01 18:12:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1431 states and 1836 transitions. [2018-12-01 18:12:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1836 transitions. [2018-12-01 18:12:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 18:12:06,429 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-01 18:12:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1436 states and 1841 transitions. [2018-12-01 18:12:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1841 transitions. [2018-12-01 18:12:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 18:12:06,852 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:12:10,193 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-12-01 18:12:13,467 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2018-12-01 18:12:14,003 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-01 18:12:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1465 states and 1885 transitions. [2018-12-01 18:12:18,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1885 transitions. [2018-12-01 18:12:18,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 18:12:18,290 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:12:18,544 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2018-12-01 18:12:18,976 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-01 18:12:21,327 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-12-01 18:12:24,066 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-12-01 18:12:26,440 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-12-01 18:12:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1482 states and 1906 transitions. [2018-12-01 18:12:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1906 transitions. [2018-12-01 18:12:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 18:12:28,479 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:12:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1484 states and 1907 transitions. [2018-12-01 18:12:29,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1907 transitions. [2018-12-01 18:12:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 18:12:29,516 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:12:31,277 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-12-01 18:12:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1492 states and 1913 transitions. [2018-12-01 18:12:32,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1913 transitions. [2018-12-01 18:12:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-01 18:12:32,329 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-01 18:12:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1493 states and 1914 transitions. [2018-12-01 18:12:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1914 transitions. [2018-12-01 18:12:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-01 18:12:32,389 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-01 18:12:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1494 states and 1916 transitions. [2018-12-01 18:12:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1916 transitions. [2018-12-01 18:12:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-01 18:12:32,433 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-01 18:12:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1498 states and 1921 transitions. [2018-12-01 18:12:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1921 transitions. [2018-12-01 18:12:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-01 18:12:32,901 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:12:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1515 states and 1943 transitions. [2018-12-01 18:12:36,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1943 transitions. [2018-12-01 18:12:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-01 18:12:36,808 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:12:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:39,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1521 states and 1950 transitions. [2018-12-01 18:12:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1950 transitions. [2018-12-01 18:12:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-01 18:12:39,173 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:12:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 1586 states and 2014 transitions. [2018-12-01 18:12:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2014 transitions. [2018-12-01 18:12:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-01 18:12:40,262 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:12:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 1595 states and 2029 transitions. [2018-12-01 18:12:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2029 transitions. [2018-12-01 18:12:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-01 18:12:43,292 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-01 18:12:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 1601 states and 2038 transitions. [2018-12-01 18:12:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2038 transitions. [2018-12-01 18:12:45,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-01 18:12:45,485 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:12:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 1604 states and 2042 transitions. [2018-12-01 18:12:45,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2042 transitions. [2018-12-01 18:12:45,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-01 18:12:45,955 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:12:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 1625 states and 2068 transitions. [2018-12-01 18:12:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2068 transitions. [2018-12-01 18:12:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-01 18:12:51,025 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:12:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 1627 states and 2070 transitions. [2018-12-01 18:12:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2070 transitions. [2018-12-01 18:12:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-01 18:12:51,883 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:12:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:52,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 1628 states and 2070 transitions. [2018-12-01 18:12:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2070 transitions. [2018-12-01 18:12:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-01 18:12:52,338 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-01 18:12:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 1636 states and 2079 transitions. [2018-12-01 18:12:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2079 transitions. [2018-12-01 18:12:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-01 18:12:53,027 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-01 18:12:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 1638 states and 2081 transitions. [2018-12-01 18:12:55,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2081 transitions. [2018-12-01 18:12:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-01 18:12:55,093 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-01 18:12:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 1643 states and 2088 transitions. [2018-12-01 18:12:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2088 transitions. [2018-12-01 18:12:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-01 18:12:56,154 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:12:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:12:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 1658 states and 2110 transitions. [2018-12-01 18:12:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2110 transitions. [2018-12-01 18:12:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-01 18:12:58,909 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:12:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:12:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:13:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 1664 states and 2119 transitions. [2018-12-01 18:13:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2119 transitions. [2018-12-01 18:13:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-01 18:13:00,920 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 98 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:13:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 1676 states and 2132 transitions. [2018-12-01 18:13:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2132 transitions. [2018-12-01 18:13:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-01 18:13:11,166 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:13:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 1692 states and 2156 transitions. [2018-12-01 18:13:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2156 transitions. [2018-12-01 18:13:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-01 18:13:15,163 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:13:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 1702 states and 2172 transitions. [2018-12-01 18:13:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2172 transitions. [2018-12-01 18:13:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-01 18:13:20,801 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-01 18:13:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 1727 states and 2211 transitions. [2018-12-01 18:13:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2211 transitions. [2018-12-01 18:13:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-01 18:13:25,088 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-01 18:13:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 1732 states and 2216 transitions. [2018-12-01 18:13:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2216 transitions. [2018-12-01 18:13:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-01 18:13:25,657 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-01 18:13:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 1744 states and 2230 transitions. [2018-12-01 18:13:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2230 transitions. [2018-12-01 18:13:31,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-01 18:13:31,363 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-01 18:13:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 1749 states and 2240 transitions. [2018-12-01 18:13:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2240 transitions. [2018-12-01 18:13:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-01 18:13:35,421 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:13:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 1756 states and 2248 transitions. [2018-12-01 18:13:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2248 transitions. [2018-12-01 18:13:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-01 18:13:36,395 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-01 18:13:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 1781 states and 2273 transitions. [2018-12-01 18:13:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2273 transitions. [2018-12-01 18:13:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-01 18:13:39,330 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-01 18:13:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 1786 states and 2278 transitions. [2018-12-01 18:13:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2278 transitions. [2018-12-01 18:13:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-01 18:13:40,370 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-01 18:13:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 1790 states and 2284 transitions. [2018-12-01 18:13:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2284 transitions. [2018-12-01 18:13:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-01 18:13:41,798 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-01 18:13:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 1798 states and 2290 transitions. [2018-12-01 18:13:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2290 transitions. [2018-12-01 18:13:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-01 18:13:43,661 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-01 18:13:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 1817 states and 2309 transitions. [2018-12-01 18:13:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2309 transitions. [2018-12-01 18:13:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-01 18:13:43,935 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-01 18:13:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 1825 states and 2324 transitions. [2018-12-01 18:13:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2324 transitions. [2018-12-01 18:13:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-01 18:13:46,464 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-01 18:13:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 1828 states and 2329 transitions. [2018-12-01 18:13:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2329 transitions. [2018-12-01 18:13:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-01 18:13:48,107 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-01 18:13:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 1829 states and 2329 transitions. [2018-12-01 18:13:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2329 transitions. [2018-12-01 18:13:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-01 18:13:48,737 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-01 18:13:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 1830 states and 2330 transitions. [2018-12-01 18:13:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2330 transitions. [2018-12-01 18:13:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-01 18:13:49,372 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-01 18:13:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 1832 states and 2332 transitions. [2018-12-01 18:13:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2332 transitions. [2018-12-01 18:13:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-01 18:13:49,935 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:13:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 1842 states and 2342 transitions. [2018-12-01 18:13:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2342 transitions. [2018-12-01 18:13:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-01 18:13:51,095 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:13:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:13:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 1857 states and 2360 transitions. [2018-12-01 18:13:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2360 transitions. [2018-12-01 18:13:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-01 18:13:54,160 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:13:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:14:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 1868 states and 2375 transitions. [2018-12-01 18:14:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2375 transitions. [2018-12-01 18:14:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-01 18:14:00,789 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:14:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 1869 states and 2375 transitions. [2018-12-01 18:14:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2375 transitions. [2018-12-01 18:14:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-01 18:14:01,863 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-01 18:14:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 1871 states and 2376 transitions. [2018-12-01 18:14:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2376 transitions. [2018-12-01 18:14:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-01 18:14:02,473 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-01 18:14:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 1896 states and 2406 transitions. [2018-12-01 18:14:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2406 transitions. [2018-12-01 18:14:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-01 18:14:10,627 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-01 18:14:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 1904 states and 2423 transitions. [2018-12-01 18:14:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2423 transitions. [2018-12-01 18:14:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-01 18:14:12,818 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-01 18:14:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 1906 states and 2424 transitions. [2018-12-01 18:14:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2424 transitions. [2018-12-01 18:14:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-01 18:14:13,921 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-01 18:14:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 1914 states and 2433 transitions. [2018-12-01 18:14:15,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2433 transitions. [2018-12-01 18:14:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-01 18:14:15,201 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-01 18:14:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 1924 states and 2444 transitions. [2018-12-01 18:14:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2444 transitions. [2018-12-01 18:14:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-01 18:14:19,062 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 193 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-01 18:14:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 1929 states and 2450 transitions. [2018-12-01 18:14:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2450 transitions. [2018-12-01 18:14:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-01 18:14:19,823 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-01 18:14:31,847 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-12-01 18:14:36,217 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-01 18:14:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 1962 states and 2484 transitions. [2018-12-01 18:14:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2484 transitions. [2018-12-01 18:14:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-01 18:14:38,694 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-01 18:14:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 1977 states and 2500 transitions. [2018-12-01 18:14:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2500 transitions. [2018-12-01 18:14:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-01 18:14:41,112 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:14:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 1982 states and 2505 transitions. [2018-12-01 18:14:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2505 transitions. [2018-12-01 18:14:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-01 18:14:42,148 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:14:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 1984 states and 2505 transitions. [2018-12-01 18:14:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2505 transitions. [2018-12-01 18:14:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-01 18:14:42,976 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-12-01 18:14:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2012 states and 2537 transitions. [2018-12-01 18:14:44,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2537 transitions. [2018-12-01 18:14:44,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-01 18:14:44,488 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 18:14:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2017 states and 2544 transitions. [2018-12-01 18:14:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2544 transitions. [2018-12-01 18:14:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-01 18:14:46,858 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:15:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2071 states and 2606 transitions. [2018-12-01 18:15:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2606 transitions. [2018-12-01 18:15:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-01 18:15:00,549 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-01 18:15:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2076 states and 2612 transitions. [2018-12-01 18:15:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2612 transitions. [2018-12-01 18:15:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-01 18:15:02,092 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:15:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2088 states and 2632 transitions. [2018-12-01 18:15:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2632 transitions. [2018-12-01 18:15:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-01 18:15:04,279 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:15:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2102 states and 2647 transitions. [2018-12-01 18:15:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2647 transitions. [2018-12-01 18:15:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-01 18:15:10,412 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:15:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2103 states and 2647 transitions. [2018-12-01 18:15:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 2647 transitions. [2018-12-01 18:15:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-01 18:15:10,983 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 18:15:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2110 states and 2654 transitions. [2018-12-01 18:15:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2654 transitions. [2018-12-01 18:15:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-01 18:15:13,899 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:16,314 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-01 18:15:17,646 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-01 18:15:18,700 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-01 18:15:19,686 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-12-01 18:15:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:15:23,097 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-01 18:15:27,668 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-01 18:15:36,287 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-12-01 18:15:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2155 states and 2703 transitions. [2018-12-01 18:15:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2703 transitions. [2018-12-01 18:15:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-01 18:15:40,900 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:15:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2157 states and 2705 transitions. [2018-12-01 18:15:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2705 transitions. [2018-12-01 18:15:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-01 18:15:41,904 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:15:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2172 states and 2719 transitions. [2018-12-01 18:15:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2719 transitions. [2018-12-01 18:15:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-01 18:15:45,387 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:15:46,050 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-12-01 18:15:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2176 states and 2723 transitions. [2018-12-01 18:15:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2723 transitions. [2018-12-01 18:15:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-01 18:15:47,518 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:15:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2181 states and 2728 transitions. [2018-12-01 18:15:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2728 transitions. [2018-12-01 18:15:48,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-01 18:15:48,106 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-12-01 18:15:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2206 states and 2765 transitions. [2018-12-01 18:15:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2765 transitions. [2018-12-01 18:15:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-01 18:15:58,147 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:15:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:15:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:15:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:15:58,305 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 186 iterations. [2018-12-01 18:15:58,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 06:15:58 ImpRootNode [2018-12-01 18:15:58,397 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-01 18:15:58,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 18:15:58,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 18:15:58,397 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 18:15:58,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:10:16" (3/4) ... [2018-12-01 18:15:58,399 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 18:15:58,492 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7fa404e3-f567-475d-bf90-91486e0b0201/bin-2019/ukojak/witness.graphml [2018-12-01 18:15:58,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 18:15:58,493 INFO L168 Benchmark]: Toolchain (without parser) took 343868.60 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 948.4 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 769.1 MB. Max. memory is 11.5 GB. [2018-12-01 18:15:58,493 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:15:58,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2018-12-01 18:15:58,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.44 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: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-01 18:15:58,494 INFO L168 Benchmark]: Boogie Preprocessor took 28.87 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-01 18:15:58,494 INFO L168 Benchmark]: RCFGBuilder took 1054.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 903.7 MB in the end (delta: 212.7 MB). Peak memory consumption was 212.7 MB. Max. memory is 11.5 GB. [2018-12-01 18:15:58,494 INFO L168 Benchmark]: CodeCheck took 342327.88 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 812.1 MB). Free memory was 903.7 MB in the beginning and 1.1 GB in the end (delta: -242.4 MB). Peak memory consumption was 569.7 MB. Max. memory is 11.5 GB. [2018-12-01 18:15:58,494 INFO L168 Benchmark]: Witness Printer took 95.52 ms. Allocated memory is still 2.0 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-12-01 18:15:58,495 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, 198 locations, 1 error locations. UNSAFE Result, 342.2s OverallTime, 186 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51478528 SDtfs, -333118622 SDslu, 258539520 SDs, 0 SdLazy, -1997738654 SolverSat, -1471837500 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 729.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170728 GetRequests, 166572 SyntacticMatches, 2184 SemanticMatches, 1972 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609254 ImplicationChecksByTransitivity, 320.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 24770 NumberOfCodeBlocks, 24770 NumberOfCodeBlocksAsserted, 186 NumberOfCheckSat, 24391 ConstructedInterpolants, 0 QuantifiedInterpolants, 12893574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 185 InterpolantComputations, 174 PerfectInterpolantSequences, 16098/16244 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: 416]: 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)) [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] 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] 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)) [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] 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] 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)) [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] 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] 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)) [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 TRUE (((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)) [L55] a7 = 0 [L56] a20 = 1 [L57] a21 = 1 [L58] a16 = 4 [L59] a17 = 1 [L60] a8 = 13 [L61] return -1; VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] 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)) [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=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L415] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L416] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.44 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: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.87 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1054.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 903.7 MB in the end (delta: 212.7 MB). Peak memory consumption was 212.7 MB. Max. memory is 11.5 GB. * CodeCheck took 342327.88 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 812.1 MB). Free memory was 903.7 MB in the beginning and 1.1 GB in the end (delta: -242.4 MB). Peak memory consumption was 569.7 MB. Max. memory is 11.5 GB. * Witness Printer took 95.52 ms. Allocated memory is still 2.0 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...