./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.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_cb07fee4-542f-41d2-96ba-11c751450f79/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/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 c8989412e094655bcf4508d76eb9764ed06d0b34 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-09 16:42:57,888 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:42:57,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:42:57,895 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:42:57,895 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:42:57,896 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:42:57,896 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:42:57,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:42:57,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:42:57,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:42:57,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:42:57,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:42:57,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:42:57,900 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:42:57,901 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:42:57,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:42:57,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:42:57,903 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:42:57,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:42:57,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:42:57,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:42:57,906 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:42:57,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:42:57,907 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:42:57,907 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:42:57,908 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:42:57,908 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:42:57,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:42:57,909 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:42:57,910 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:42:57,910 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:42:57,910 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:42:57,910 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:42:57,910 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:42:57,911 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:42:57,912 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:42:57,912 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 16:42:57,919 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:42:57,919 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:42:57,920 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:42:57,920 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 16:42:57,920 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 16:42:57,920 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 16:42:57,920 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:42:57,921 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:42:57,921 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:42:57,921 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:42:57,921 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:42:57,921 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 16:42:57,921 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:42:57,921 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 16:42:57,921 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:42:57,921 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 16:42:57,921 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 16:42:57,921 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 16:42:57,921 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 16:42:57,922 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 16:42:57,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:42:57,922 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:42:57,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 16:42:57,922 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:42:57,922 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:42:57,922 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 16:42:57,922 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 16:42:57,922 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:42:57,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:42:57,922 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_cb07fee4-542f-41d2-96ba-11c751450f79/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 -> c8989412e094655bcf4508d76eb9764ed06d0b34 [2018-12-09 16:42:57,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:42:57,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:42:57,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:42:57,951 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:42:57,952 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:42:57,952 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/bin-2019/ukojak/../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c [2018-12-09 16:42:57,994 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/bin-2019/ukojak/data/f2ae6a79f/0cb641bb0a2b48798d48560d0a727a80/FLAG18aef39f0 [2018-12-09 16:42:58,467 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:42:58,468 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c [2018-12-09 16:42:58,473 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/bin-2019/ukojak/data/f2ae6a79f/0cb641bb0a2b48798d48560d0a727a80/FLAG18aef39f0 [2018-12-09 16:42:58,973 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/bin-2019/ukojak/data/f2ae6a79f/0cb641bb0a2b48798d48560d0a727a80 [2018-12-09 16:42:58,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:42:58,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:42:58,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:42:58,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:42:58,978 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:42:58,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:42:58" (1/1) ... [2018-12-09 16:42:58,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4969d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:42:58, skipping insertion in model container [2018-12-09 16:42:58,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:42:58" (1/1) ... [2018-12-09 16:42:58,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:42:59,004 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:42:59,118 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:42:59,121 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:42:59,148 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:42:59,157 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:42:59,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:42:59 WrapperNode [2018-12-09 16:42:59,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:42:59,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:42:59,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:42:59,158 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:42:59,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:42:59" (1/1) ... [2018-12-09 16:42:59,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:42:59" (1/1) ... [2018-12-09 16:42:59,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:42:59,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:42:59,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:42:59,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:42:59,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:42:59" (1/1) ... [2018-12-09 16:42:59,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:42:59" (1/1) ... [2018-12-09 16:42:59,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:42:59" (1/1) ... [2018-12-09 16:42:59,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:42:59" (1/1) ... [2018-12-09 16:42:59,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:42:59" (1/1) ... [2018-12-09 16:42:59,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:42:59" (1/1) ... [2018-12-09 16:42:59,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:42:59" (1/1) ... [2018-12-09 16:42:59,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:42:59,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:42:59,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:42:59,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:42:59,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:42:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/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-09 16:42:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:42:59,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:42:59,950 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:42:59,950 INFO L280 CfgBuilder]: Removed 26 assue(true) statements. [2018-12-09 16:42:59,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:42:59 BoogieIcfgContainer [2018-12-09 16:42:59,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:42:59,951 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 16:42:59,951 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 16:42:59,957 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 16:42:59,958 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:42:59" (1/1) ... [2018-12-09 16:42:59,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:42:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:42:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 41 states and 66 transitions. [2018-12-09 16:42:59,992 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2018-12-09 16:42:59,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 16:42:59,994 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,108 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-09 16:43:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 46 states and 80 transitions. [2018-12-09 16:43:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 80 transitions. [2018-12-09 16:43:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 16:43:00,147 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,184 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-09 16:43:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 47 states and 83 transitions. [2018-12-09 16:43:00,232 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 83 transitions. [2018-12-09 16:43:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 16:43:00,234 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,253 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-09 16:43:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 47 states and 82 transitions. [2018-12-09 16:43:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2018-12-09 16:43:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 16:43:00,257 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,272 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-09 16:43:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-12-09 16:43:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-12-09 16:43:00,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 16:43:00,275 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,292 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-09 16:43:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2018-12-09 16:43:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2018-12-09 16:43:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 16:43:00,297 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,318 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-09 16:43:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 48 states and 80 transitions. [2018-12-09 16:43:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2018-12-09 16:43:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 16:43:00,364 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:43:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 50 states and 82 transitions. [2018-12-09 16:43:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 82 transitions. [2018-12-09 16:43:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 16:43:00,399 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,416 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-09 16:43:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 54 states and 90 transitions. [2018-12-09 16:43:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 90 transitions. [2018-12-09 16:43:00,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 16:43:00,427 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,503 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-09 16:43:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 61 states and 104 transitions. [2018-12-09 16:43:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 104 transitions. [2018-12-09 16:43:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 16:43:00,675 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,687 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-09 16:43:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 64 states and 110 transitions. [2018-12-09 16:43:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 110 transitions. [2018-12-09 16:43:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 16:43:00,721 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,736 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-09 16:43:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 68 states and 121 transitions. [2018-12-09 16:43:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 121 transitions. [2018-12-09 16:43:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 16:43:00,850 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,872 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-09 16:43:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 69 states and 123 transitions. [2018-12-09 16:43:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 123 transitions. [2018-12-09 16:43:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 16:43:00,901 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,913 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-09 16:43:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 70 states and 124 transitions. [2018-12-09 16:43:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 124 transitions. [2018-12-09 16:43:00,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 16:43:00,919 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,931 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-09 16:43:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 72 states and 126 transitions. [2018-12-09 16:43:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 126 transitions. [2018-12-09 16:43:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 16:43:00,940 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,955 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-09 16:43:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 73 states and 127 transitions. [2018-12-09 16:43:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2018-12-09 16:43:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 16:43:00,965 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:43:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 82 states and 139 transitions. [2018-12-09 16:43:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 139 transitions. [2018-12-09 16:43:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 16:43:00,994 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:43:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 83 states and 139 transitions. [2018-12-09 16:43:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 139 transitions. [2018-12-09 16:43:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 16:43:01,023 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,035 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-09 16:43:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 84 states and 142 transitions. [2018-12-09 16:43:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 142 transitions. [2018-12-09 16:43:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 16:43:01,045 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,058 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-09 16:43:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 84 states and 141 transitions. [2018-12-09 16:43:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 141 transitions. [2018-12-09 16:43:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:43:01,062 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,075 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-09 16:43:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 84 states and 140 transitions. [2018-12-09 16:43:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 140 transitions. [2018-12-09 16:43:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 16:43:01,079 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,090 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-09 16:43:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 84 states and 139 transitions. [2018-12-09 16:43:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 139 transitions. [2018-12-09 16:43:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 16:43:01,095 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:43:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 86 states and 142 transitions. [2018-12-09 16:43:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 142 transitions. [2018-12-09 16:43:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 16:43:01,122 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 16:43:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 87 states and 143 transitions. [2018-12-09 16:43:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 143 transitions. [2018-12-09 16:43:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 16:43:01,147 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:43:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 97 states and 162 transitions. [2018-12-09 16:43:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 162 transitions. [2018-12-09 16:43:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 16:43:01,344 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:43:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 106 states and 176 transitions. [2018-12-09 16:43:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 176 transitions. [2018-12-09 16:43:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 16:43:01,440 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:43:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 107 states and 176 transitions. [2018-12-09 16:43:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 176 transitions. [2018-12-09 16:43:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 16:43:01,490 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:43:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 118 states and 195 transitions. [2018-12-09 16:43:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 195 transitions. [2018-12-09 16:43:01,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 16:43:01,783 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 16:43:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 122 states and 200 transitions. [2018-12-09 16:43:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 200 transitions. [2018-12-09 16:43:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 16:43:01,818 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:43:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 125 states and 202 transitions. [2018-12-09 16:43:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 202 transitions. [2018-12-09 16:43:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 16:43:01,837 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 16:43:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 127 states and 204 transitions. [2018-12-09 16:43:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 204 transitions. [2018-12-09 16:43:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 16:43:01,859 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:43:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 131 states and 210 transitions. [2018-12-09 16:43:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 210 transitions. [2018-12-09 16:43:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 16:43:01,938 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:43:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 136 states and 219 transitions. [2018-12-09 16:43:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 219 transitions. [2018-12-09 16:43:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 16:43:02,117 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:43:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 140 states and 226 transitions. [2018-12-09 16:43:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 226 transitions. [2018-12-09 16:43:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 16:43:02,260 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:43:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 144 states and 236 transitions. [2018-12-09 16:43:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 236 transitions. [2018-12-09 16:43:02,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 16:43:02,499 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:43:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 152 states and 251 transitions. [2018-12-09 16:43:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 251 transitions. [2018-12-09 16:43:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 16:43:02,825 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 16:43:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 154 states and 253 transitions. [2018-12-09 16:43:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 253 transitions. [2018-12-09 16:43:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 16:43:02,874 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:43:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 154 states and 251 transitions. [2018-12-09 16:43:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 251 transitions. [2018-12-09 16:43:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 16:43:02,886 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 16:43:02,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 155 states and 251 transitions. [2018-12-09 16:43:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 251 transitions. [2018-12-09 16:43:02,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 16:43:02,902 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 16:43:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 157 states and 253 transitions. [2018-12-09 16:43:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 253 transitions. [2018-12-09 16:43:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 16:43:02,930 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:43:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 162 states and 260 transitions. [2018-12-09 16:43:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 260 transitions. [2018-12-09 16:43:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 16:43:03,155 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:43:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 167 states and 270 transitions. [2018-12-09 16:43:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 270 transitions. [2018-12-09 16:43:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 16:43:03,576 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:43:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 167 states and 268 transitions. [2018-12-09 16:43:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 268 transitions. [2018-12-09 16:43:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 16:43:03,595 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 16:43:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2018-12-09 16:43:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2018-12-09 16:43:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 16:43:03,616 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 16:43:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 169 states and 268 transitions. [2018-12-09 16:43:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 268 transitions. [2018-12-09 16:43:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 16:43:03,660 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 16:43:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 172 states and 275 transitions. [2018-12-09 16:43:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 275 transitions. [2018-12-09 16:43:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 16:43:03,848 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 16:43:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 174 states and 276 transitions. [2018-12-09 16:43:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 276 transitions. [2018-12-09 16:43:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 16:43:03,970 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:43:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 174 states and 274 transitions. [2018-12-09 16:43:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 274 transitions. [2018-12-09 16:43:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 16:43:03,983 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:43:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 176 states and 276 transitions. [2018-12-09 16:43:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 276 transitions. [2018-12-09 16:43:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 16:43:04,074 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:43:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 182 states and 285 transitions. [2018-12-09 16:43:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 285 transitions. [2018-12-09 16:43:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 16:43:04,601 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:43:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 183 states and 285 transitions. [2018-12-09 16:43:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 285 transitions. [2018-12-09 16:43:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 16:43:04,732 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 16:43:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 189 states and 291 transitions. [2018-12-09 16:43:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 291 transitions. [2018-12-09 16:43:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 16:43:05,154 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 16:43:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 190 states and 292 transitions. [2018-12-09 16:43:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 292 transitions. [2018-12-09 16:43:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 16:43:05,285 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:43:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 200 states and 311 transitions. [2018-12-09 16:43:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 311 transitions. [2018-12-09 16:43:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 16:43:05,581 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 16:43:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 202 states and 314 transitions. [2018-12-09 16:43:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 314 transitions. [2018-12-09 16:43:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 16:43:05,713 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 16:43:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 205 states and 317 transitions. [2018-12-09 16:43:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 317 transitions. [2018-12-09 16:43:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 16:43:05,843 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 16:43:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 209 states and 324 transitions. [2018-12-09 16:43:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 324 transitions. [2018-12-09 16:43:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 16:43:05,993 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 16:43:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 211 states and 326 transitions. [2018-12-09 16:43:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 326 transitions. [2018-12-09 16:43:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 16:43:06,022 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 16:43:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 215 states and 330 transitions. [2018-12-09 16:43:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 330 transitions. [2018-12-09 16:43:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 16:43:06,297 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 16:43:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 219 states and 334 transitions. [2018-12-09 16:43:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 334 transitions. [2018-12-09 16:43:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 16:43:06,580 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:43:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 225 states and 344 transitions. [2018-12-09 16:43:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 344 transitions. [2018-12-09 16:43:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 16:43:06,912 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 16:43:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 230 states and 351 transitions. [2018-12-09 16:43:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 351 transitions. [2018-12-09 16:43:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 16:43:07,337 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 16:43:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 234 states and 355 transitions. [2018-12-09 16:43:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 355 transitions. [2018-12-09 16:43:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 16:43:07,644 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:43:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 263 states and 414 transitions. [2018-12-09 16:43:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 414 transitions. [2018-12-09 16:43:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 16:43:10,554 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:10,569 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-09 16:43:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 269 states and 420 transitions. [2018-12-09 16:43:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 420 transitions. [2018-12-09 16:43:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 16:43:11,089 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:43:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 269 states and 417 transitions. [2018-12-09 16:43:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 417 transitions. [2018-12-09 16:43:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 16:43:11,205 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:43:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 273 states and 428 transitions. [2018-12-09 16:43:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 428 transitions. [2018-12-09 16:43:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 16:43:11,574 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:43:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 275 states and 429 transitions. [2018-12-09 16:43:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 429 transitions. [2018-12-09 16:43:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 16:43:11,594 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:43:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 276 states and 430 transitions. [2018-12-09 16:43:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 430 transitions. [2018-12-09 16:43:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 16:43:11,614 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:43:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 280 states and 435 transitions. [2018-12-09 16:43:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 435 transitions. [2018-12-09 16:43:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 16:43:11,638 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:43:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 294 states and 472 transitions. [2018-12-09 16:43:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 472 transitions. [2018-12-09 16:43:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 16:43:16,369 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:43:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 303 states and 502 transitions. [2018-12-09 16:43:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 502 transitions. [2018-12-09 16:43:20,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 16:43:20,413 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 16:43:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 307 states and 512 transitions. [2018-12-09 16:43:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 512 transitions. [2018-12-09 16:43:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 16:43:21,811 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:24,553 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:43:26,620 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-12-09 16:43:28,541 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2018-12-09 16:43:29,807 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-09 16:43:31,809 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-12-09 16:43:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 319 states and 549 transitions. [2018-12-09 16:43:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 549 transitions. [2018-12-09 16:43:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 16:43:32,327 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 16:43:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 321 states and 550 transitions. [2018-12-09 16:43:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 550 transitions. [2018-12-09 16:43:32,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 16:43:32,387 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:43:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 330 states and 573 transitions. [2018-12-09 16:43:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 573 transitions. [2018-12-09 16:43:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 16:43:38,016 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:43:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 357 states and 633 transitions. [2018-12-09 16:43:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 633 transitions. [2018-12-09 16:43:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 16:43:46,401 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 16:43:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:43:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 358 states and 634 transitions. [2018-12-09 16:43:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 634 transitions. [2018-12-09 16:43:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 16:43:46,424 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:43:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:43:47,648 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-12-09 16:43:49,145 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-12-09 16:43:49,528 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-09 16:43:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:43:52,739 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2018-12-09 16:43:56,377 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-12-09 16:43:57,082 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2018-12-09 16:43:58,467 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-12-09 16:43:59,112 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-12-09 16:44:00,441 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2018-12-09 16:44:02,225 WARN L180 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2018-12-09 16:44:03,416 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-09 16:44:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:44:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 372 states and 680 transitions. [2018-12-09 16:44:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 680 transitions. [2018-12-09 16:44:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 16:44:04,447 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:44:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:44:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:44:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:44:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 376 states and 690 transitions. [2018-12-09 16:44:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 690 transitions. [2018-12-09 16:44:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 16:44:05,539 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:44:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:44:06,395 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-12-09 16:44:07,228 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-09 16:44:08,353 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-12-09 16:44:09,424 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2018-12-09 16:44:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:44:10,593 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2018-12-09 16:44:11,692 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2018-12-09 16:44:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:44:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 387 states and 723 transitions. [2018-12-09 16:44:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 723 transitions. [2018-12-09 16:44:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 16:44:16,247 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:44:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:44:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 19 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:44:23,225 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-12-09 16:44:26,364 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-12-09 16:44:27,943 WARN L180 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2018-12-09 16:44:28,978 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-12-09 16:44:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:44:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 403 states and 774 transitions. [2018-12-09 16:44:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 774 transitions. [2018-12-09 16:44:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 16:44:30,269 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:44:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:44:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 19 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:44:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:44:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 404 states and 779 transitions. [2018-12-09 16:44:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 779 transitions. [2018-12-09 16:44:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 16:44:32,254 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:44:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:44:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-09 16:44:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:44:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 406 states and 783 transitions. [2018-12-09 16:44:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 783 transitions. [2018-12-09 16:44:32,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 16:44:32,461 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:44:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:44:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-09 16:44:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:44:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 409 states and 787 transitions. [2018-12-09 16:44:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 787 transitions. [2018-12-09 16:44:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 16:44:33,227 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:44:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:44:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-09 16:44:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:44:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 411 states and 790 transitions. [2018-12-09 16:44:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 790 transitions. [2018-12-09 16:44:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 16:44:33,432 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:44:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:44:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 16:44:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:44:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 402 states and 766 transitions. [2018-12-09 16:44:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 766 transitions. [2018-12-09 16:44:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 16:44:33,820 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:44:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:44:35,590 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2018-12-09 16:44:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 20 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:44:43,419 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-12-09 16:44:45,307 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-12-09 16:44:49,286 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-09 16:44:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:44:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 415 states and 813 transitions. [2018-12-09 16:44:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 813 transitions. [2018-12-09 16:44:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 16:44:51,264 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:44:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:44:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 20 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:44:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:44:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 422 states and 834 transitions. [2018-12-09 16:44:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 834 transitions. [2018-12-09 16:44:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 16:44:53,997 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:44:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:44:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:45:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 433 states and 860 transitions. [2018-12-09 16:45:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 860 transitions. [2018-12-09 16:45:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 16:45:04,794 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:45:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 437 states and 875 transitions. [2018-12-09 16:45:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 875 transitions. [2018-12-09 16:45:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 16:45:06,855 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:45:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 439 states and 882 transitions. [2018-12-09 16:45:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 882 transitions. [2018-12-09 16:45:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 16:45:08,848 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:45:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 440 states and 885 transitions. [2018-12-09 16:45:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 885 transitions. [2018-12-09 16:45:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 16:45:10,486 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 16:45:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 441 states and 895 transitions. [2018-12-09 16:45:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 895 transitions. [2018-12-09 16:45:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 16:45:11,132 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 16:45:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 444 states and 900 transitions. [2018-12-09 16:45:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 900 transitions. [2018-12-09 16:45:11,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 16:45:11,912 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 16:45:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 446 states and 903 transitions. [2018-12-09 16:45:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 903 transitions. [2018-12-09 16:45:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 16:45:12,204 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 16:45:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 446 states and 899 transitions. [2018-12-09 16:45:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 899 transitions. [2018-12-09 16:45:12,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 16:45:12,483 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:14,199 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:45:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 451 states and 906 transitions. [2018-12-09 16:45:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 906 transitions. [2018-12-09 16:45:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 16:45:20,044 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:22,168 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2018-12-09 16:45:23,422 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2018-12-09 16:45:25,113 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2018-12-09 16:45:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:45:33,393 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2018-12-09 16:45:34,005 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-12-09 16:45:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 454 states and 914 transitions. [2018-12-09 16:45:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 914 transitions. [2018-12-09 16:45:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 16:45:38,267 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:45:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 455 states and 920 transitions. [2018-12-09 16:45:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 920 transitions. [2018-12-09 16:45:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 16:45:39,488 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:45:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 456 states and 923 transitions. [2018-12-09 16:45:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 923 transitions. [2018-12-09 16:45:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 16:45:40,755 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 41 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:45:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 458 states and 924 transitions. [2018-12-09 16:45:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 924 transitions. [2018-12-09 16:45:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 16:45:41,337 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 16:45:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 459 states and 924 transitions. [2018-12-09 16:45:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 924 transitions. [2018-12-09 16:45:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 16:45:41,900 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:45:46,774 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 16:45:47,315 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-09 16:45:56,194 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2018-12-09 16:45:56,857 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 16:45:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 469 states and 966 transitions. [2018-12-09 16:45:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 966 transitions. [2018-12-09 16:45:57,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 16:45:57,702 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:45:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:45:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 474 states and 979 transitions. [2018-12-09 16:45:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 979 transitions. [2018-12-09 16:45:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 16:45:59,865 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:45:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:45:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 16:46:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:46:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 474 states and 978 transitions. [2018-12-09 16:46:00,118 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 978 transitions. [2018-12-09 16:46:00,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 16:46:00,119 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:46:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:46:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 25 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:46:11,650 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-09 16:46:12,355 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-12-09 16:46:21,297 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-12-09 16:46:23,791 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2018-12-09 16:46:25,859 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2018-12-09 16:46:27,172 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-09 16:46:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:46:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 499 states and 1055 transitions. [2018-12-09 16:46:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1055 transitions. [2018-12-09 16:46:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 16:46:28,342 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:46:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:46:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 25 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:46:29,669 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2018-12-09 16:46:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:46:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 507 states and 1073 transitions. [2018-12-09 16:46:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1073 transitions. [2018-12-09 16:46:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 16:46:31,712 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:46:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:46:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:46:41,507 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-12-09 16:46:43,691 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-12-09 16:46:47,791 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-12-09 16:46:53,574 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-12-09 16:46:55,444 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 16:46:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:46:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 519 states and 1131 transitions. [2018-12-09 16:46:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1131 transitions. [2018-12-09 16:46:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 16:46:56,749 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:46:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:46:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:46:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:46:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 520 states and 1143 transitions. [2018-12-09 16:46:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1143 transitions. [2018-12-09 16:46:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 16:46:57,998 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:46:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:47:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:47:04,711 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-12-09 16:47:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:47:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 523 states and 1161 transitions. [2018-12-09 16:47:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1161 transitions. [2018-12-09 16:47:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 16:47:07,335 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:47:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:47:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:47:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:47:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 527 states and 1185 transitions. [2018-12-09 16:47:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1185 transitions. [2018-12-09 16:47:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 16:47:11,080 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:47:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:47:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:47:15,620 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 16:47:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:47:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 528 states and 1186 transitions. [2018-12-09 16:47:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1186 transitions. [2018-12-09 16:47:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 16:47:15,746 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:47:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:47:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-09 16:47:18,453 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 16:47:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:47:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 531 states and 1191 transitions. [2018-12-09 16:47:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 1191 transitions. [2018-12-09 16:47:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 16:47:19,006 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:47:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:47:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-09 16:47:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:47:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 534 states and 1196 transitions. [2018-12-09 16:47:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1196 transitions. [2018-12-09 16:47:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 16:47:20,362 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:47:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:47:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 16:47:20,691 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-09 16:47:21,297 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-12-09 16:47:24,107 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 16:47:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:47:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 538 states and 1202 transitions. [2018-12-09 16:47:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1202 transitions. [2018-12-09 16:47:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 16:47:27,506 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:47:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:47:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 16:47:28,175 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2018-12-09 16:47:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:47:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 542 states and 1207 transitions. [2018-12-09 16:47:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1207 transitions. [2018-12-09 16:47:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 16:47:30,448 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:47:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:47:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 16:47:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:47:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 545 states and 1210 transitions. [2018-12-09 16:47:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1210 transitions. [2018-12-09 16:47:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 16:47:31,286 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:47:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:47:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:47:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:47:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 547 states and 1212 transitions. [2018-12-09 16:47:32,732 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1212 transitions. [2018-12-09 16:47:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 16:47:32,733 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:47:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:47:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:47:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:47:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 561 states and 1238 transitions. [2018-12-09 16:47:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1238 transitions. [2018-12-09 16:47:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 16:47:40,279 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:47:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:47:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-09 16:47:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:47:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 561 states and 1233 transitions. [2018-12-09 16:47:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1233 transitions. [2018-12-09 16:47:40,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 16:47:40,621 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:47:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:47:43,608 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2018-12-09 16:47:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 24 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:47:57,824 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-09 16:48:03,965 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-09 16:48:04,537 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2018-12-09 16:48:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:48:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 567 states and 1251 transitions. [2018-12-09 16:48:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1251 transitions. [2018-12-09 16:48:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 16:48:06,649 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:48:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:15,021 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-09 16:48:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 22 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:25,148 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-12-09 16:48:29,044 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-12-09 16:48:29,640 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-12-09 16:48:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:48:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 577 states and 1286 transitions. [2018-12-09 16:48:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1286 transitions. [2018-12-09 16:48:31,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 16:48:31,223 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:48:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 22 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:48:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 578 states and 1292 transitions. [2018-12-09 16:48:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1292 transitions. [2018-12-09 16:48:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 16:48:32,403 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:48:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 16:48:36,798 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-09 16:48:38,872 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2018-12-09 16:48:39,575 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2018-12-09 16:48:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:48:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 579 states and 1299 transitions. [2018-12-09 16:48:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1299 transitions. [2018-12-09 16:48:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 16:48:40,463 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:48:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:48:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:48:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 581 states and 1300 transitions. [2018-12-09 16:48:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1300 transitions. [2018-12-09 16:48:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 16:48:41,480 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:48:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:48:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:48:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 584 states and 1305 transitions. [2018-12-09 16:48:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1305 transitions. [2018-12-09 16:48:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 16:48:45,620 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:48:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 16:48:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:48:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 585 states and 1305 transitions. [2018-12-09 16:48:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1305 transitions. [2018-12-09 16:48:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 16:48:46,033 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:48:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 16:48:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:48:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 590 states and 1313 transitions. [2018-12-09 16:48:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1313 transitions. [2018-12-09 16:48:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 16:48:49,423 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:48:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 32 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:48:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:48:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 595 states and 1317 transitions. [2018-12-09 16:48:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1317 transitions. [2018-12-09 16:48:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 16:48:51,695 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:48:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:49:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:49:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 622 states and 1367 transitions. [2018-12-09 16:49:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1367 transitions. [2018-12-09 16:49:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 16:49:20,207 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:49:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:49:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-09 16:49:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:49:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 632 states and 1389 transitions. [2018-12-09 16:49:26,182 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1389 transitions. [2018-12-09 16:49:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 16:49:26,183 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:49:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:49:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 28 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:49:35,979 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-09 16:49:38,057 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2018-12-09 16:49:38,646 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2018-12-09 16:49:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:49:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 640 states and 1412 transitions. [2018-12-09 16:49:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1412 transitions. [2018-12-09 16:49:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 16:49:45,548 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:49:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:49:49,890 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2018-12-09 16:49:51,330 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2018-12-09 16:49:57,201 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2018-12-09 16:49:59,724 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2018-12-09 16:50:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 33 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:50:05,257 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2018-12-09 16:50:08,180 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2018-12-09 16:50:17,362 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-09 16:50:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:50:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 654 states and 1456 transitions. [2018-12-09 16:50:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1456 transitions. [2018-12-09 16:50:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 16:50:19,328 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:50:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:50:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 33 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:50:24,551 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2018-12-09 16:50:25,973 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-09 16:50:28,039 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-09 16:50:28,547 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2018-12-09 16:50:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:50:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 665 states and 1484 transitions. [2018-12-09 16:50:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1484 transitions. [2018-12-09 16:50:36,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 16:50:36,961 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:50:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:50:39,805 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2018-12-09 16:50:41,481 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2018-12-09 16:50:44,489 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2018-12-09 16:50:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 26 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:50:51,602 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-12-09 16:50:55,359 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2018-12-09 16:51:02,667 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2018-12-09 16:51:05,365 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2018-12-09 16:51:07,426 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 16:51:09,359 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2018-12-09 16:51:09,897 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2018-12-09 16:51:14,702 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2018-12-09 16:51:15,469 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-12-09 16:51:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:51:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 678 states and 1518 transitions. [2018-12-09 16:51:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1518 transitions. [2018-12-09 16:51:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 16:51:19,803 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:51:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:24,584 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-12-09 16:51:26,452 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-12-09 16:51:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 25 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:51:34,404 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-12-09 16:51:39,133 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-12-09 16:51:41,919 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-12-09 16:51:42,562 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-09 16:51:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:51:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 684 states and 1539 transitions. [2018-12-09 16:51:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1539 transitions. [2018-12-09 16:51:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 16:51:53,674 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:51:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-09 16:51:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:51:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 687 states and 1543 transitions. [2018-12-09 16:51:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1543 transitions. [2018-12-09 16:51:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 16:51:55,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:51:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-09 16:51:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:51:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 689 states and 1545 transitions. [2018-12-09 16:51:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1545 transitions. [2018-12-09 16:51:55,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 16:51:55,722 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:51:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 16:51:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:51:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 689 states and 1540 transitions. [2018-12-09 16:51:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1540 transitions. [2018-12-09 16:51:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 16:51:56,430 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:51:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 16:51:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 16:51:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 690 states and 1542 transitions. [2018-12-09 16:51:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1542 transitions. [2018-12-09 16:51:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 16:51:56,508 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 16:51:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:51:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:51:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:51:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:51:56,679 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 141 iterations. [2018-12-09 16:51:56,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 04:51:56 ImpRootNode [2018-12-09 16:51:56,745 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 16:51:56,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:51:56,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:51:56,745 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:51:56,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:42:59" (3/4) ... [2018-12-09 16:51:56,748 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 16:51:56,817 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cb07fee4-542f-41d2-96ba-11c751450f79/bin-2019/ukojak/witness.graphml [2018-12-09 16:51:56,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:51:56,818 INFO L168 Benchmark]: Toolchain (without parser) took 537842.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 961.4 MB in the beginning and 632.6 MB in the end (delta: 328.8 MB). Peak memory consumption was 430.5 MB. Max. memory is 11.5 GB. [2018-12-09 16:51:56,818 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:51:56,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.66 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 945.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-09 16:51:56,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-09 16:51:56,819 INFO L168 Benchmark]: Boogie Preprocessor took 17.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:51:56,819 INFO L168 Benchmark]: RCFGBuilder took 712.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 953.2 MB in the end (delta: 154.4 MB). Peak memory consumption was 154.4 MB. Max. memory is 11.5 GB. [2018-12-09 16:51:56,819 INFO L168 Benchmark]: CodeCheck took 536794.64 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.2 MB). Free memory was 953.2 MB in the beginning and 650.9 MB in the end (delta: 302.3 MB). Peak memory consumption was 288.1 MB. Max. memory is 11.5 GB. [2018-12-09 16:51:56,819 INFO L168 Benchmark]: Witness Printer took 72.23 ms. Allocated memory is still 1.1 GB. Free memory was 650.9 MB in the beginning and 632.6 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-09 16:51:56,820 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, 125 locations, 1 error locations. UNSAFE Result, 536.7s OverallTime, 141 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -1796830722 SDslu, 722399768 SDs, 0 SdLazy, -913319938 SolverSat, 1002380336 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 191.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73497 GetRequests, 70174 SyntacticMatches, 1601 SemanticMatches, 1722 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024853 ImplicationChecksByTransitivity, 525.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 137.9s InterpolantComputationTime, 6969 NumberOfCodeBlocks, 6969 NumberOfCodeBlocksAsserted, 141 NumberOfCheckSat, 6757 ConstructedInterpolants, 0 QuantifiedInterpolants, 3508561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 140 InterpolantComputations, 88 PerfectInterpolantSequences, 3859/6161 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: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L679] int __retres1 ; [L683] e_wl = 2 [L684] e_c = e_wl [L685] e_g = e_c [L686] e_f = e_g [L687] e_e = e_f [L688] wl_pc = 0 [L689] c1_pc = 0 [L690] c2_pc = 0 [L691] wb_pc = 0 [L692] wb_i = 1 [L693] c2_i = wb_i [L694] c1_i = c2_i [L695] wl_i = c1_i [L696] r_i = 0 [L697] c_req_up = 0 [L698] d = 0 [L699] c = 0 [L390] int kernel_st ; [L393] kernel_st = 0 [L394] COND FALSE !((int )c_req_up == 1) [L405] COND TRUE (int )wl_i == 1 [L406] wl_st = 0 [L410] COND TRUE (int )c1_i == 1 [L411] c1_st = 0 [L415] COND TRUE (int )c2_i == 1 [L416] c2_st = 0 [L420] COND TRUE (int )wb_i == 1 [L421] wb_st = 0 [L425] COND FALSE !((int )r_i == 1) [L428] r_st = 2 [L430] COND FALSE !((int )e_f == 0) [L435] COND FALSE !((int )e_g == 0) [L440] COND FALSE !((int )e_e == 0) [L445] COND FALSE !((int )e_c == 0) [L450] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L463] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )c1_pc == 1) [L482] COND FALSE !((int )c2_pc == 1) [L491] COND FALSE !((int )wb_pc == 1) [L500] COND FALSE !((int )e_c == 1) [L505] COND FALSE !((int )e_e == 1) [L510] COND FALSE !((int )e_f == 1) [L515] COND FALSE !((int )e_g == 1) [L520] COND FALSE !((int )e_c == 1) [L525] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L531] COND TRUE 1 [L534] kernel_st = 1 [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L284] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L286] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND TRUE \read(tmp) [L313] wl_st = 1 [L53] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L56] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L70] wl_st = 2 [L71] wl_pc = 1 [L72] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L322] COND TRUE (int )c1_st == 0 [L324] tmp___0 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp___0) [L328] c1_st = 1 [L127] COND TRUE (int )c1_pc == 0 [L138] COND TRUE 1 [L140] c1_st = 2 [L141] c1_pc = 1 [L337] COND TRUE (int )c2_st == 0 [L339] tmp___1 = __VERIFIER_nondet_int() [L341] COND TRUE \read(tmp___1) [L343] c2_st = 1 [L172] COND TRUE (int )c2_pc == 0 [L183] COND TRUE 1 [L185] c2_st = 2 [L186] c2_pc = 1 [L352] COND TRUE (int )wb_st == 0 [L354] tmp___2 = __VERIFIER_nondet_int() [L356] COND TRUE \read(tmp___2) [L358] wb_st = 1 [L217] COND TRUE (int )wb_pc == 0 [L228] COND TRUE 1 [L230] wb_st = 2 [L231] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L367] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L284] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L286] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L289] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L292] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L295] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L298] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L537] kernel_st = 2 [L538] COND FALSE !((int )c_req_up == 1) [L549] kernel_st = 3 [L550] COND FALSE !((int )e_f == 0) [L555] COND FALSE !((int )e_g == 0) [L560] COND FALSE !((int )e_e == 0) [L565] COND FALSE !((int )e_c == 0) [L570] COND TRUE (int )e_wl == 0 [L571] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L575] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L576] COND TRUE (int )e_wl == 1 [L577] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L593] COND TRUE (int )c1_pc == 1 [L594] COND FALSE !((int )e_f == 1) [L602] COND TRUE (int )c2_pc == 1 [L603] COND FALSE !((int )e_f == 1) [L611] COND TRUE (int )wb_pc == 1 [L612] COND FALSE !((int )e_g == 1) [L620] COND FALSE !((int )e_c == 1) [L625] COND FALSE !((int )e_e == 1) [L630] COND FALSE !((int )e_f == 1) [L635] COND FALSE !((int )e_g == 1) [L640] COND FALSE !((int )e_c == 1) [L645] COND TRUE (int )e_wl == 1 [L646] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L650] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L531] COND TRUE 1 [L534] kernel_st = 1 [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L284] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L286] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND TRUE \read(tmp) [L313] wl_st = 1 [L53] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L56] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L59] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L62] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L77] COND TRUE 1 [L79] t = d [L80] data = d [L81] processed = 0 [L82] e_f = 1 [L83] COND TRUE (int )c1_pc == 1 [L84] COND TRUE (int )e_f == 1 [L85] c1_st = 0 [L92] COND TRUE (int )c2_pc == 1 [L93] COND TRUE (int )e_f == 1 [L94] c2_st = 0 [L101] e_f = 2 [L102] wl_st = 2 [L103] wl_pc = 2 [L104] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L322] COND TRUE (int )c1_st == 0 [L324] tmp___0 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp___0) [L328] c1_st = 1 [L127] COND FALSE !((int )c1_pc == 0) [L130] COND TRUE (int )c1_pc == 1 [L145] COND TRUE ! processed [L146] data += 1 [L147] e_g = 1 [L148] COND TRUE (int )wb_pc == 1 [L149] COND TRUE (int )e_g == 1 [L150] wb_st = 0 [L157] e_g = 2 [L138] COND TRUE 1 [L140] c1_st = 2 [L141] c1_pc = 1 [L337] COND TRUE (int )c2_st == 0 [L339] tmp___1 = __VERIFIER_nondet_int() [L341] COND TRUE \read(tmp___1) [L343] c2_st = 1 [L172] COND FALSE !((int )c2_pc == 0) [L175] COND TRUE (int )c2_pc == 1 [L190] COND TRUE ! processed [L191] data += 1 [L192] e_g = 1 [L193] COND TRUE (int )wb_pc == 1 [L194] COND TRUE (int )e_g == 1 [L195] wb_st = 0 [L202] e_g = 2 [L183] COND TRUE 1 [L185] c2_st = 2 [L186] c2_pc = 1 [L352] COND TRUE (int )wb_st == 0 [L354] tmp___2 = __VERIFIER_nondet_int() [L356] COND TRUE \read(tmp___2) [L358] wb_st = 1 [L217] COND FALSE !((int )wb_pc == 0) [L220] COND TRUE (int )wb_pc == 1 [L235] c_t = data [L236] c_req_up = 1 [L237] processed = 1 [L228] COND TRUE 1 [L230] wb_st = 2 [L231] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L367] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L284] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L289] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L292] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L295] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L537] kernel_st = 2 [L538] COND TRUE (int )c_req_up == 1 [L539] COND TRUE c != c_t [L540] c = c_t [L541] e_c = 0 [L545] c_req_up = 0 [L549] kernel_st = 3 [L550] COND FALSE !((int )e_f == 0) [L555] COND FALSE !((int )e_g == 0) [L560] COND FALSE !((int )e_e == 0) [L565] COND TRUE (int )e_c == 0 [L566] e_c = 1 [L570] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L575] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L583] COND TRUE (int )wl_pc == 2 [L584] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L593] COND TRUE (int )c1_pc == 1 [L594] COND FALSE !((int )e_f == 1) [L602] COND TRUE (int )c2_pc == 1 [L603] COND FALSE !((int )e_f == 1) [L611] COND TRUE (int )wb_pc == 1 [L612] COND FALSE !((int )e_g == 1) [L620] COND TRUE (int )e_c == 1 [L621] r_st = 0 [L625] COND FALSE !((int )e_e == 1) [L630] COND FALSE !((int )e_f == 1) [L635] COND FALSE !((int )e_g == 1) [L640] COND TRUE (int )e_c == 1 [L641] e_c = 2 [L645] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L650] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L653] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L656] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L659] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L662] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L531] COND TRUE 1 [L534] kernel_st = 1 [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L284] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L289] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L292] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L295] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L307] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L322] COND FALSE !((int )c1_st == 0) [L337] COND FALSE !((int )c2_st == 0) [L352] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L367] COND TRUE (int )r_st == 0 [L369] tmp___3 = __VERIFIER_nondet_int() [L371] COND TRUE \read(tmp___3) [L373] r_st = 1 [L249] d = c [L250] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L251] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L259] COND TRUE (int )wl_pc == 2 [L260] COND TRUE (int )e_e == 1 [L261] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L269] e_e = 2 [L270] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L284] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L286] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND TRUE \read(tmp) [L313] wl_st = 1 [L53] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L56] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L59] COND TRUE (int )wl_pc == 2 [L108] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L109] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L13] __VERIFIER_error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 181.66 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 945.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 712.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 953.2 MB in the end (delta: 154.4 MB). Peak memory consumption was 154.4 MB. Max. memory is 11.5 GB. * CodeCheck took 536794.64 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.2 MB). Free memory was 953.2 MB in the beginning and 650.9 MB in the end (delta: 302.3 MB). Peak memory consumption was 288.1 MB. Max. memory is 11.5 GB. * Witness Printer took 72.23 ms. Allocated memory is still 1.1 GB. Free memory was 650.9 MB in the beginning and 632.6 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...