./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/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 9567a448a4d48f04800e09cdf8d7a9b08db67030 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:08:54,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:08:54,870 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:08:54,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:08:54,879 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:08:54,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:08:54,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:08:54,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:08:54,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:08:54,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:08:54,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:08:54,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:08:54,884 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:08:54,885 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:08:54,886 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:08:54,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:08:54,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:08:54,888 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:08:54,890 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:08:54,891 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:08:54,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:08:54,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:08:54,894 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:08:54,894 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:08:54,894 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:08:54,895 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:08:54,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:08:54,896 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:08:54,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:08:54,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:08:54,897 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:08:54,898 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:08:54,898 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:08:54,898 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:08:54,899 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:08:54,899 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:08:54,900 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 10:08:54,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:08:54,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:08:54,911 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:08:54,911 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:08:54,911 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:08:54,912 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:08:54,912 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:08:54,912 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:08:54,912 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:08:54,912 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:08:54,912 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:08:54,912 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:08:54,913 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:08:54,913 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:08:54,913 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:08:54,913 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:08:54,913 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:08:54,913 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 10:08:54,913 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 10:08:54,914 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:08:54,914 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:08:54,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 10:08:54,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:08:54,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:08:54,914 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:08:54,914 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 10:08:54,914 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:08:54,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:08:54,915 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_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/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 -> 9567a448a4d48f04800e09cdf8d7a9b08db67030 [2018-11-10 10:08:54,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:08:54,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:08:54,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:08:54,952 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:08:54,952 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:08:54,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2018-11-10 10:08:54,998 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/bin-2019/ukojak/data/707867c9e/7c3babcc1f294070a41c20ad3ee79f02/FLAG5c9fc229b [2018-11-10 10:08:55,454 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:08:55,455 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2018-11-10 10:08:55,464 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/bin-2019/ukojak/data/707867c9e/7c3babcc1f294070a41c20ad3ee79f02/FLAG5c9fc229b [2018-11-10 10:08:55,473 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/bin-2019/ukojak/data/707867c9e/7c3babcc1f294070a41c20ad3ee79f02 [2018-11-10 10:08:55,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:08:55,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:08:55,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:08:55,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:08:55,480 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:08:55,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:08:55" (1/1) ... [2018-11-10 10:08:55,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db7756d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:55, skipping insertion in model container [2018-11-10 10:08:55,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:08:55" (1/1) ... [2018-11-10 10:08:55,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:08:55,528 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:08:55,773 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:08:55,778 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:08:55,873 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:08:55,883 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:08:55,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:55 WrapperNode [2018-11-10 10:08:55,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:08:55,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:08:55,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:08:55,885 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:08:55,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:55" (1/1) ... [2018-11-10 10:08:55,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:55" (1/1) ... [2018-11-10 10:08:55,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:08:55,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:08:55,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:08:55,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:08:55,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:55" (1/1) ... [2018-11-10 10:08:55,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:55" (1/1) ... [2018-11-10 10:08:55,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:55" (1/1) ... [2018-11-10 10:08:55,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:55" (1/1) ... [2018-11-10 10:08:55,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:55" (1/1) ... [2018-11-10 10:08:55,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:55" (1/1) ... [2018-11-10 10:08:55,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:55" (1/1) ... [2018-11-10 10:08:56,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:08:56,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:08:56,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:08:56,002 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:08:56,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 10:08:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:08:56,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:08:57,475 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:08:57,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:08:57 BoogieIcfgContainer [2018-11-10 10:08:57,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:08:57,476 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 10:08:57,476 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 10:08:57,485 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 10:08:57,485 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:08:57" (1/1) ... [2018-11-10 10:08:57,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:08:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:57,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 226 states and 395 transitions. [2018-11-10 10:08:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 395 transitions. [2018-11-10 10:08:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 10:08:57,534 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 232 states and 405 transitions. [2018-11-10 10:08:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 405 transitions. [2018-11-10 10:08:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 10:08:58,167 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 278 states and 496 transitions. [2018-11-10 10:08:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 496 transitions. [2018-11-10 10:08:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 10:08:58,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 276 states and 492 transitions. [2018-11-10 10:08:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 492 transitions. [2018-11-10 10:08:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 10:08:58,539 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 322 states and 584 transitions. [2018-11-10 10:08:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 584 transitions. [2018-11-10 10:08:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 10:08:58,838 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 321 states and 580 transitions. [2018-11-10 10:08:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 580 transitions. [2018-11-10 10:08:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 10:08:58,914 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 368 states and 674 transitions. [2018-11-10 10:08:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 674 transitions. [2018-11-10 10:08:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 10:08:59,136 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 366 states and 668 transitions. [2018-11-10 10:08:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 668 transitions. [2018-11-10 10:08:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 10:08:59,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 412 states and 758 transitions. [2018-11-10 10:08:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 758 transitions. [2018-11-10 10:08:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 10:08:59,627 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 402 states and 739 transitions. [2018-11-10 10:08:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 739 transitions. [2018-11-10 10:08:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:08:59,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 405 states and 744 transitions. [2018-11-10 10:08:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 744 transitions. [2018-11-10 10:08:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:08:59,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 406 states and 744 transitions. [2018-11-10 10:08:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 744 transitions. [2018-11-10 10:08:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:08:59,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:08:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 409 states and 749 transitions. [2018-11-10 10:08:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 749 transitions. [2018-11-10 10:08:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:08:59,811 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:08:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 456 states and 841 transitions. [2018-11-10 10:09:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 841 transitions. [2018-11-10 10:09:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:00,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 457 states and 841 transitions. [2018-11-10 10:09:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 841 transitions. [2018-11-10 10:09:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:00,678 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 458 states and 842 transitions. [2018-11-10 10:09:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 842 transitions. [2018-11-10 10:09:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:00,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 458 states and 841 transitions. [2018-11-10 10:09:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 841 transitions. [2018-11-10 10:09:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:02,101 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:02,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 461 states and 846 transitions. [2018-11-10 10:09:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 846 transitions. [2018-11-10 10:09:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:02,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 469 states and 862 transitions. [2018-11-10 10:09:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 862 transitions. [2018-11-10 10:09:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:02,463 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 470 states and 862 transitions. [2018-11-10 10:09:02,527 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 862 transitions. [2018-11-10 10:09:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:02,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 518 states and 956 transitions. [2018-11-10 10:09:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 956 transitions. [2018-11-10 10:09:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:03,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 521 states and 961 transitions. [2018-11-10 10:09:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 961 transitions. [2018-11-10 10:09:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:03,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 568 states and 1053 transitions. [2018-11-10 10:09:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1053 transitions. [2018-11-10 10:09:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:04,798 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 569 states and 1053 transitions. [2018-11-10 10:09:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 1053 transitions. [2018-11-10 10:09:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:04,844 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 570 states and 1054 transitions. [2018-11-10 10:09:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1054 transitions. [2018-11-10 10:09:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:05,209 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 570 states and 1053 transitions. [2018-11-10 10:09:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1053 transitions. [2018-11-10 10:09:07,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:07,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 574 states and 1060 transitions. [2018-11-10 10:09:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1060 transitions. [2018-11-10 10:09:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:07,728 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 577 states and 1065 transitions. [2018-11-10 10:09:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1065 transitions. [2018-11-10 10:09:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:07,788 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 581 states and 1071 transitions. [2018-11-10 10:09:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1071 transitions. [2018-11-10 10:09:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:08,001 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 582 states and 1071 transitions. [2018-11-10 10:09:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1071 transitions. [2018-11-10 10:09:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:08,059 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 626 states and 1156 transitions. [2018-11-10 10:09:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1156 transitions. [2018-11-10 10:09:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:08,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 629 states and 1161 transitions. [2018-11-10 10:09:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1161 transitions. [2018-11-10 10:09:08,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:08,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 629 states and 1160 transitions. [2018-11-10 10:09:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1160 transitions. [2018-11-10 10:09:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:09,021 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 630 states and 1166 transitions. [2018-11-10 10:09:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1166 transitions. [2018-11-10 10:09:09,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:09,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 631 states and 1166 transitions. [2018-11-10 10:09:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1166 transitions. [2018-11-10 10:09:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:09,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 679 states and 1262 transitions. [2018-11-10 10:09:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1262 transitions. [2018-11-10 10:09:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:11,141 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 685 states and 1274 transitions. [2018-11-10 10:09:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1274 transitions. [2018-11-10 10:09:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:16,416 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 686 states and 1274 transitions. [2018-11-10 10:09:16,675 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1274 transitions. [2018-11-10 10:09:16,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:16,675 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 689 states and 1279 transitions. [2018-11-10 10:09:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1279 transitions. [2018-11-10 10:09:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:17,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 691 states and 1282 transitions. [2018-11-10 10:09:17,136 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1282 transitions. [2018-11-10 10:09:17,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:17,136 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 688 states and 1276 transitions. [2018-11-10 10:09:17,181 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1276 transitions. [2018-11-10 10:09:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:17,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 735 states and 1369 transitions. [2018-11-10 10:09:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1369 transitions. [2018-11-10 10:09:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:18,903 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 736 states and 1370 transitions. [2018-11-10 10:09:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1370 transitions. [2018-11-10 10:09:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:18,952 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 746 states and 1385 transitions. [2018-11-10 10:09:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1385 transitions. [2018-11-10 10:09:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:20,455 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 711 states and 1317 transitions. [2018-11-10 10:09:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1317 transitions. [2018-11-10 10:09:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:09:20,490 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 711 states and 1316 transitions. [2018-11-10 10:09:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1316 transitions. [2018-11-10 10:09:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 10:09:21,397 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 706 states and 1307 transitions. [2018-11-10 10:09:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1307 transitions. [2018-11-10 10:09:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 10:09:22,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:25,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 706 states and 1306 transitions. [2018-11-10 10:09:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1306 transitions. [2018-11-10 10:09:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 10:09:25,455 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 706 states and 1305 transitions. [2018-11-10 10:09:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1305 transitions. [2018-11-10 10:09:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 10:09:28,225 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 706 states and 1304 transitions. [2018-11-10 10:09:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1304 transitions. [2018-11-10 10:09:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:30,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 749 states and 1387 transitions. [2018-11-10 10:09:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1387 transitions. [2018-11-10 10:09:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:32,399 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 771 states and 1427 transitions. [2018-11-10 10:09:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1427 transitions. [2018-11-10 10:09:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:32,863 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 772 states and 1427 transitions. [2018-11-10 10:09:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1427 transitions. [2018-11-10 10:09:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:32,905 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 814 states and 1509 transitions. [2018-11-10 10:09:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1509 transitions. [2018-11-10 10:09:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:34,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 833 states and 1547 transitions. [2018-11-10 10:09:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1547 transitions. [2018-11-10 10:09:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:34,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 855 states and 1587 transitions. [2018-11-10 10:09:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1587 transitions. [2018-11-10 10:09:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:35,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 856 states and 1590 transitions. [2018-11-10 10:09:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1590 transitions. [2018-11-10 10:09:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:35,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 856 states and 1588 transitions. [2018-11-10 10:09:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1588 transitions. [2018-11-10 10:09:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:36,009 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 857 states and 1589 transitions. [2018-11-10 10:09:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1589 transitions. [2018-11-10 10:09:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:36,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 895 states and 1665 transitions. [2018-11-10 10:09:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1665 transitions. [2018-11-10 10:09:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:38,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 910 states and 1695 transitions. [2018-11-10 10:09:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1695 transitions. [2018-11-10 10:09:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:38,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 932 states and 1735 transitions. [2018-11-10 10:09:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1735 transitions. [2018-11-10 10:09:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:39,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:39,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 932 states and 1734 transitions. [2018-11-10 10:09:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1734 transitions. [2018-11-10 10:09:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:39,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 934 states and 1737 transitions. [2018-11-10 10:09:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1737 transitions. [2018-11-10 10:09:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:40,323 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 923 states and 1717 transitions. [2018-11-10 10:09:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1717 transitions. [2018-11-10 10:09:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:40,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 970 states and 1808 transitions. [2018-11-10 10:09:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1808 transitions. [2018-11-10 10:09:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:42,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 972 states and 1810 transitions. [2018-11-10 10:09:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1810 transitions. [2018-11-10 10:09:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:42,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1018 states and 1897 transitions. [2018-11-10 10:09:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1897 transitions. [2018-11-10 10:09:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:43,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1019 states and 1898 transitions. [2018-11-10 10:09:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1898 transitions. [2018-11-10 10:09:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:44,259 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1069 states and 1996 transitions. [2018-11-10 10:09:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1996 transitions. [2018-11-10 10:09:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:47,661 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 1112 states and 2077 transitions. [2018-11-10 10:09:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 2077 transitions. [2018-11-10 10:09:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:50,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1115 states and 2082 transitions. [2018-11-10 10:09:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 2082 transitions. [2018-11-10 10:09:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:51,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 1111 states and 2072 transitions. [2018-11-10 10:09:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 2072 transitions. [2018-11-10 10:09:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:51,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 1112 states and 2072 transitions. [2018-11-10 10:09:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 2072 transitions. [2018-11-10 10:09:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:51,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1115 states and 2076 transitions. [2018-11-10 10:09:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 2076 transitions. [2018-11-10 10:09:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:51,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 1117 states and 2077 transitions. [2018-11-10 10:09:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 2077 transitions. [2018-11-10 10:09:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:51,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 1105 states and 2055 transitions. [2018-11-10 10:09:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 2055 transitions. [2018-11-10 10:09:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:51,204 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 1136 states and 2114 transitions. [2018-11-10 10:09:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 2114 transitions. [2018-11-10 10:09:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:53,924 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 1139 states and 2120 transitions. [2018-11-10 10:09:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2120 transitions. [2018-11-10 10:09:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:54,297 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 1177 states and 2192 transitions. [2018-11-10 10:09:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 2192 transitions. [2018-11-10 10:09:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:56,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 1179 states and 2193 transitions. [2018-11-10 10:09:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 2193 transitions. [2018-11-10 10:09:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:09:57,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:09:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 1177 states and 2188 transitions. [2018-11-10 10:09:57,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 2188 transitions. [2018-11-10 10:09:57,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 10:09:57,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:09:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:57,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 1154 states and 2147 transitions. [2018-11-10 10:10:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2147 transitions. [2018-11-10 10:10:00,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:00,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 1157 states and 2152 transitions. [2018-11-10 10:10:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2152 transitions. [2018-11-10 10:10:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:00,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 1158 states and 2152 transitions. [2018-11-10 10:10:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 2152 transitions. [2018-11-10 10:10:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:00,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 1161 states and 2157 transitions. [2018-11-10 10:10:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2157 transitions. [2018-11-10 10:10:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:00,402 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 1211 states and 2260 transitions. [2018-11-10 10:10:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 2260 transitions. [2018-11-10 10:10:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:06,425 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 1212 states and 2260 transitions. [2018-11-10 10:10:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 2260 transitions. [2018-11-10 10:10:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:06,486 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1219 states and 2271 transitions. [2018-11-10 10:10:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2271 transitions. [2018-11-10 10:10:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:07,809 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 1222 states and 2276 transitions. [2018-11-10 10:10:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2276 transitions. [2018-11-10 10:10:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:08,104 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 1223 states and 2276 transitions. [2018-11-10 10:10:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 2276 transitions. [2018-11-10 10:10:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:08,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1225 states and 2279 transitions. [2018-11-10 10:10:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2279 transitions. [2018-11-10 10:10:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:08,749 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 1229 states and 2288 transitions. [2018-11-10 10:10:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 2288 transitions. [2018-11-10 10:10:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:10,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 1232 states and 2293 transitions. [2018-11-10 10:10:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2293 transitions. [2018-11-10 10:10:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:10,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 1276 states and 2382 transitions. [2018-11-10 10:10:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 2382 transitions. [2018-11-10 10:10:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:14,536 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 1277 states and 2382 transitions. [2018-11-10 10:10:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 2382 transitions. [2018-11-10 10:10:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:14,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 1285 states and 2396 transitions. [2018-11-10 10:10:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 2396 transitions. [2018-11-10 10:10:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:18,147 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 1291 states and 2412 transitions. [2018-11-10 10:10:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2412 transitions. [2018-11-10 10:10:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:19,415 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 1292 states and 2417 transitions. [2018-11-10 10:10:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2417 transitions. [2018-11-10 10:10:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:20,097 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 1293 states and 2417 transitions. [2018-11-10 10:10:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 2417 transitions. [2018-11-10 10:10:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:20,767 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 1295 states and 2420 transitions. [2018-11-10 10:10:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 2420 transitions. [2018-11-10 10:10:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:21,357 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 1291 states and 2411 transitions. [2018-11-10 10:10:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2411 transitions. [2018-11-10 10:10:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:21,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 1292 states and 2412 transitions. [2018-11-10 10:10:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2412 transitions. [2018-11-10 10:10:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:21,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 1293 states and 2413 transitions. [2018-11-10 10:10:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 2413 transitions. [2018-11-10 10:10:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:21,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 1294 states and 2413 transitions. [2018-11-10 10:10:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2413 transitions. [2018-11-10 10:10:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:21,560 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 1219 states and 2269 transitions. [2018-11-10 10:10:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2269 transitions. [2018-11-10 10:10:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:21,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 1219 states and 2268 transitions. [2018-11-10 10:10:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2268 transitions. [2018-11-10 10:10:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:24,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 1210 states and 2251 transitions. [2018-11-10 10:10:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 2251 transitions. [2018-11-10 10:10:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:25,580 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 1213 states and 2258 transitions. [2018-11-10 10:10:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 2258 transitions. [2018-11-10 10:10:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:25,617 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 1214 states and 2258 transitions. [2018-11-10 10:10:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2258 transitions. [2018-11-10 10:10:25,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:25,653 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:25,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 1216 states and 2259 transitions. [2018-11-10 10:10:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 2259 transitions. [2018-11-10 10:10:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:25,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 1219 states and 2266 transitions. [2018-11-10 10:10:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2266 transitions. [2018-11-10 10:10:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:26,035 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 1220 states and 2267 transitions. [2018-11-10 10:10:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 2267 transitions. [2018-11-10 10:10:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:26,072 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 1221 states and 2267 transitions. [2018-11-10 10:10:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 2267 transitions. [2018-11-10 10:10:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:26,162 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 1222 states and 2267 transitions. [2018-11-10 10:10:26,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2267 transitions. [2018-11-10 10:10:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:26,199 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1228 states and 2279 transitions. [2018-11-10 10:10:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 2279 transitions. [2018-11-10 10:10:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:42,805 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 1233 states and 2286 transitions. [2018-11-10 10:10:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2286 transitions. [2018-11-10 10:10:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:43,664 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:10:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:10:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 1237 states and 2295 transitions. [2018-11-10 10:10:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2295 transitions. [2018-11-10 10:10:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:10:46,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:10:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 1237 states and 2294 transitions. [2018-11-10 10:11:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2294 transitions. [2018-11-10 10:11:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:05,110 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 1238 states and 2295 transitions. [2018-11-10 10:11:06,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 2295 transitions. [2018-11-10 10:11:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:06,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 1234 states and 2286 transitions. [2018-11-10 10:11:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 2286 transitions. [2018-11-10 10:11:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:06,603 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 1237 states and 2292 transitions. [2018-11-10 10:11:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2292 transitions. [2018-11-10 10:11:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:07,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 1239 states and 2295 transitions. [2018-11-10 10:11:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2295 transitions. [2018-11-10 10:11:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:12,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 1240 states and 2296 transitions. [2018-11-10 10:11:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 2296 transitions. [2018-11-10 10:11:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:12,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 1242 states and 2299 transitions. [2018-11-10 10:11:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2299 transitions. [2018-11-10 10:11:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:12,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 1238 states and 2290 transitions. [2018-11-10 10:11:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 2290 transitions. [2018-11-10 10:11:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:12,700 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 1247 states and 2311 transitions. [2018-11-10 10:11:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2311 transitions. [2018-11-10 10:11:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:18,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 1248 states and 2312 transitions. [2018-11-10 10:11:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 2312 transitions. [2018-11-10 10:11:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:18,200 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:18,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 1179 states and 2176 transitions. [2018-11-10 10:11:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 2176 transitions. [2018-11-10 10:11:18,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:18,250 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 1224 states and 2266 transitions. [2018-11-10 10:11:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 2266 transitions. [2018-11-10 10:11:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:22,034 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 1225 states and 2268 transitions. [2018-11-10 10:11:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2268 transitions. [2018-11-10 10:11:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:26,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 1267 states and 2356 transitions. [2018-11-10 10:11:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 2356 transitions. [2018-11-10 10:11:36,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:36,207 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:37,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 1270 states and 2358 transitions. [2018-11-10 10:11:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2358 transitions. [2018-11-10 10:11:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:37,742 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 1269 states and 2355 transitions. [2018-11-10 10:11:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2355 transitions. [2018-11-10 10:11:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:38,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 1270 states and 2356 transitions. [2018-11-10 10:11:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2356 transitions. [2018-11-10 10:11:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:40,429 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 1272 states and 2357 transitions. [2018-11-10 10:11:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2357 transitions. [2018-11-10 10:11:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:41,483 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 1273 states and 2359 transitions. [2018-11-10 10:11:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 2359 transitions. [2018-11-10 10:11:42,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:42,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 1271 states and 2354 transitions. [2018-11-10 10:11:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2354 transitions. [2018-11-10 10:11:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:43,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 1271 states and 2353 transitions. [2018-11-10 10:11:44,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2353 transitions. [2018-11-10 10:11:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:44,505 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 1275 states and 2359 transitions. [2018-11-10 10:11:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2359 transitions. [2018-11-10 10:11:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:46,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 1276 states and 2359 transitions. [2018-11-10 10:11:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 2359 transitions. [2018-11-10 10:11:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:46,444 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 1276 states and 2358 transitions. [2018-11-10 10:11:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 2358 transitions. [2018-11-10 10:11:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:51,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 1281 states and 2365 transitions. [2018-11-10 10:11:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 2365 transitions. [2018-11-10 10:11:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:53,940 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 1277 states and 2358 transitions. [2018-11-10 10:11:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 2358 transitions. [2018-11-10 10:11:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:53,969 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:11:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 1278 states and 2359 transitions. [2018-11-10 10:11:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 2359 transitions. [2018-11-10 10:11:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:11:54,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:11:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:12:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 1294 states and 2392 transitions. [2018-11-10 10:12:28,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2392 transitions. [2018-11-10 10:12:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:12:28,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:12:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:12:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 1141 states and 2098 transitions. [2018-11-10 10:12:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 2098 transitions. [2018-11-10 10:12:54,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:12:54,235 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:12:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 1141 states and 2097 transitions. [2018-11-10 10:13:00,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 2097 transitions. [2018-11-10 10:13:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:13:00,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 1144 states and 2101 transitions. [2018-11-10 10:13:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2101 transitions. [2018-11-10 10:13:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:13:08,964 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 1145 states and 2102 transitions. [2018-11-10 10:13:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2102 transitions. [2018-11-10 10:13:10,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:13:10,192 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 1145 states and 2101 transitions. [2018-11-10 10:13:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2101 transitions. [2018-11-10 10:13:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:13:15,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 1145 states and 2100 transitions. [2018-11-10 10:13:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2100 transitions. [2018-11-10 10:13:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:13:16,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1140 states and 2090 transitions. [2018-11-10 10:13:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 2090 transitions. [2018-11-10 10:13:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:13:28,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 1142 states and 2092 transitions. [2018-11-10 10:13:45,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 2092 transitions. [2018-11-10 10:13:45,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:13:45,035 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:52,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 1144 states and 2094 transitions. [2018-11-10 10:13:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2094 transitions. [2018-11-10 10:13:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:13:52,547 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:53,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 1135 states and 2078 transitions. [2018-11-10 10:13:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2078 transitions. [2018-11-10 10:13:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:13:53,965 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 1129 states and 2068 transitions. [2018-11-10 10:14:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 2068 transitions. [2018-11-10 10:14:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:01,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 1171 states and 2152 transitions. [2018-11-10 10:14:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 2152 transitions. [2018-11-10 10:14:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:06,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 1172 states and 2152 transitions. [2018-11-10 10:14:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 2152 transitions. [2018-11-10 10:14:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:08,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 1213 states and 2233 transitions. [2018-11-10 10:14:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 2233 transitions. [2018-11-10 10:14:13,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:13,567 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 1234 states and 2273 transitions. [2018-11-10 10:14:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 2273 transitions. [2018-11-10 10:14:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:15,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 1236 states and 2276 transitions. [2018-11-10 10:14:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 2276 transitions. [2018-11-10 10:14:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:16,995 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 1261 states and 2325 transitions. [2018-11-10 10:14:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 2325 transitions. [2018-11-10 10:14:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:21,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 1278 states and 2359 transitions. [2018-11-10 10:14:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 2359 transitions. [2018-11-10 10:14:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:25,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 1299 states and 2399 transitions. [2018-11-10 10:14:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 2399 transitions. [2018-11-10 10:14:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:27,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 1321 states and 2439 transitions. [2018-11-10 10:14:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2439 transitions. [2018-11-10 10:14:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:29,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 1319 states and 2433 transitions. [2018-11-10 10:14:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 2433 transitions. [2018-11-10 10:14:29,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:29,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 1363 states and 2520 transitions. [2018-11-10 10:14:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2520 transitions. [2018-11-10 10:14:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:38,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2604 states to 1406 states and 2604 transitions. [2018-11-10 10:14:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2604 transitions. [2018-11-10 10:14:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:44,908 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 1427 states and 2642 transitions. [2018-11-10 10:14:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2642 transitions. [2018-11-10 10:14:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:47,895 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 1417 states and 2622 transitions. [2018-11-10 10:14:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2622 transitions. [2018-11-10 10:14:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:50,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 1459 states and 2701 transitions. [2018-11-10 10:14:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2701 transitions. [2018-11-10 10:14:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:56,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 1484 states and 2748 transitions. [2018-11-10 10:14:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 2748 transitions. [2018-11-10 10:14:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:14:57,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 1484 states and 2748 transitions. [2018-11-10 10:15:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 2748 transitions. [2018-11-10 10:15:00,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:00,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 1506 states and 2790 transitions. [2018-11-10 10:15:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2790 transitions. [2018-11-10 10:15:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:03,764 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 1544 states and 2861 transitions. [2018-11-10 10:15:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2861 transitions. [2018-11-10 10:15:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:07,319 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 1565 states and 2900 transitions. [2018-11-10 10:15:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2900 transitions. [2018-11-10 10:15:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:10,705 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 1607 states and 2977 transitions. [2018-11-10 10:15:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2977 transitions. [2018-11-10 10:15:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:14,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 1603 states and 2968 transitions. [2018-11-10 10:15:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2968 transitions. [2018-11-10 10:15:14,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:14,655 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 1602 states and 2964 transitions. [2018-11-10 10:15:15,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2964 transitions. [2018-11-10 10:15:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:15,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 1605 states and 2969 transitions. [2018-11-10 10:15:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2969 transitions. [2018-11-10 10:15:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:15,982 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 1650 states and 3058 transitions. [2018-11-10 10:15:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 3058 transitions. [2018-11-10 10:15:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:21,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 1693 states and 3137 transitions. [2018-11-10 10:15:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 3137 transitions. [2018-11-10 10:15:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:28,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 1694 states and 3140 transitions. [2018-11-10 10:15:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 3140 transitions. [2018-11-10 10:15:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:29,988 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 1695 states and 3140 transitions. [2018-11-10 10:15:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 3140 transitions. [2018-11-10 10:15:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:30,814 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 1698 states and 3145 transitions. [2018-11-10 10:15:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 3145 transitions. [2018-11-10 10:15:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:30,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 1734 states and 3212 transitions. [2018-11-10 10:15:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 3212 transitions. [2018-11-10 10:15:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:40,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:49,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 1779 states and 3293 transitions. [2018-11-10 10:15:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 3293 transitions. [2018-11-10 10:15:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:49,238 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 1780 states and 3293 transitions. [2018-11-10 10:15:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 3293 transitions. [2018-11-10 10:15:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:49,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:15:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 1779 states and 3288 transitions. [2018-11-10 10:15:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 3288 transitions. [2018-11-10 10:15:49,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:15:49,331 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:16:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:16:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 1830 states and 3386 transitions. [2018-11-10 10:16:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 3386 transitions. [2018-11-10 10:16:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:16:04,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:16:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:16:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:16:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:16:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 1833 states and 3388 transitions. [2018-11-10 10:16:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 3388 transitions. [2018-11-10 10:16:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:16:08,196 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:16:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:16:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:16:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:16:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 1859 states and 3435 transitions. [2018-11-10 10:16:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3435 transitions. [2018-11-10 10:16:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:16:16,082 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:16:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:16:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:16:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:16:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 1860 states and 3435 transitions. [2018-11-10 10:16:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 3435 transitions. [2018-11-10 10:16:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:16:16,126 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:16:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:16:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:16:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:16:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 1860 states and 3434 transitions. [2018-11-10 10:16:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 3434 transitions. [2018-11-10 10:16:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:16:19,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:16:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:16:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:16:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:16:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 1899 states and 3509 transitions. [2018-11-10 10:16:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 3509 transitions. [2018-11-10 10:16:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:16:26,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:16:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:16:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:16:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:16:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 1947 states and 3607 transitions. [2018-11-10 10:16:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 3607 transitions. [2018-11-10 10:16:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:16:38,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:16:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:16:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:16:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:16:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 1966 states and 3644 transitions. [2018-11-10 10:16:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 3644 transitions. [2018-11-10 10:16:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:16:41,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:16:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:16:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:16:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:16:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 1986 states and 3680 transitions. [2018-11-10 10:16:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 3680 transitions. [2018-11-10 10:16:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:16:50,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:16:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:16:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:16:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:16:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 2003 states and 3712 transitions. [2018-11-10 10:16:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 3712 transitions. [2018-11-10 10:16:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:16:53,692 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:16:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:16:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:16:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:16:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 2020 states and 3746 transitions. [2018-11-10 10:16:56,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 3746 transitions. [2018-11-10 10:16:56,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:16:56,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:16:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:16:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:16:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:16:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3750 states to 2024 states and 3750 transitions. [2018-11-10 10:16:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 3750 transitions. [2018-11-10 10:16:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:16:58,685 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:16:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:16:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 2069 states and 3836 transitions. [2018-11-10 10:17:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3836 transitions. [2018-11-10 10:17:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:17:10,782 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 2091 states and 3880 transitions. [2018-11-10 10:17:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3880 transitions. [2018-11-10 10:17:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:17:15,115 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 2110 states and 3916 transitions. [2018-11-10 10:17:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 3916 transitions. [2018-11-10 10:17:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:17:18,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:18,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-11-10 10:17:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 2112 states and 3917 transitions. [2018-11-10 10:17:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 3917 transitions. [2018-11-10 10:17:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:17:19,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 2114 states and 3918 transitions. [2018-11-10 10:17:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3918 transitions. [2018-11-10 10:17:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:17:21,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 2129 states and 3944 transitions. [2018-11-10 10:17:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 3944 transitions. [2018-11-10 10:17:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:17:21,897 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3934 states to 2124 states and 3934 transitions. [2018-11-10 10:17:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 3934 transitions. [2018-11-10 10:17:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:17:21,946 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4024 states to 2171 states and 4024 transitions. [2018-11-10 10:17:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 4024 transitions. [2018-11-10 10:17:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:17:33,486 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4025 states to 2173 states and 4025 transitions. [2018-11-10 10:17:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 4025 transitions. [2018-11-10 10:17:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:17:35,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 2201 states and 4076 transitions. [2018-11-10 10:17:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 4076 transitions. [2018-11-10 10:17:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:17:43,225 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 2222 states and 4114 transitions. [2018-11-10 10:17:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 4114 transitions. [2018-11-10 10:17:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:17:47,026 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 2119 states and 3909 transitions. [2018-11-10 10:17:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3909 transitions. [2018-11-10 10:17:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:17:47,074 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 2154 states and 3973 transitions. [2018-11-10 10:17:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3973 transitions. [2018-11-10 10:17:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:17:48,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:17:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:17:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 2154 states and 3972 transitions. [2018-11-10 10:17:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3972 transitions. [2018-11-10 10:17:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:17:54,547 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:17:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:17:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:18:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:18:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 2155 states and 3973 transitions. [2018-11-10 10:18:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3973 transitions. [2018-11-10 10:18:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:18:02,896 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:18:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:18:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:18:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:18:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 2155 states and 3972 transitions. [2018-11-10 10:18:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3972 transitions. [2018-11-10 10:18:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:18:06,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:18:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:18:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:18:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:18:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3934 states to 2133 states and 3934 transitions. [2018-11-10 10:18:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3934 transitions. [2018-11-10 10:18:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:18:10,999 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:18:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:18:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:18:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:18:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 2133 states and 3933 transitions. [2018-11-10 10:18:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3933 transitions. [2018-11-10 10:18:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:18:12,444 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:18:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:18:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:18:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:18:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 2140 states and 3943 transitions. [2018-11-10 10:18:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3943 transitions. [2018-11-10 10:18:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:18:19,751 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:18:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:18:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:18:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:18:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 2147 states and 3953 transitions. [2018-11-10 10:18:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3953 transitions. [2018-11-10 10:18:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:18:26,845 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:18:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:18:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:18:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:18:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 2150 states and 3958 transitions. [2018-11-10 10:18:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3958 transitions. [2018-11-10 10:18:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:18:37,342 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:18:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:18:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:18:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:18:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 2151 states and 3958 transitions. [2018-11-10 10:18:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3958 transitions. [2018-11-10 10:18:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:18:39,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:18:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:18:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:18:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:18:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 2154 states and 3963 transitions. [2018-11-10 10:18:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3963 transitions. [2018-11-10 10:18:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:18:40,812 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:18:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:18:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:18:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:18:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 2156 states and 3966 transitions. [2018-11-10 10:18:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3966 transitions. [2018-11-10 10:18:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 10:18:54,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:18:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:18:54,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:19:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 2081 states and 3818 transitions. [2018-11-10 10:19:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3818 transitions. [2018-11-10 10:19:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:19:06,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:19:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:19:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 2084 states and 3823 transitions. [2018-11-10 10:19:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3823 transitions. [2018-11-10 10:19:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:19:06,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:19:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:19:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 2085 states and 3823 transitions. [2018-11-10 10:19:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3823 transitions. [2018-11-10 10:19:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:19:06,685 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:19:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:19:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 2088 states and 3828 transitions. [2018-11-10 10:19:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3828 transitions. [2018-11-10 10:19:06,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:19:06,737 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:19:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:19:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 2111 states and 3871 transitions. [2018-11-10 10:19:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3871 transitions. [2018-11-10 10:19:12,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:19:12,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:19:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:19:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 2112 states and 3871 transitions. [2018-11-10 10:19:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 3871 transitions. [2018-11-10 10:19:12,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:19:12,289 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:19:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:19:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:19:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 2132 states and 3913 transitions. [2018-11-10 10:19:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 3913 transitions. [2018-11-10 10:19:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:19:25,721 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:19:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:19:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:20:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:20:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 2138 states and 3923 transitions. [2018-11-10 10:20:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3923 transitions. [2018-11-10 10:20:17,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:20:17,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:20:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:20:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:20:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:20:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3932 states to 2142 states and 3932 transitions. [2018-11-10 10:20:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3932 transitions. [2018-11-10 10:20:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:20:21,214 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:20:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:20:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:20:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:20:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 2151 states and 3949 transitions. [2018-11-10 10:20:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3949 transitions. [2018-11-10 10:20:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:20:35,371 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:20:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:20:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:20:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:20:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 2154 states and 3953 transitions. [2018-11-10 10:20:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3953 transitions. [2018-11-10 10:20:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:20:36,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:20:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:20:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:20:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:20:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:20:36,653 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 237 iterations. [2018-11-10 10:20:36,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 10:20:36 ImpRootNode [2018-11-10 10:20:36,806 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 10:20:36,806 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:20:36,806 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:20:36,806 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:20:36,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:08:57" (3/4) ... [2018-11-10 10:20:36,810 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 10:20:36,974 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c3cb3103-2cf3-4052-83e6-f2a1298fabcd/bin-2019/ukojak/witness.graphml [2018-11-10 10:20:36,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:20:36,975 INFO L168 Benchmark]: Toolchain (without parser) took 701498.97 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -107.9 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-11-10 10:20:36,976 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:20:36,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.87 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 928.1 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:20:36,977 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 928.1 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:20:36,977 INFO L168 Benchmark]: Boogie Preprocessor took 30.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:20:36,977 INFO L168 Benchmark]: RCFGBuilder took 1473.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 870.8 MB in the end (delta: 253.5 MB). Peak memory consumption was 253.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:20:36,977 INFO L168 Benchmark]: CodeCheck took 699329.49 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 870.8 MB in the beginning and 1.1 GB in the end (delta: -258.2 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2018-11-10 10:20:36,978 INFO L168 Benchmark]: Witness Printer took 168.84 ms. Allocated memory is still 4.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 63.5 MB). Peak memory consumption was 63.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:20:36,979 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, 305 locations, 1 error locations. UNSAFE Result, 699.1s OverallTime, 237 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1094526240 SDtfs, 659061328 SDslu, 118905028 SDs, 0 SdLazy, -293341764 SolverSat, -1215643368 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 463.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232358 GetRequests, 229049 SyntacticMatches, 911 SemanticMatches, 2398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3124333 ImplicationChecksByTransitivity, 681.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 29506 NumberOfCodeBlocks, 29506 NumberOfCodeBlocksAsserted, 237 NumberOfCheckSat, 29139 ConstructedInterpolants, 0 QuantifiedInterpolants, 13437423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 236 InterpolantComputations, 236 PerfectInterpolantSequences, 0/0 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: 822]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 0; [L33] char p32_old = '\x0'; [L34] char p32_new = '\x0'; [L35] _Bool ep32 = 0; [L36] char id1 = '\x0'; [L37] char r1 = '\x0'; [L38] char st1 = '\x0'; [L39] char nl1 = '\x0'; [L40] char m1 = '\x0'; [L41] char max1 = '\x0'; [L42] _Bool mode1 = 0; [L43] char id2 = '\x0'; [L44] char r2 = '\x0'; [L45] char st2 = '\x0'; [L46] char nl2 = '\x0'; [L47] char m2 = '\x0'; [L48] char max2 = '\x0'; [L49] _Bool mode2 = 0; [L50] char id3 = '\x0'; [L51] char r3 = '\x0'; [L52] char st3 = '\x0'; [L53] char nl3 = '\x0'; [L54] char m3 = '\x0'; [L55] char max3 = '\x0'; [L56] _Bool mode3 = 0; [L64] int __return_1732; [L65] int __return_1860; [L66] int __return_1978; [L67] int __return_2099; [L68] int __return_2228; [L69] int __tmp_2229_0; [L70] int __return_2337; [L71] int __return_2242; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L16] port_t p13 = 0; [L20] port_t p21 = 0; [L24] port_t p23 = 0; [L28] port_t p31 = 0; [L32] port_t p32 = 0; [L60] void (*nodes[3])() = { &node1, &node2, &node3 }; [L74] int main__c1; [L75] int main__i2; [L76] main__c1 = 0 [L77] ep12 = __VERIFIER_nondet_bool() [L78] ep13 = __VERIFIER_nondet_bool() [L79] ep21 = __VERIFIER_nondet_bool() [L80] ep23 = __VERIFIER_nondet_bool() [L81] ep31 = __VERIFIER_nondet_bool() [L82] ep32 = __VERIFIER_nondet_bool() [L83] id1 = __VERIFIER_nondet_char() [L84] r1 = __VERIFIER_nondet_char() [L85] st1 = __VERIFIER_nondet_char() [L86] nl1 = __VERIFIER_nondet_char() [L87] m1 = __VERIFIER_nondet_char() [L88] max1 = __VERIFIER_nondet_char() [L89] mode1 = __VERIFIER_nondet_bool() [L90] id2 = __VERIFIER_nondet_char() [L91] r2 = __VERIFIER_nondet_char() [L92] st2 = __VERIFIER_nondet_char() [L93] nl2 = __VERIFIER_nondet_char() [L94] m2 = __VERIFIER_nondet_char() [L95] max2 = __VERIFIER_nondet_char() [L96] mode2 = __VERIFIER_nondet_bool() [L97] id3 = __VERIFIER_nondet_char() [L98] r3 = __VERIFIER_nondet_char() [L99] st3 = __VERIFIER_nondet_char() [L100] nl3 = __VERIFIER_nondet_char() [L101] m3 = __VERIFIER_nondet_char() [L102] max3 = __VERIFIER_nondet_char() [L103] mode3 = __VERIFIER_nondet_bool() [L105] _Bool init__r121; [L106] _Bool init__r131; [L107] _Bool init__r211; [L108] _Bool init__r231; [L109] _Bool init__r311; [L110] _Bool init__r321; [L111] _Bool init__r122; [L112] int init__tmp; [L113] _Bool init__r132; [L114] int init__tmp___0; [L115] _Bool init__r212; [L116] int init__tmp___1; [L117] _Bool init__r232; [L118] int init__tmp___2; [L119] _Bool init__r312; [L120] int init__tmp___3; [L121] _Bool init__r322; [L122] int init__tmp___4; [L123] int init__tmp___5; [L124] init__r121 = ep12 [L125] init__r131 = ep13 [L126] init__r211 = ep21 [L127] init__r231 = ep23 [L128] init__r311 = ep31 [L129] init__r321 = ep32 [L130] COND TRUE !(init__r121 == 0) [L132] init__tmp = 1 [L134] init__r122 = (_Bool)init__tmp [L135] COND FALSE !(!(init__r131 == 0)) [L2239] COND TRUE !(init__r121 == 0) [L2241] COND TRUE !(ep23 == 0) [L2243] init__tmp___0 = 1 [L139] init__r132 = (_Bool)init__tmp___0 [L140] COND FALSE !(!(init__r211 == 0)) [L2216] COND TRUE !(init__r231 == 0) [L2218] COND TRUE !(ep31 == 0) [L2220] init__tmp___1 = 1 [L144] init__r212 = (_Bool)init__tmp___1 [L145] COND TRUE !(init__r231 == 0) [L147] init__tmp___2 = 1 [L149] init__r232 = (_Bool)init__tmp___2 [L150] COND TRUE !(init__r311 == 0) [L152] init__tmp___3 = 1 [L154] init__r312 = (_Bool)init__tmp___3 [L155] COND FALSE !(!(init__r321 == 0)) [L2147] COND TRUE !(init__r311 == 0) [L2149] COND TRUE !(ep12 == 0) [L2151] init__tmp___4 = 1 [L159] init__r322 = (_Bool)init__tmp___4 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L160] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L164] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L166] COND TRUE ((int)id1) >= 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id2) >= 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L170] COND TRUE ((int)id3) >= 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)r1) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)r2) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L176] COND TRUE ((int)r3) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE !(init__r122 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE !(init__r132 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE !(init__r212 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r232 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r312 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE !(init__r322 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)st1) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)st2) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)st3) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE ((int)nl1) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)nl2) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)nl3) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)mode1) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)mode2) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)mode3) == 0 [L214] init__tmp___5 = 1 [L215] __return_1732 = init__tmp___5 [L216] main__i2 = __return_1732 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE main__i2 != 0 [L219] p12_old = nomsg [L220] p12_new = nomsg [L221] p13_old = nomsg [L222] p13_new = nomsg [L223] p21_old = nomsg [L224] p21_new = nomsg [L225] p23_old = nomsg [L226] p23_new = nomsg [L227] p31_old = nomsg [L228] p31_new = nomsg [L229] p32_old = nomsg [L230] p32_new = nomsg [L231] main__i2 = 0 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L232] COND TRUE main__i2 < 6 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L235] COND FALSE !(!(mode1 == 0)) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L241] COND TRUE ((int)r1) < 2 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L243] COND TRUE !(ep12 == 0) [L245] int node1____CPAchecker_TMP_0; VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L246] COND TRUE max1 != nomsg VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L248] COND TRUE p12_new == nomsg [L250] node1____CPAchecker_TMP_0 = max1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L254] COND FALSE !(!(ep13 == 0)) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L265] mode1 = 1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND FALSE !(!(mode2 == 0)) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L273] COND TRUE ((int)r2) < 2 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L275] COND FALSE !(!(ep21 == 0)) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L286] COND TRUE !(ep23 == 0) [L288] int node2____CPAchecker_TMP_1; VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L289] COND TRUE max2 != nomsg VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L291] COND TRUE p23_new == nomsg [L293] node2____CPAchecker_TMP_1 = max2 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L295] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L297] mode2 = 1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L299] COND FALSE !(!(mode3 == 0)) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L305] COND TRUE ((int)r3) < 2 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L307] COND TRUE !(ep31 == 0) [L309] int node3____CPAchecker_TMP_0; VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L310] COND TRUE max3 != nomsg VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L312] COND TRUE p31_new == nomsg [L314] node3____CPAchecker_TMP_0 = max3 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L316] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=106, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L318] COND FALSE !(!(ep32 == 0)) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=77, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=106, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L329] mode3 = 1 [L330] p12_old = p12_new [L331] p12_new = nomsg [L332] p13_old = p13_new [L333] p13_new = nomsg [L334] p21_old = p21_new [L335] p21_new = nomsg [L336] p23_old = p23_new [L337] p23_new = nomsg [L338] p31_old = p31_new [L339] p31_new = nomsg [L340] p32_old = p32_new [L341] p32_new = nomsg [L343] int check__tmp; VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L344] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L346] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L348] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L350] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L352] COND FALSE !(((int)r1) >= 2) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND TRUE ((int)r1) < 2 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L362] COND FALSE !(((int)r1) >= 2) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L368] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L370] COND TRUE ((int)r1) < 2 [L372] check__tmp = 1 [L373] __return_1860 = check__tmp [L374] main__c1 = __return_1860 [L376] _Bool __tmp_1; [L377] __tmp_1 = main__c1 [L378] _Bool assert__arg; [L379] assert__arg = __tmp_1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L380] COND FALSE !(assert__arg == 0) [L386] int main____CPAchecker_TMP_0 = main__i2; [L387] main__i2 = main__i2 + 1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE main__i2 < 6 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=0, m2=-128, m3=-128, max1=77, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L391] COND TRUE !(mode1 == 0) [L393] r1 = (char)(((int)r1) + 1) [L394] COND FALSE !(!(ep21 == 0)) [L402] COND TRUE !(ep31 == 0) [L404] m1 = p31_old [L405] p31_old = nomsg [L406] COND TRUE ((int)m1) > ((int)max1) [L408] max1 = m1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=-128, m3=-128, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND FALSE !(((int)r1) == 2) [L416] mode1 = 0 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=-128, m3=-128, max1=106, max2=105, max3=106, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=77, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L418] COND TRUE !(mode2 == 0) [L420] r2 = (char)(((int)r2) + 1) [L421] COND TRUE !(ep12 == 0) [L423] m2 = p12_old [L424] p12_old = nomsg [L425] COND FALSE !(((int)m2) > ((int)max2)) [L429] COND FALSE !(!(ep32 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=-128, max1=106, max2=105, max3=106, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !(((int)r2) == 2) [L443] mode2 = 0 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=-128, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE !(mode3 == 0) [L447] r3 = (char)(((int)r3) + 1) [L448] COND FALSE !(!(ep13 == 0)) [L456] COND TRUE !(ep23 == 0) [L458] m3 = p23_old [L459] p23_old = nomsg [L460] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND FALSE !(((int)r3) == 2) [L470] mode3 = 0 [L471] p12_old = p12_new [L472] p12_new = nomsg [L473] p13_old = p13_new [L474] p13_new = nomsg [L475] p21_old = p21_new [L476] p21_new = nomsg [L477] p23_old = p23_new [L478] p23_new = nomsg [L479] p31_old = p31_new [L480] p31_new = nomsg [L481] p32_old = p32_new [L482] p32_new = nomsg [L484] int check__tmp; VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L485] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L487] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L491] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !(((int)r1) >= 2) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L499] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int)r1) < 2 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND FALSE !(((int)r1) >= 2) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L509] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE ((int)r1) < 2 [L513] check__tmp = 1 [L514] __return_1978 = check__tmp [L515] main__c1 = __return_1978 [L517] _Bool __tmp_2; [L518] __tmp_2 = main__c1 [L519] _Bool assert__arg; [L520] assert__arg = __tmp_2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND FALSE !(assert__arg == 0) [L527] int main____CPAchecker_TMP_0 = main__i2; [L528] main__i2 = main__i2 + 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L529] COND TRUE main__i2 < 6 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !(!(mode1 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L538] COND TRUE ((int)r1) < 2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L540] COND TRUE !(ep12 == 0) [L542] int node1____CPAchecker_TMP_0; VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L543] COND TRUE max1 != nomsg VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L545] COND TRUE p12_new == nomsg [L547] node1____CPAchecker_TMP_0 = max1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L549] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L551] COND FALSE !(!(ep13 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L562] mode1 = 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L564] COND FALSE !(!(mode2 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L570] COND TRUE ((int)r2) < 2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L572] COND FALSE !(!(ep21 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L583] COND TRUE !(ep23 == 0) [L585] int node2____CPAchecker_TMP_1; VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] COND TRUE max2 != nomsg VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L588] COND TRUE p23_new == nomsg [L590] node2____CPAchecker_TMP_1 = max2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L592] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L594] mode2 = 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L596] COND FALSE !(!(mode3 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L602] COND TRUE ((int)r3) < 2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L604] COND TRUE !(ep31 == 0) [L606] int node3____CPAchecker_TMP_0; VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L607] COND TRUE max3 != nomsg VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L609] COND TRUE p31_new == nomsg [L611] node3____CPAchecker_TMP_0 = max3 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L613] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=106, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L615] COND FALSE !(!(ep32 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=106, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=105, p23_old=-1, p31=0, p31_new=106, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L626] mode3 = 1 [L627] p12_old = p12_new [L628] p12_new = nomsg [L629] p13_old = p13_new [L630] p13_new = nomsg [L631] p21_old = p21_new [L632] p21_new = nomsg [L633] p23_old = p23_new [L634] p23_new = nomsg [L635] p31_old = p31_new [L636] p31_new = nomsg [L637] p32_old = p32_new [L638] p32_new = nomsg [L640] int check__tmp; VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L641] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L643] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L645] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L647] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L649] COND FALSE !(((int)r1) >= 2) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L655] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L657] COND TRUE ((int)r1) < 2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L659] COND FALSE !(((int)r1) >= 2) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L665] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L667] COND TRUE ((int)r1) < 2 [L669] check__tmp = 1 [L670] __return_2099 = check__tmp [L671] main__c1 = __return_2099 [L673] _Bool __tmp_3; [L674] __tmp_3 = main__c1 [L675] _Bool assert__arg; [L676] assert__arg = __tmp_3 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L677] COND FALSE !(assert__arg == 0) [L683] int main____CPAchecker_TMP_0 = main__i2; [L684] main__i2 = main__i2 + 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L685] COND TRUE main__i2 < 6 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=106, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L688] COND TRUE !(mode1 == 0) [L690] r1 = (char)(((int)r1) + 1) [L691] COND FALSE !(!(ep21 == 0)) [L699] COND TRUE !(ep31 == 0) [L701] m1 = p31_old [L702] p31_old = nomsg [L703] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L707] COND TRUE ((int)r1) == 2 [L709] COND FALSE !(((int)max1) == ((int)id1)) [L1488] st1 = 1 [L713] mode1 = 0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=77, m3=105, max1=106, max2=105, max3=106, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=106, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=1, st2=0, st3=0] [L715] COND TRUE !(mode2 == 0) [L717] r2 = (char)(((int)r2) + 1) [L718] COND TRUE !(ep12 == 0) [L720] m2 = p12_old [L721] p12_old = nomsg [L722] COND TRUE ((int)m2) > ((int)max2) [L724] max2 = m2 [L726] COND FALSE !(!(ep32 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=106, m3=105, max1=106, max2=106, max3=106, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L734] COND TRUE ((int)r2) == 2 [L736] COND FALSE !(((int)max2) == ((int)id2)) [L1451] nl2 = 1 [L740] mode2 = 0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=106, m3=105, max1=106, max2=106, max3=106, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=105, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L742] COND TRUE !(mode3 == 0) [L744] r3 = (char)(((int)r3) + 1) [L745] COND FALSE !(!(ep13 == 0)) [L753] COND TRUE !(ep23 == 0) [L755] m3 = p23_old [L756] p23_old = nomsg [L757] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=106, m3=105, max1=106, max2=106, max3=106, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=0] [L761] COND TRUE ((int)r3) == 2 [L763] COND TRUE ((int)max3) == ((int)id3) [L765] st3 = 1 [L767] mode3 = 0 [L768] p12_old = p12_new [L769] p12_new = nomsg [L770] p13_old = p13_new [L771] p13_new = nomsg [L772] p21_old = p21_new [L773] p21_new = nomsg [L774] p23_old = p23_new [L775] p23_new = nomsg [L776] p31_old = p31_new [L777] p31_new = nomsg [L778] p32_old = p32_new [L779] p32_new = nomsg [L781] int check__tmp; VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=106, m3=105, max1=106, max2=106, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L782] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1407] check__tmp = 0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=106, m3=105, max1=106, max2=106, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L810] __return_2228 = check__tmp [L811] main__c1 = __return_2228 [L812] __tmp_2229_0 = main____CPAchecker_TMP_0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=106, m3=105, max1=106, max2=106, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L814] main____CPAchecker_TMP_0 = __tmp_2229_0 [L816] _Bool __tmp_4; [L817] __tmp_4 = main__c1 [L818] _Bool assert__arg; [L819] assert__arg = __tmp_4 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=106, m3=105, max1=106, max2=106, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L820] COND TRUE assert__arg == 0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=106, m3=105, max1=106, max2=106, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L822] __VERIFIER_error() VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_main=0, __tmp_2229_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=77, id2=105, id3=106, m1=106, m2=106, m3=105, max1=106, max2=106, max3=106, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.87 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 928.1 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 928.1 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1473.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 870.8 MB in the end (delta: 253.5 MB). Peak memory consumption was 253.5 MB. Max. memory is 11.5 GB. * CodeCheck took 699329.49 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 870.8 MB in the beginning and 1.1 GB in the end (delta: -258.2 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 168.84 ms. Allocated memory is still 4.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 63.5 MB). Peak memory consumption was 63.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...