./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/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 248783628c8bc0768599d1adf3a6d84dd210baa8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 09:46:02,480 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:46:02,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:46:02,488 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:46:02,488 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:46:02,489 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:46:02,490 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:46:02,491 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:46:02,492 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:46:02,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:46:02,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:46:02,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:46:02,494 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:46:02,494 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:46:02,495 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:46:02,496 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:46:02,496 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:46:02,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:46:02,499 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:46:02,500 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:46:02,500 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:46:02,501 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:46:02,503 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:46:02,503 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:46:02,503 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:46:02,507 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:46:02,508 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:46:02,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:46:02,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:46:02,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:46:02,510 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:46:02,510 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:46:02,511 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:46:02,511 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:46:02,511 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:46:02,512 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:46:02,512 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 09:46:02,522 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:46:02,522 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:46:02,523 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:46:02,523 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 09:46:02,523 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:46:02,523 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:46:02,523 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:46:02,524 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:46:02,524 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:46:02,524 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:46:02,524 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:46:02,524 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:46:02,524 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:46:02,524 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:46:02,524 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:46:02,525 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:46:02,525 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:46:02,525 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:46:02,525 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 09:46:02,525 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 09:46:02,525 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:46:02,525 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:46:02,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 09:46:02,526 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:46:02,526 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:46:02,526 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:46:02,526 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 09:46:02,526 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:46:02,526 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:46:02,526 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_92f0c03d-cbee-47ac-a9a8-724766b46554/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 -> 248783628c8bc0768599d1adf3a6d84dd210baa8 [2018-11-18 09:46:02,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:46:02,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:46:02,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:46:02,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:46:02,558 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:46:02,559 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-11-18 09:46:02,593 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/bin-2019/ukojak/data/43d2c7f7c/fa7077f79f384939bfaac5c6811da555/FLAGa665cd4bb [2018-11-18 09:46:03,019 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:46:03,020 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-11-18 09:46:03,026 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/bin-2019/ukojak/data/43d2c7f7c/fa7077f79f384939bfaac5c6811da555/FLAGa665cd4bb [2018-11-18 09:46:03,038 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/bin-2019/ukojak/data/43d2c7f7c/fa7077f79f384939bfaac5c6811da555 [2018-11-18 09:46:03,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:46:03,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:46:03,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:46:03,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:46:03,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:46:03,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:46:03" (1/1) ... [2018-11-18 09:46:03,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@622ff55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:03, skipping insertion in model container [2018-11-18 09:46:03,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:46:03" (1/1) ... [2018-11-18 09:46:03,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:46:03,090 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:46:03,344 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:46:03,352 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:46:03,501 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:46:03,513 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:46:03,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:03 WrapperNode [2018-11-18 09:46:03,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:46:03,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:46:03,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:46:03,515 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:46:03,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:03" (1/1) ... [2018-11-18 09:46:03,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:03" (1/1) ... [2018-11-18 09:46:03,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:46:03,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:46:03,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:46:03,577 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:46:03,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:03" (1/1) ... [2018-11-18 09:46:03,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:03" (1/1) ... [2018-11-18 09:46:03,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:03" (1/1) ... [2018-11-18 09:46:03,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:03" (1/1) ... [2018-11-18 09:46:03,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:03" (1/1) ... [2018-11-18 09:46:03,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:03" (1/1) ... [2018-11-18 09:46:03,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:03" (1/1) ... [2018-11-18 09:46:03,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:46:03,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:46:03,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:46:03,619 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:46:03,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/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-18 09:46:03,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:46:03,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:46:05,191 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:46:05,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:46:05 BoogieIcfgContainer [2018-11-18 09:46:05,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:46:05,192 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 09:46:05,192 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 09:46:05,198 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 09:46:05,199 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:46:05" (1/1) ... [2018-11-18 09:46:05,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 216 states and 380 transitions. [2018-11-18 09:46:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 380 transitions. [2018-11-18 09:46:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 09:46:05,237 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:05,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-18 09:46:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 226 states and 398 transitions. [2018-11-18 09:46:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 398 transitions. [2018-11-18 09:46:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 09:46:05,994 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:06,185 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-18 09:46:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:06,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 227 states and 399 transitions. [2018-11-18 09:46:06,386 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 399 transitions. [2018-11-18 09:46:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 09:46:06,388 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:06,474 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-18 09:46:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 271 states and 486 transitions. [2018-11-18 09:46:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 486 transitions. [2018-11-18 09:46:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 09:46:06,615 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:06,719 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-18 09:46:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 271 states and 485 transitions. [2018-11-18 09:46:07,239 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 485 transitions. [2018-11-18 09:46:07,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 09:46:07,240 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:07,299 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-18 09:46:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 270 states and 482 transitions. [2018-11-18 09:46:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 482 transitions. [2018-11-18 09:46:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 09:46:07,325 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:07,388 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-18 09:46:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 314 states and 569 transitions. [2018-11-18 09:46:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 569 transitions. [2018-11-18 09:46:07,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 09:46:07,714 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:07,768 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-18 09:46:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 313 states and 566 transitions. [2018-11-18 09:46:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 566 transitions. [2018-11-18 09:46:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 09:46:07,821 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:07,909 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-18 09:46:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:08,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 358 states and 654 transitions. [2018-11-18 09:46:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 654 transitions. [2018-11-18 09:46:08,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 09:46:08,238 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:08,290 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-18 09:46:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 356 states and 648 transitions. [2018-11-18 09:46:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 648 transitions. [2018-11-18 09:46:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 09:46:08,304 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:08,345 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-18 09:46:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 358 states and 653 transitions. [2018-11-18 09:46:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 653 transitions. [2018-11-18 09:46:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 09:46:08,375 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:08,504 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-18 09:46:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 361 states and 658 transitions. [2018-11-18 09:46:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 658 transitions. [2018-11-18 09:46:08,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 09:46:08,611 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:08,682 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-18 09:46:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 357 states and 650 transitions. [2018-11-18 09:46:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 650 transitions. [2018-11-18 09:46:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 09:46:09,227 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:09,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-18 09:46:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 360 states and 655 transitions. [2018-11-18 09:46:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 655 transitions. [2018-11-18 09:46:09,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 09:46:09,864 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:09,943 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-18 09:46:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 360 states and 654 transitions. [2018-11-18 09:46:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 654 transitions. [2018-11-18 09:46:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 09:46:10,501 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:10,732 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-18 09:46:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 412 states and 760 transitions. [2018-11-18 09:46:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 760 transitions. [2018-11-18 09:46:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 09:46:12,201 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:12,270 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-18 09:46:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 411 states and 757 transitions. [2018-11-18 09:46:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 757 transitions. [2018-11-18 09:46:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 09:46:12,364 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:12,614 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-18 09:46:15,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 420 states and 776 transitions. [2018-11-18 09:46:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 776 transitions. [2018-11-18 09:46:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 09:46:15,480 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:15,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-18 09:46:19,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 426 states and 790 transitions. [2018-11-18 09:46:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 790 transitions. [2018-11-18 09:46:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 09:46:19,383 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:19,836 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-18 09:46:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 482 states and 906 transitions. [2018-11-18 09:46:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 906 transitions. [2018-11-18 09:46:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 09:46:22,554 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:22,597 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-18 09:46:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 490 states and 919 transitions. [2018-11-18 09:46:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 919 transitions. [2018-11-18 09:46:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 09:46:23,575 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:23,749 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-18 09:46:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 491 states and 920 transitions. [2018-11-18 09:46:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 920 transitions. [2018-11-18 09:46:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 09:46:24,075 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:24,111 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-18 09:46:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 493 states and 928 transitions. [2018-11-18 09:46:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 928 transitions. [2018-11-18 09:46:24,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 09:46:24,861 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:24,920 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-18 09:46:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 541 states and 1025 transitions. [2018-11-18 09:46:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1025 transitions. [2018-11-18 09:46:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 09:46:27,326 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:27,366 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-18 09:46:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 544 states and 1032 transitions. [2018-11-18 09:46:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1032 transitions. [2018-11-18 09:46:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 09:46:27,808 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:27,917 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-18 09:46:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 547 states and 1037 transitions. [2018-11-18 09:46:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1037 transitions. [2018-11-18 09:46:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 09:46:28,572 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:28,585 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-18 09:46:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 545 states and 1030 transitions. [2018-11-18 09:46:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1030 transitions. [2018-11-18 09:46:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 09:46:29,398 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:29,563 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-18 09:46:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 552 states and 1045 transitions. [2018-11-18 09:46:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1045 transitions. [2018-11-18 09:46:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 09:46:32,034 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:32,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-18 09:46:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 538 states and 1021 transitions. [2018-11-18 09:46:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1021 transitions. [2018-11-18 09:46:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 09:46:32,484 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:32,643 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-18 09:46:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 546 states and 1038 transitions. [2018-11-18 09:46:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1038 transitions. [2018-11-18 09:46:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:35,821 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:36,304 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-18 09:46:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 572 states and 1084 transitions. [2018-11-18 09:46:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1084 transitions. [2018-11-18 09:46:40,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:40,833 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:40,847 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-18 09:46:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 573 states and 1088 transitions. [2018-11-18 09:46:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1088 transitions. [2018-11-18 09:46:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:41,280 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:41,682 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-18 09:46:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 581 states and 1104 transitions. [2018-11-18 09:46:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1104 transitions. [2018-11-18 09:46:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:45,351 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:45,375 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-18 09:46:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 589 states and 1120 transitions. [2018-11-18 09:46:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1120 transitions. [2018-11-18 09:46:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:46,762 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:46,950 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-18 09:46:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 613 states and 1168 transitions. [2018-11-18 09:46:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1168 transitions. [2018-11-18 09:46:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:48,386 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:48,419 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-18 09:46:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 654 states and 1249 transitions. [2018-11-18 09:46:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1249 transitions. [2018-11-18 09:46:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:50,373 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:50,578 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-18 09:46:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 654 states and 1248 transitions. [2018-11-18 09:46:51,182 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1248 transitions. [2018-11-18 09:46:51,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:51,183 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:51,209 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-18 09:46:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 699 states and 1335 transitions. [2018-11-18 09:46:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1335 transitions. [2018-11-18 09:46:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:52,582 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:52,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-18 09:46:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 699 states and 1334 transitions. [2018-11-18 09:46:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1334 transitions. [2018-11-18 09:46:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:53,420 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:53,462 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-18 09:46:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 702 states and 1339 transitions. [2018-11-18 09:46:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1339 transitions. [2018-11-18 09:46:53,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:53,496 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:53,603 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-18 09:46:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 703 states and 1340 transitions. [2018-11-18 09:46:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1340 transitions. [2018-11-18 09:46:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:54,231 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:54,257 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-18 09:46:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 743 states and 1416 transitions. [2018-11-18 09:46:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1416 transitions. [2018-11-18 09:46:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:56,189 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:56,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-18 09:46:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 746 states and 1420 transitions. [2018-11-18 09:46:56,497 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1420 transitions. [2018-11-18 09:46:56,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:56,498 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:56,522 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-18 09:46:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 747 states and 1421 transitions. [2018-11-18 09:46:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1421 transitions. [2018-11-18 09:46:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:57,039 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:57,065 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-18 09:46:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 748 states and 1421 transitions. [2018-11-18 09:46:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1421 transitions. [2018-11-18 09:46:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:57,625 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:57,733 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-18 09:46:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 751 states and 1432 transitions. [2018-11-18 09:46:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1432 transitions. [2018-11-18 09:46:59,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:59,500 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:59,567 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-18 09:46:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:46:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 752 states and 1433 transitions. [2018-11-18 09:46:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1433 transitions. [2018-11-18 09:46:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:46:59,948 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:46:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:00,083 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-18 09:47:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 753 states and 1434 transitions. [2018-11-18 09:47:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1434 transitions. [2018-11-18 09:47:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:00,667 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:00,696 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-18 09:47:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 754 states and 1434 transitions. [2018-11-18 09:47:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1434 transitions. [2018-11-18 09:47:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:00,720 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:00,744 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-18 09:47:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 772 states and 1470 transitions. [2018-11-18 09:47:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1470 transitions. [2018-11-18 09:47:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:01,575 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:01,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-18 09:47:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 773 states and 1470 transitions. [2018-11-18 09:47:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1470 transitions. [2018-11-18 09:47:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:01,886 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:01,910 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-18 09:47:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 775 states and 1473 transitions. [2018-11-18 09:47:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1473 transitions. [2018-11-18 09:47:02,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:02,472 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:02,494 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-18 09:47:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 797 states and 1515 transitions. [2018-11-18 09:47:03,073 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1515 transitions. [2018-11-18 09:47:03,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:03,074 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:03,087 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-18 09:47:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 798 states and 1517 transitions. [2018-11-18 09:47:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1517 transitions. [2018-11-18 09:47:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:03,677 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:03,700 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-18 09:47:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 842 states and 1600 transitions. [2018-11-18 09:47:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1600 transitions. [2018-11-18 09:47:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:05,659 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:05,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-18 09:47:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 843 states and 1602 transitions. [2018-11-18 09:47:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1602 transitions. [2018-11-18 09:47:06,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:06,210 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:06,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-18 09:47:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 889 states and 1691 transitions. [2018-11-18 09:47:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1691 transitions. [2018-11-18 09:47:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:10,048 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:10,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-18 09:47:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 907 states and 1725 transitions. [2018-11-18 09:47:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1725 transitions. [2018-11-18 09:47:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:11,256 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:11,279 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-18 09:47:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 910 states and 1729 transitions. [2018-11-18 09:47:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1729 transitions. [2018-11-18 09:47:11,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:11,297 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:11,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-18 09:47:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 912 states and 1730 transitions. [2018-11-18 09:47:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1730 transitions. [2018-11-18 09:47:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:11,358 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:11,394 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-18 09:47:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 915 states and 1735 transitions. [2018-11-18 09:47:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1735 transitions. [2018-11-18 09:47:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:11,959 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:12,072 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-18 09:47:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 918 states and 1742 transitions. [2018-11-18 09:47:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1742 transitions. [2018-11-18 09:47:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:12,658 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:12,681 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-18 09:47:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 920 states and 1742 transitions. [2018-11-18 09:47:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1742 transitions. [2018-11-18 09:47:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:12,988 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:14,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-18 09:47:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 936 states and 1771 transitions. [2018-11-18 09:47:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1771 transitions. [2018-11-18 09:47:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:30,259 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:30,852 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-18 09:47:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 943 states and 1783 transitions. [2018-11-18 09:47:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1783 transitions. [2018-11-18 09:47:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:47,963 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:47,981 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-18 09:47:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 945 states and 1786 transitions. [2018-11-18 09:47:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1786 transitions. [2018-11-18 09:47:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:50,956 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:51,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-18 09:47:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 958 states and 1809 transitions. [2018-11-18 09:47:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1809 transitions. [2018-11-18 09:47:54,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:54,048 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:54,067 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-18 09:47:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:47:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 963 states and 1819 transitions. [2018-11-18 09:47:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1819 transitions. [2018-11-18 09:47:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:47:55,780 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:47:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:47:57,417 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-18 09:48:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:48:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 999 states and 1894 transitions. [2018-11-18 09:48:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1894 transitions. [2018-11-18 09:48:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 09:48:25,489 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:48:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:48:25,816 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-18 09:48:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:48:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1003 states and 1899 transitions. [2018-11-18 09:48:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1899 transitions. [2018-11-18 09:48:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 09:48:26,864 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:48:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:48:26,877 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-18 09:48:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:48:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1009 states and 1911 transitions. [2018-11-18 09:48:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1911 transitions. [2018-11-18 09:48:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 09:48:33,167 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:48:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:48:33,180 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-18 09:48:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:48:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1015 states and 1933 transitions. [2018-11-18 09:48:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1933 transitions. [2018-11-18 09:48:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 09:48:37,837 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:48:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:48:37,850 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-18 09:48:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:48:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1020 states and 1947 transitions. [2018-11-18 09:48:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1947 transitions. [2018-11-18 09:48:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 09:48:44,416 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:48:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:48:44,430 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-18 09:48:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:48:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1023 states and 1951 transitions. [2018-11-18 09:48:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1951 transitions. [2018-11-18 09:48:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 09:48:47,129 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:48:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:48:47,142 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-18 09:48:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:48:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1026 states and 1953 transitions. [2018-11-18 09:48:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1953 transitions. [2018-11-18 09:48:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 09:48:50,183 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:48:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:48:50,195 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-18 09:48:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:48:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1029 states and 1963 transitions. [2018-11-18 09:48:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1963 transitions. [2018-11-18 09:48:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 09:48:52,181 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:48:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:48:52,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-18 09:48:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:48:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1029 states and 1962 transitions. [2018-11-18 09:48:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1962 transitions. [2018-11-18 09:48:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 09:48:53,398 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:48:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:48:53,413 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-18 09:49:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1037 states and 1976 transitions. [2018-11-18 09:49:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1976 transitions. [2018-11-18 09:49:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 09:49:00,609 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:00,622 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-18 09:49:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1041 states and 1984 transitions. [2018-11-18 09:49:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1984 transitions. [2018-11-18 09:49:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 09:49:01,693 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:01,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-18 09:49:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1047 states and 1995 transitions. [2018-11-18 09:49:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1995 transitions. [2018-11-18 09:49:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 09:49:07,258 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:07,275 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-18 09:49:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1053 states and 2003 transitions. [2018-11-18 09:49:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 2003 transitions. [2018-11-18 09:49:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:49:08,563 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:10,345 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-18 09:49:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 1060 states and 2020 transitions. [2018-11-18 09:49:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 2020 transitions. [2018-11-18 09:49:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:49:17,868 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:17,963 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-18 09:49:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 1104 states and 2107 transitions. [2018-11-18 09:49:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2107 transitions. [2018-11-18 09:49:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:49:27,129 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:27,152 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-18 09:49:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1099 states and 2090 transitions. [2018-11-18 09:49:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2090 transitions. [2018-11-18 09:49:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:49:30,482 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:30,500 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-18 09:49:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 1100 states and 2091 transitions. [2018-11-18 09:49:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 2091 transitions. [2018-11-18 09:49:30,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:49:30,516 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:33,182 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-18 09:49:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 1112 states and 2128 transitions. [2018-11-18 09:49:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 2128 transitions. [2018-11-18 09:49:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:49:48,944 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:48,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-18 09:49:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 1120 states and 2142 transitions. [2018-11-18 09:49:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 2142 transitions. [2018-11-18 09:49:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:49:51,845 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:52,393 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-18 09:50:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 1124 states and 2146 transitions. [2018-11-18 09:50:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 2146 transitions. [2018-11-18 09:50:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:50:00,261 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:00,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-18 09:50:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 1125 states and 2146 transitions. [2018-11-18 09:50:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 2146 transitions. [2018-11-18 09:50:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:50:00,332 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:00,351 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-18 09:50:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 1124 states and 2144 transitions. [2018-11-18 09:50:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 2144 transitions. [2018-11-18 09:50:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:50:06,230 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:06,304 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-18 09:50:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 1125 states and 2144 transitions. [2018-11-18 09:50:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 2144 transitions. [2018-11-18 09:50:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:50:07,495 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:08,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-18 09:50:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 1134 states and 2159 transitions. [2018-11-18 09:50:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 2159 transitions. [2018-11-18 09:50:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:50:47,702 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:49,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-18 09:51:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 1150 states and 2190 transitions. [2018-11-18 09:51:31,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 2190 transitions. [2018-11-18 09:51:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:51:31,465 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:31,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-18 09:51:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 1149 states and 2188 transitions. [2018-11-18 09:51:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 2188 transitions. [2018-11-18 09:51:38,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:51:38,153 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:38,185 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-18 09:51:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 1150 states and 2189 transitions. [2018-11-18 09:51:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 2189 transitions. [2018-11-18 09:51:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:51:39,471 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:39,681 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-18 09:51:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1142 states and 2174 transitions. [2018-11-18 09:51:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 2174 transitions. [2018-11-18 09:51:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:51:41,507 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:41,530 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-18 09:51:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 1145 states and 2184 transitions. [2018-11-18 09:51:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2184 transitions. [2018-11-18 09:51:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:51:44,519 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:44,538 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-18 09:51:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 1139 states and 2168 transitions. [2018-11-18 09:51:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2168 transitions. [2018-11-18 09:51:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:51:48,228 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:48,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-18 09:51:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 1140 states and 2169 transitions. [2018-11-18 09:51:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 2169 transitions. [2018-11-18 09:51:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:51:49,789 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:50,347 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-18 09:51:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 1146 states and 2177 transitions. [2018-11-18 09:51:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 2177 transitions. [2018-11-18 09:51:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:51:53,332 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:53,355 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-18 09:51:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 1148 states and 2181 transitions. [2018-11-18 09:51:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 2181 transitions. [2018-11-18 09:51:54,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:51:54,846 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:54,865 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-18 09:51:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 1148 states and 2179 transitions. [2018-11-18 09:51:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 2179 transitions. [2018-11-18 09:51:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:51:59,150 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:59,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-18 09:52:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:52:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 1149 states and 2180 transitions. [2018-11-18 09:52:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 2180 transitions. [2018-11-18 09:52:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:52:00,561 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:52:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:00,582 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-18 09:52:04,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:52:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 1147 states and 2165 transitions. [2018-11-18 09:52:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 2165 transitions. [2018-11-18 09:52:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:52:04,169 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:52:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:05,701 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-18 09:52:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:52:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 1186 states and 2242 transitions. [2018-11-18 09:52:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2242 transitions. [2018-11-18 09:52:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:52:19,435 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:52:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:20,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-18 09:52:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:52:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 969 states and 1819 transitions. [2018-11-18 09:52:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1819 transitions. [2018-11-18 09:52:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:52:23,221 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:52:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:23,597 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-18 09:52:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:52:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 989 states and 1856 transitions. [2018-11-18 09:52:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1856 transitions. [2018-11-18 09:52:28,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:52:28,276 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:52:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:28,306 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-18 09:52:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:52:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1035 states and 1945 transitions. [2018-11-18 09:52:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1945 transitions. [2018-11-18 09:52:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:52:34,647 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:52:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:34,707 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-18 09:52:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:52:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1047 states and 1962 transitions. [2018-11-18 09:52:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1962 transitions. [2018-11-18 09:52:39,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:52:39,955 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:52:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:39,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-18 09:52:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:52:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1050 states and 1966 transitions. [2018-11-18 09:52:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1966 transitions. [2018-11-18 09:52:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:52:40,553 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:52:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:40,579 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-18 09:52:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:52:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 1080 states and 2023 transitions. [2018-11-18 09:52:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 2023 transitions. [2018-11-18 09:52:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 09:52:50,007 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:52:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:50,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-18 09:52:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:52:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 1118 states and 2088 transitions. [2018-11-18 09:52:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 2088 transitions. [2018-11-18 09:52:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 09:52:55,662 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:52:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:55,675 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-18 09:52:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:52:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 1121 states and 2092 transitions. [2018-11-18 09:52:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 2092 transitions. [2018-11-18 09:52:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 09:52:57,119 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:52:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:57,763 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-18 09:53:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:53:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 1135 states and 2113 transitions. [2018-11-18 09:53:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2113 transitions. [2018-11-18 09:53:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 09:53:09,063 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:53:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:53:09,075 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-18 09:53:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:53:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 1136 states and 2113 transitions. [2018-11-18 09:53:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 2113 transitions. [2018-11-18 09:53:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 09:53:10,515 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:53:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:53:11,171 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-18 09:53:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:53:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 1154 states and 2141 transitions. [2018-11-18 09:53:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2141 transitions. [2018-11-18 09:53:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 09:53:27,616 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:53:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:53:27,629 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-18 09:53:29,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:53:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 1148 states and 2129 transitions. [2018-11-18 09:53:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 2129 transitions. [2018-11-18 09:53:29,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 09:53:29,495 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:53:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:53:29,507 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-18 09:53:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:53:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 1155 states and 2140 transitions. [2018-11-18 09:53:32,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2140 transitions. [2018-11-18 09:53:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 09:53:32,593 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:53:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:53:32,606 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-18 09:53:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:53:37,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 1155 states and 2139 transitions. [2018-11-18 09:53:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2139 transitions. [2018-11-18 09:53:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 09:53:37,487 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:53:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:53:37,535 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-18 09:53:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:53:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 1162 states and 2150 transitions. [2018-11-18 09:53:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 2150 transitions. [2018-11-18 09:53:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 09:53:43,769 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:53:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:53:43,782 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-18 09:53:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:53:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 1140 states and 2104 transitions. [2018-11-18 09:53:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 2104 transitions. [2018-11-18 09:53:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 09:53:48,458 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:53:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:53:48,472 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-18 09:53:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:53:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 1105 states and 2046 transitions. [2018-11-18 09:53:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 2046 transitions. [2018-11-18 09:53:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 09:53:54,979 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:53:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:53:54,991 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-18 09:53:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:53:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 975 states and 1784 transitions. [2018-11-18 09:53:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1784 transitions. [2018-11-18 09:53:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:53:56,698 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:53:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:53:56,727 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-18 09:54:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1023 states and 1879 transitions. [2018-11-18 09:54:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1879 transitions. [2018-11-18 09:54:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:10,779 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:12,698 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-18 09:54:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1024 states and 1879 transitions. [2018-11-18 09:54:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1879 transitions. [2018-11-18 09:54:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:15,640 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:15,664 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-18 09:54:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1041 states and 1913 transitions. [2018-11-18 09:54:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1913 transitions. [2018-11-18 09:54:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:17,407 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:18,091 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-18 09:54:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1042 states and 1913 transitions. [2018-11-18 09:54:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1913 transitions. [2018-11-18 09:54:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:19,728 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:19,750 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-18 09:54:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1062 states and 1950 transitions. [2018-11-18 09:54:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1950 transitions. [2018-11-18 09:54:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:24,069 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:24,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-18 09:54:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1078 states and 1972 transitions. [2018-11-18 09:54:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1972 transitions. [2018-11-18 09:54:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:32,084 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:32,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-18 09:54:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 1124 states and 2059 transitions. [2018-11-18 09:54:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 2059 transitions. [2018-11-18 09:54:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:41,831 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:42,190 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-18 09:54:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 1127 states and 2063 transitions. [2018-11-18 09:54:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 2063 transitions. [2018-11-18 09:54:45,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:45,191 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:45,219 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-18 09:54:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 1128 states and 2063 transitions. [2018-11-18 09:54:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2063 transitions. [2018-11-18 09:54:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:47,110 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:47,287 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-18 09:54:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 1128 states and 2062 transitions. [2018-11-18 09:54:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2062 transitions. [2018-11-18 09:54:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:48,990 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:49,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-18 09:54:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 1145 states and 2097 transitions. [2018-11-18 09:54:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2097 transitions. [2018-11-18 09:54:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:51,239 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:51,572 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-18 09:54:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 1146 states and 2097 transitions. [2018-11-18 09:54:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 2097 transitions. [2018-11-18 09:54:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:53,283 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:53,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-18 09:54:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:54:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 1169 states and 2137 transitions. [2018-11-18 09:54:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 2137 transitions. [2018-11-18 09:54:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:54:59,590 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:54:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:54:59,767 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-18 09:55:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:55:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 1170 states and 2137 transitions. [2018-11-18 09:55:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 2137 transitions. [2018-11-18 09:55:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:55:01,621 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:55:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:01,656 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-18 09:55:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:55:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 1196 states and 2184 transitions. [2018-11-18 09:55:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 2184 transitions. [2018-11-18 09:55:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:55:07,301 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:55:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:07,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-18 09:55:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:55:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 1243 states and 2276 transitions. [2018-11-18 09:55:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 2276 transitions. [2018-11-18 09:55:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:55:18,704 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:55:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:18,726 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-18 09:55:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:55:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 1244 states and 2277 transitions. [2018-11-18 09:55:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 2277 transitions. [2018-11-18 09:55:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:55:19,675 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:55:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:19,850 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-18 09:55:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:55:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 1269 states and 2325 transitions. [2018-11-18 09:55:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2325 transitions. [2018-11-18 09:55:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:55:23,434 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:55:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:23,457 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-18 09:55:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:55:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 1267 states and 2316 transitions. [2018-11-18 09:55:25,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 2316 transitions. [2018-11-18 09:55:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:55:25,386 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:55:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:25,733 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-18 09:55:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:55:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 1274 states and 2328 transitions. [2018-11-18 09:55:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 2328 transitions. [2018-11-18 09:55:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:55:29,824 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:55:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:55:29,847 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-18 09:55:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:55:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 1276 states and 2330 transitions. [2018-11-18 09:55:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 2330 transitions. [2018-11-18 09:55:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:55:33,375 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:55:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:55:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:55:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:55:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:55:33,752 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 144 iterations. [2018-11-18 09:55:33,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 09:55:33 ImpRootNode [2018-11-18 09:55:33,906 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 09:55:33,907 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:55:33,907 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:55:33,907 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:55:33,908 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:46:05" (3/4) ... [2018-11-18 09:55:33,910 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 09:55:34,070 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_92f0c03d-cbee-47ac-a9a8-724766b46554/bin-2019/ukojak/witness.graphml [2018-11-18 09:55:34,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:55:34,071 INFO L168 Benchmark]: Toolchain (without parser) took 571030.84 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 968.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:34,072 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:55:34,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -211.1 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:34,073 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:34,073 INFO L168 Benchmark]: Boogie Preprocessor took 41.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:34,073 INFO L168 Benchmark]: RCFGBuilder took 1573.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 897.8 MB in the end (delta: 255.3 MB). Peak memory consumption was 255.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:34,073 INFO L168 Benchmark]: CodeCheck took 568714.38 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 954.2 MB). Free memory was 897.8 MB in the beginning and 1.2 GB in the end (delta: -265.5 MB). Peak memory consumption was 688.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:34,074 INFO L168 Benchmark]: Witness Printer took 162.65 ms. Allocated memory is still 2.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:55:34,075 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, 301 locations, 1 error locations. UNSAFE Result, 568.5s OverallTime, 144 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1012108336 SDtfs, -925915216 SDslu, 61984740 SDs, 0 SdLazy, 1436661720 SolverSat, -386326712 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 225.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139902 GetRequests, 135902 SyntacticMatches, 2088 SemanticMatches, 1912 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2048475 ImplicationChecksByTransitivity, 556.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 26.1s InterpolantComputationTime, 17581 NumberOfCodeBlocks, 17581 NumberOfCodeBlocksAsserted, 144 NumberOfCheckSat, 17311 ConstructedInterpolants, 0 QuantifiedInterpolants, 9175029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 143 InterpolantComputations, 143 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: 823]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] char id2 = '\x0'; [L45] unsigned char r2 = '\x0'; [L46] char st2 = '\x0'; [L47] char nl2 = '\x0'; [L48] char m2 = '\x0'; [L49] char max2 = '\x0'; [L50] _Bool mode2 = 0; [L51] char id3 = '\x0'; [L52] unsigned char r3 = '\x0'; [L53] char st3 = '\x0'; [L54] char nl3 = '\x0'; [L55] char m3 = '\x0'; [L56] char max3 = '\x0'; [L57] _Bool mode3 = 0; [L65] int __return_1719; [L66] int __return_1847; [L67] int __return_1965; [L68] int __return_2067; [L69] int __return_2190; [L70] int __return_2300; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L17] port_t p13 = 0; [L21] port_t p21 = 0; [L25] port_t p23 = 0; [L29] port_t p31 = 0; [L33] port_t p32 = 0; [L61] void (*nodes[3])() = { &node1, &node2, &node3 }; [L73] int main__c1; [L74] int main__i2; [L75] main__c1 = 0 [L76] ep12 = __VERIFIER_nondet_bool() [L77] ep13 = __VERIFIER_nondet_bool() [L78] ep21 = __VERIFIER_nondet_bool() [L79] ep23 = __VERIFIER_nondet_bool() [L80] ep31 = __VERIFIER_nondet_bool() [L81] ep32 = __VERIFIER_nondet_bool() [L82] id1 = __VERIFIER_nondet_char() [L83] r1 = __VERIFIER_nondet_uchar() [L84] st1 = __VERIFIER_nondet_char() [L85] nl1 = __VERIFIER_nondet_char() [L86] m1 = __VERIFIER_nondet_char() [L87] max1 = __VERIFIER_nondet_char() [L88] mode1 = __VERIFIER_nondet_bool() [L89] id2 = __VERIFIER_nondet_char() [L90] r2 = __VERIFIER_nondet_uchar() [L91] st2 = __VERIFIER_nondet_char() [L92] nl2 = __VERIFIER_nondet_char() [L93] m2 = __VERIFIER_nondet_char() [L94] max2 = __VERIFIER_nondet_char() [L95] mode2 = __VERIFIER_nondet_bool() [L96] id3 = __VERIFIER_nondet_char() [L97] r3 = __VERIFIER_nondet_uchar() [L98] st3 = __VERIFIER_nondet_char() [L99] nl3 = __VERIFIER_nondet_char() [L100] m3 = __VERIFIER_nondet_char() [L101] max3 = __VERIFIER_nondet_char() [L102] mode3 = __VERIFIER_nondet_bool() [L104] _Bool init__r121; [L105] _Bool init__r131; [L106] _Bool init__r211; [L107] _Bool init__r231; [L108] _Bool init__r311; [L109] _Bool init__r321; [L110] _Bool init__r122; [L111] int init__tmp; [L112] _Bool init__r132; [L113] int init__tmp___0; [L114] _Bool init__r212; [L115] int init__tmp___1; [L116] _Bool init__r232; [L117] int init__tmp___2; [L118] _Bool init__r312; [L119] int init__tmp___3; [L120] _Bool init__r322; [L121] int init__tmp___4; [L122] int init__tmp___5; [L123] init__r121 = ep12 [L124] init__r131 = ep13 [L125] init__r211 = ep21 [L126] init__r231 = ep23 [L127] init__r311 = ep31 [L128] init__r321 = ep32 [L129] COND TRUE !(init__r121 == 0) [L131] init__tmp = 1 [L133] init__r122 = (_Bool)init__tmp [L134] COND FALSE !(!(init__r131 == 0)) [L2204] COND TRUE !(init__r121 == 0) [L2206] COND TRUE !(ep23 == 0) [L2208] init__tmp___0 = 1 [L138] init__r132 = (_Bool)init__tmp___0 [L139] COND FALSE !(!(init__r211 == 0)) [L2181] COND TRUE !(init__r231 == 0) [L2183] COND TRUE !(ep31 == 0) [L2185] init__tmp___1 = 1 [L143] init__r212 = (_Bool)init__tmp___1 [L144] COND TRUE !(init__r231 == 0) [L146] init__tmp___2 = 1 [L148] init__r232 = (_Bool)init__tmp___2 [L149] COND TRUE !(init__r311 == 0) [L151] init__tmp___3 = 1 [L153] init__r312 = (_Bool)init__tmp___3 [L154] COND FALSE !(!(init__r321 == 0)) [L2112] COND TRUE !(init__r311 == 0) [L2114] COND TRUE !(ep12 == 0) [L2116] init__tmp___4 = 1 [L158] init__r322 = (_Bool)init__tmp___4 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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, st1=0, st2=0, st3=0] [L159] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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, st1=0, st2=0, st3=0] [L161] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)id1) >= 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)id2) >= 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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, st1=0, st2=0, st3=0] [L169] COND TRUE ((int)id3) >= 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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, st1=0, st2=0, st3=0] [L171] COND TRUE ((int)r1) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)r2) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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, st1=0, st2=0, st3=0] [L175] COND TRUE ((int)r3) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L177] COND TRUE !(init__r122 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L179] COND TRUE !(init__r132 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L181] COND TRUE !(init__r212 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L183] COND TRUE !(init__r232 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L185] COND TRUE !(init__r312 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L187] COND TRUE !(init__r322 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L189] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L191] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L193] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L195] COND TRUE ((int)st1) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L197] COND TRUE ((int)st2) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L199] COND TRUE ((int)st3) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L201] COND TRUE ((int)nl1) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L203] COND TRUE ((int)nl2) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L205] COND TRUE ((int)nl3) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L207] COND TRUE ((int)mode1) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L209] COND TRUE ((int)mode2) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L211] COND TRUE ((int)mode3) == 0 [L213] init__tmp___5 = 1 [L214] __return_1719 = init__tmp___5 [L215] main__i2 = __return_1719 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L216] COND TRUE main__i2 != 0 [L218] p12_old = nomsg [L219] p12_new = nomsg [L220] p13_old = nomsg [L221] p13_new = nomsg [L222] p21_old = nomsg [L223] p21_new = nomsg [L224] p23_old = nomsg [L225] p23_new = nomsg [L226] p31_old = nomsg [L227] p31_new = nomsg [L228] p32_old = nomsg [L229] p32_new = nomsg [L230] main__i2 = 0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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 FALSE !(!(mode1 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L238] COND TRUE ((int)r1) < 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L240] COND TRUE !(ep12 == 0) [L242] int node1____CPAchecker_TMP_0; VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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 max1 != nomsg VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L245] COND TRUE p12_new == nomsg [L247] node1____CPAchecker_TMP_0 = max1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L249] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L251] COND FALSE !(!(ep13 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, 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] [L262] mode1 = 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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] [L264] COND FALSE !(!(mode2 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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] [L270] COND TRUE ((int)r2) < 2 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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] [L272] COND FALSE !(!(ep21 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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] [L283] COND TRUE !(ep23 == 0) [L285] int node2____CPAchecker_TMP_1; VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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] [L286] COND TRUE max2 != nomsg VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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] [L288] COND TRUE p23_new == nomsg [L290] node2____CPAchecker_TMP_1 = max2 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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] [L292] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, 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] [L294] mode2 = 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, mode2=1, 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=2, 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] [L296] COND FALSE !(!(mode3 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, mode2=1, 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=2, 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] [L302] COND TRUE ((int)r3) < 2 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, mode2=1, 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=2, 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] [L304] COND TRUE !(ep31 == 0) [L306] int node3____CPAchecker_TMP_0; VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, mode2=1, 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=2, 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 max3 != nomsg VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, mode2=1, 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=2, 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] [L309] COND TRUE p31_new == nomsg [L311] node3____CPAchecker_TMP_0 = max3 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, mode2=1, 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=2, 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] [L313] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, mode2=1, 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=2, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L315] COND FALSE !(!(ep32 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, mode2=1, 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=2, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L326] mode3 = 1 [L327] p12_old = p12_new [L328] p12_new = nomsg [L329] p13_old = p13_new [L330] p13_new = nomsg [L331] p21_old = p21_new [L332] p21_new = nomsg [L333] p23_old = p23_new [L334] p23_new = nomsg [L335] p31_old = p31_new [L336] p31_new = nomsg [L337] p32_old = p32_new [L338] p32_new = nomsg [L340] int check__tmp; VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L341] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L343] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L345] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L347] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L349] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND TRUE ((int)r1) < 2 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L359] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L365] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L367] COND TRUE ((int)r1) < 2 [L369] check__tmp = 1 [L370] __return_1847 = check__tmp [L371] main__c1 = __return_1847 [L373] _Bool __tmp_1; [L374] __tmp_1 = main__c1 [L375] _Bool assert__arg; [L376] assert__arg = __tmp_1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND FALSE !(assert__arg == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L384] COND TRUE !(mode1 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=0, m3=-128, max1=1, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND FALSE !(r1 == 255) [L392] r1 = r1 + 1 [L393] COND FALSE !(!(ep21 == 0)) [L401] COND TRUE !(ep31 == 0) [L403] m1 = p31_old [L404] p31_old = nomsg [L405] COND TRUE ((int)m1) > ((int)max1) [L407] max1 = m1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=0, m3=-128, max1=3, max2=2, max3=3, mode1=1, 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=2, 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] [L409] COND FALSE !(((int)r1) == 2) [L415] mode1 = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=0, m3=-128, max1=3, max2=2, max3=3, 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=2, 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] [L417] COND TRUE !(mode2 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=0, m3=-128, max1=3, max2=2, max3=3, 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=2, 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] [L419] COND FALSE !(r2 == 255) [L425] r2 = r2 + 1 [L426] COND TRUE !(ep12 == 0) [L428] m2 = p12_old [L429] p12_old = nomsg [L430] COND FALSE !(((int)m2) > ((int)max2)) [L434] COND FALSE !(!(ep32 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=-128, max1=3, max2=2, max3=3, 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=2, 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] [L442] COND FALSE !(((int)r2) == 2) [L448] mode2 = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=-128, max1=3, max2=2, max3=3, 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=2, 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] [L450] COND TRUE !(mode3 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=-128, max1=3, max2=2, max3=3, 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=2, 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] [L452] COND FALSE !(r3 == 255) [L458] r3 = r3 + 1 [L459] COND FALSE !(!(ep13 == 0)) [L467] COND TRUE !(ep23 == 0) [L469] m3 = p23_old [L470] p23_old = nomsg [L471] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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] [L475] COND FALSE !(((int)r3) == 2) [L481] mode3 = 0 [L482] p12_old = p12_new [L483] p12_new = nomsg [L484] p13_old = p13_new [L485] p13_new = nomsg [L486] p21_old = p21_new [L487] p21_new = nomsg [L488] p23_old = p23_new [L489] p23_new = nomsg [L490] p31_old = p31_new [L491] p31_new = nomsg [L492] p32_old = p32_new [L493] p32_new = nomsg [L495] int check__tmp; VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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] [L496] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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] [L498] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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] [L500] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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] [L502] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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] [L504] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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] [L510] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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] [L512] COND TRUE ((int)r1) < 2 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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] [L514] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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] [L520] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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] [L522] COND TRUE ((int)r1) < 2 [L524] check__tmp = 1 [L525] __return_1965 = check__tmp [L526] main__c1 = __return_1965 [L528] _Bool __tmp_2; [L529] __tmp_2 = main__c1 [L530] _Bool assert__arg; [L531] assert__arg = __tmp_2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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 !(assert__arg == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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] [L539] COND FALSE !(!(mode1 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, 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 FALSE !(((int)r1) < 1) [L551] mode1 = 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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] [L553] COND FALSE !(!(mode2 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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] [L559] COND TRUE ((int)r2) < 2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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] [L561] COND FALSE !(!(ep21 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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] [L572] COND TRUE !(ep23 == 0) [L574] int node2____CPAchecker_TMP_1; VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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] [L575] COND TRUE max2 != nomsg VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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] [L577] COND TRUE p23_new == nomsg [L579] node2____CPAchecker_TMP_1 = max2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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] [L581] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, 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] mode2 = 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, 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=2, 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] [L585] COND FALSE !(!(mode3 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, 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=2, 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] [L591] COND TRUE ((int)r3) < 2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, 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=2, 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] [L593] COND TRUE !(ep31 == 0) [L595] int node3____CPAchecker_TMP_0; VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, 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=2, 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 TRUE max3 != nomsg VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, 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=2, 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] [L598] COND TRUE p31_new == nomsg [L600] node3____CPAchecker_TMP_0 = max3 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, 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=2, 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] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, 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=2, p23_old=-1, p31=0, p31_new=3, 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 FALSE !(!(ep32 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, 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=2, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L615] mode3 = 1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L629] int check__tmp; VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L630] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L632] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L634] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L636] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L638] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L644] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L646] COND TRUE ((int)r1) < 2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L648] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L654] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L656] COND TRUE ((int)r1) < 2 [L658] check__tmp = 1 [L659] __return_2067 = check__tmp [L660] main__c1 = __return_2067 [L662] _Bool __tmp_3; [L663] __tmp_3 = main__c1 [L664] _Bool assert__arg; [L665] assert__arg = __tmp_3 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L666] COND FALSE !(assert__arg == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L673] COND TRUE !(mode1 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L675] COND FALSE !(r1 == 255) [L681] r1 = r1 + 1 [L682] COND FALSE !(!(ep21 == 0)) [L690] COND TRUE !(ep31 == 0) [L692] m1 = p31_old [L693] p31_old = nomsg [L694] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, 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=2, 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] [L698] COND TRUE ((int)r1) == 2 [L700] COND FALSE !(((int)max1) == ((int)id1)) [L1507] nl1 = 1 [L704] mode1 = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=1, mode3=1, nl1=1, 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=2, 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] [L706] COND TRUE !(mode2 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=1, mode3=1, nl1=1, 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=2, 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] [L708] COND FALSE !(r2 == 255) [L714] r2 = r2 + 1 [L715] COND TRUE !(ep12 == 0) [L717] m2 = p12_old [L718] p12_old = nomsg [L719] COND FALSE !(((int)m2) > ((int)max2)) [L723] COND FALSE !(!(ep32 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=1, mode3=1, nl1=1, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L731] COND TRUE ((int)r2) == 2 [L733] COND TRUE ((int)max2) == ((int)id2) [L735] st2 = 1 [L737] mode2 = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=1, nl1=1, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=1, st3=0] [L739] COND TRUE !(mode3 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=1, nl1=1, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=1, st3=0] [L741] COND FALSE !(r3 == 255) [L747] r3 = r3 + 1 [L748] COND FALSE !(!(ep13 == 0)) [L756] COND TRUE !(ep23 == 0) [L758] m3 = p23_old [L759] p23_old = nomsg [L760] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=1, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L764] COND TRUE ((int)r3) == 2 [L766] COND TRUE ((int)max3) == ((int)id3) [L768] st3 = 1 [L770] mode3 = 0 [L771] p12_old = p12_new [L772] p12_new = nomsg [L773] p13_old = p13_new [L774] p13_new = nomsg [L775] p21_old = p21_new [L776] p21_new = nomsg [L777] p23_old = p23_new [L778] p23_new = nomsg [L779] p31_old = p31_new [L780] p31_new = nomsg [L781] p32_old = p32_new [L782] p32_new = nomsg [L784] int check__tmp; VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L785] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1424] check__tmp = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L813] __return_2190 = check__tmp [L814] main__c1 = __return_2190 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L817] _Bool __tmp_4; [L818] __tmp_4 = main__c1 [L819] _Bool assert__arg; [L820] assert__arg = __tmp_4 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L821] COND TRUE assert__arg == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L823] __VERIFIER_error() VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 472.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -211.1 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1573.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 897.8 MB in the end (delta: 255.3 MB). Peak memory consumption was 255.3 MB. Max. memory is 11.5 GB. * CodeCheck took 568714.38 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 954.2 MB). Free memory was 897.8 MB in the beginning and 1.2 GB in the end (delta: -265.5 MB). Peak memory consumption was 688.8 MB. Max. memory is 11.5 GB. * Witness Printer took 162.65 ms. Allocated memory is still 2.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...