./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/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 5502f9672f054c34b790763a9f35b59444705f97 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-678e011 [2019-11-20 05:56:06,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:56:06,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:56:06,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:56:06,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:56:06,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:56:06,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:56:06,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:56:06,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:56:06,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:56:06,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:56:06,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:56:06,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:56:06,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:56:06,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:56:06,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:56:06,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:56:06,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:56:06,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:56:06,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:56:06,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:56:06,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:56:06,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:56:06,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:56:06,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:56:06,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:56:06,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:56:06,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:56:06,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:56:06,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:56:06,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:56:06,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:56:06,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:56:06,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:56:06,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:56:06,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:56:06,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:56:06,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:56:06,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:56:06,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:56:06,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:56:06,290 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 05:56:06,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:56:06,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:56:06,315 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 05:56:06,315 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 05:56:06,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:56:06,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:56:06,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:56:06,316 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:56:06,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:56:06,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:56:06,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:56:06,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:56:06,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:56:06,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:56:06,317 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:56:06,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:56:06,318 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:56:06,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:56:06,318 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 05:56:06,318 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 05:56:06,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:56:06,319 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:56:06,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 05:56:06,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:56:06,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:56:06,319 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:56:06,320 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 05:56:06,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:56:06,320 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:56:06,320 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/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 -> 5502f9672f054c34b790763a9f35b59444705f97 [2019-11-20 05:56:06,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:56:06,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:56:06,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:56:06,475 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:56:06,476 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:56:06,476 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-20 05:56:06,524 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/ukojak/data/4e9b8772e/a2c9e13f8a384e5a9d6f941cd89497ef/FLAGb3505e56d [2019-11-20 05:56:07,015 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:56:07,016 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-20 05:56:07,030 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/ukojak/data/4e9b8772e/a2c9e13f8a384e5a9d6f941cd89497ef/FLAGb3505e56d [2019-11-20 05:56:07,046 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/ukojak/data/4e9b8772e/a2c9e13f8a384e5a9d6f941cd89497ef [2019-11-20 05:56:07,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:56:07,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:56:07,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:56:07,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:56:07,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:56:07,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:56:07" (1/1) ... [2019-11-20 05:56:07,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b7e261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:07, skipping insertion in model container [2019-11-20 05:56:07,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:56:07" (1/1) ... [2019-11-20 05:56:07,068 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:56:07,132 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:56:07,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:56:07,621 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:56:07,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:56:07,778 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:56:07,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:07 WrapperNode [2019-11-20 05:56:07,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:56:07,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:56:07,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:56:07,779 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:56:07,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:07" (1/1) ... [2019-11-20 05:56:07,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:07" (1/1) ... [2019-11-20 05:56:07,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:56:07,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:56:07,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:56:07,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:56:07,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:07" (1/1) ... [2019-11-20 05:56:07,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:07" (1/1) ... [2019-11-20 05:56:07,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:07" (1/1) ... [2019-11-20 05:56:07,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:07" (1/1) ... [2019-11-20 05:56:07,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:07" (1/1) ... [2019-11-20 05:56:07,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:07" (1/1) ... [2019-11-20 05:56:07,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:07" (1/1) ... [2019-11-20 05:56:07,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:56:07,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:56:07,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:56:07,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:56:07,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/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 [2019-11-20 05:56:08,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:56:08,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:56:10,220 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:56:10,220 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 05:56:10,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:10 BoogieIcfgContainer [2019-11-20 05:56:10,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:56:10,222 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 05:56:10,222 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 05:56:10,232 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 05:56:10,232 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:10" (1/1) ... [2019-11-20 05:56:10,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 188 states and 332 transitions. [2019-11-20 05:56:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 332 transitions. [2019-11-20 05:56:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 05:56:10,296 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 198 states and 354 transitions. [2019-11-20 05:56:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 354 transitions. [2019-11-20 05:56:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 05:56:11,115 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:11,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 200 states and 358 transitions. [2019-11-20 05:56:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 358 transitions. [2019-11-20 05:56:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 05:56:11,390 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 211 states and 383 transitions. [2019-11-20 05:56:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 383 transitions. [2019-11-20 05:56:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 05:56:12,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 218 states and 401 transitions. [2019-11-20 05:56:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 401 transitions. [2019-11-20 05:56:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 05:56:13,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 219 states and 402 transitions. [2019-11-20 05:56:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 402 transitions. [2019-11-20 05:56:13,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 05:56:13,168 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 219 states and 400 transitions. [2019-11-20 05:56:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 400 transitions. [2019-11-20 05:56:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 05:56:13,240 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 222 states and 408 transitions. [2019-11-20 05:56:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 408 transitions. [2019-11-20 05:56:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 05:56:16,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 226 states and 414 transitions. [2019-11-20 05:56:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 414 transitions. [2019-11-20 05:56:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 05:56:16,500 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 238 states and 442 transitions. [2019-11-20 05:56:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 442 transitions. [2019-11-20 05:56:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 05:56:21,365 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 253 states and 475 transitions. [2019-11-20 05:56:32,785 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 475 transitions. [2019-11-20 05:56:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 05:56:32,786 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 257 states and 481 transitions. [2019-11-20 05:56:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 481 transitions. [2019-11-20 05:56:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 05:56:33,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:56:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 265 states and 502 transitions. [2019-11-20 05:56:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 502 transitions. [2019-11-20 05:56:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 05:56:46,198 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:56:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:04,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 275 states and 532 transitions. [2019-11-20 05:57:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 532 transitions. [2019-11-20 05:57:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 05:57:04,415 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 277 states and 536 transitions. [2019-11-20 05:57:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 536 transitions. [2019-11-20 05:57:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 05:57:06,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 278 states and 537 transitions. [2019-11-20 05:57:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 537 transitions. [2019-11-20 05:57:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 05:57:06,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 278 states and 536 transitions. [2019-11-20 05:57:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 536 transitions. [2019-11-20 05:57:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:06,613 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 282 states and 542 transitions. [2019-11-20 05:57:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 542 transitions. [2019-11-20 05:57:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:08,783 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 286 states and 548 transitions. [2019-11-20 05:57:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 548 transitions. [2019-11-20 05:57:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:10,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:10,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 290 states and 556 transitions. [2019-11-20 05:57:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 556 transitions. [2019-11-20 05:57:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:15,498 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 303 states and 589 transitions. [2019-11-20 05:57:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 589 transitions. [2019-11-20 05:57:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:23,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 307 states and 595 transitions. [2019-11-20 05:57:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 595 transitions. [2019-11-20 05:57:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:25,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 311 states and 601 transitions. [2019-11-20 05:57:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 601 transitions. [2019-11-20 05:57:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:27,147 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 320 states and 626 transitions. [2019-11-20 05:57:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 626 transitions. [2019-11-20 05:57:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:34,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 328 states and 648 transitions. [2019-11-20 05:57:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 648 transitions. [2019-11-20 05:57:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:39,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 331 states and 654 transitions. [2019-11-20 05:57:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 654 transitions. [2019-11-20 05:57:42,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:42,659 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 335 states and 660 transitions. [2019-11-20 05:57:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 660 transitions. [2019-11-20 05:57:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:45,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 336 states and 663 transitions. [2019-11-20 05:57:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 663 transitions. [2019-11-20 05:57:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:48,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 337 states and 665 transitions. [2019-11-20 05:57:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 665 transitions. [2019-11-20 05:57:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:49,945 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 338 states and 666 transitions. [2019-11-20 05:57:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 666 transitions. [2019-11-20 05:57:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:57:51,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:57:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 322 states and 615 transitions. [2019-11-20 05:57:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 615 transitions. [2019-11-20 05:57:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:57:55,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:57:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:58:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:58:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 327 states and 634 transitions. [2019-11-20 05:58:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 634 transitions. [2019-11-20 05:58:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:58:26,700 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:58:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:58:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:58:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:58:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 336 states and 656 transitions. [2019-11-20 05:58:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 656 transitions. [2019-11-20 05:58:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:58:40,808 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:58:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:58:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:58:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:58:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 342 states and 667 transitions. [2019-11-20 05:58:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 667 transitions. [2019-11-20 05:58:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:58:48,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:58:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:58:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:58:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:58:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 346 states and 672 transitions. [2019-11-20 05:58:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 672 transitions. [2019-11-20 05:58:54,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:58:54,734 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:58:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:58:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:58:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:58:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 350 states and 677 transitions. [2019-11-20 05:58:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 677 transitions. [2019-11-20 05:58:59,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:58:59,287 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:58:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:59:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:59:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:59:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 351 states and 677 transitions. [2019-11-20 05:59:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 677 transitions. [2019-11-20 05:59:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:59:03,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:59:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:59:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:59:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:59:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 355 states and 682 transitions. [2019-11-20 05:59:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 682 transitions. [2019-11-20 05:59:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:59:07,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:59:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:59:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:59:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:59:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 356 states and 684 transitions. [2019-11-20 05:59:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 684 transitions. [2019-11-20 05:59:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:59:41,610 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:59:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:59:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:59:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:59:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 356 states and 683 transitions. [2019-11-20 05:59:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 683 transitions. [2019-11-20 05:59:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:59:49,074 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:59:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:59:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:59:54,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:59:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 353 states and 675 transitions. [2019-11-20 05:59:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 675 transitions. [2019-11-20 05:59:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:59:54,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:59:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:59:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:00:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:00:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 350 states and 668 transitions. [2019-11-20 06:00:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 668 transitions. [2019-11-20 06:00:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 06:00:00,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:00:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:00:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:00:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:00:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 349 states and 665 transitions. [2019-11-20 06:00:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 665 transitions. [2019-11-20 06:00:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 06:00:03,308 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:00:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:00:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:00:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:00:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 349 states and 664 transitions. [2019-11-20 06:00:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 664 transitions. [2019-11-20 06:00:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 06:00:05,009 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:00:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:00:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:00:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:00:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 348 states and 661 transitions. [2019-11-20 06:00:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 661 transitions. [2019-11-20 06:00:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 06:00:12,669 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:00:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:00: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. [2019-11-20 06:00:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:00:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 348 states and 660 transitions. [2019-11-20 06:00:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 660 transitions. [2019-11-20 06:00:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:00:14,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:00:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:00:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:00:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:00:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 356 states and 674 transitions. [2019-11-20 06:00:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 674 transitions. [2019-11-20 06:00:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:00:23,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:00:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:00:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:00:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:00:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 360 states and 682 transitions. [2019-11-20 06:00:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 682 transitions. [2019-11-20 06:00:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:00:31,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:00:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:00:31,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:00:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:00:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 364 states and 688 transitions. [2019-11-20 06:00:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 688 transitions. [2019-11-20 06:00:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:00:38,978 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:00:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:00:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:00:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:00:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 368 states and 697 transitions. [2019-11-20 06:00:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 697 transitions. [2019-11-20 06:00:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:00:40,863 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:00:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:00:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:00:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:00:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 375 states and 713 transitions. [2019-11-20 06:00:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 713 transitions. [2019-11-20 06:00:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:00:47,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:00:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:00:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:00:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:00:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 377 states and 718 transitions. [2019-11-20 06:00:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 718 transitions. [2019-11-20 06:00:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:00:50,686 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:00:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:00:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 386 states and 735 transitions. [2019-11-20 06:01:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 735 transitions. [2019-11-20 06:01:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:01:00,812 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 383 states and 728 transitions. [2019-11-20 06:01:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 728 transitions. [2019-11-20 06:01:07,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:01:07,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 380 states and 722 transitions. [2019-11-20 06:01:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 722 transitions. [2019-11-20 06:01:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:01:14,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 377 states and 716 transitions. [2019-11-20 06:01:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 716 transitions. [2019-11-20 06:01:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:01:21,655 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 373 states and 706 transitions. [2019-11-20 06:01:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 706 transitions. [2019-11-20 06:01:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:01:33,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 373 states and 705 transitions. [2019-11-20 06:01:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 705 transitions. [2019-11-20 06:01:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:01:35,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 373 states and 704 transitions. [2019-11-20 06:01:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 704 transitions. [2019-11-20 06:01:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:01:37,828 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 373 states and 703 transitions. [2019-11-20 06:01:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 703 transitions. [2019-11-20 06:01:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:01:39,787 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 372 states and 700 transitions. [2019-11-20 06:01:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 700 transitions. [2019-11-20 06:01:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:01:43,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:43,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 350 states and 643 transitions. [2019-11-20 06:01:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 643 transitions. [2019-11-20 06:01:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:01:46,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 350 states and 641 transitions. [2019-11-20 06:01:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 641 transitions. [2019-11-20 06:01:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:01:48,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 350 states and 639 transitions. [2019-11-20 06:01:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 639 transitions. [2019-11-20 06:01:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:01:50,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:01:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:01:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 350 states and 637 transitions. [2019-11-20 06:01:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 637 transitions. [2019-11-20 06:01:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 06:01:52,639 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:01:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:01:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:02:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:02:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 359 states and 654 transitions. [2019-11-20 06:02:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 654 transitions. [2019-11-20 06:02:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 06:02:01,883 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:02:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:02:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:02:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:02:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 368 states and 669 transitions. [2019-11-20 06:02:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 669 transitions. [2019-11-20 06:02:54,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 06:02:54,687 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:02:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:02:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:03:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:03:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 372 states and 681 transitions. [2019-11-20 06:03:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 681 transitions. [2019-11-20 06:03:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 06:03:04,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:03:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:03:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:03:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 381 states and 697 transitions. [2019-11-20 06:03:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 697 transitions. [2019-11-20 06:03:14,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 06:03:14,397 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:03:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:03:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 06:03:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 390 states and 719 transitions. [2019-11-20 06:03:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 719 transitions. [2019-11-20 06:03:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 06:03:24,757 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 06:03:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 06:03:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 06:03:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 06:03:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 06:03:25,156 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 70 iterations. [2019-11-20 06:03:25,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 06:03:25 ImpRootNode [2019-11-20 06:03:25,509 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 06:03:25,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 06:03:25,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 06:03:25,510 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 06:03:25,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:10" (3/4) ... [2019-11-20 06:03:25,512 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 06:03:25,716 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a8151535-a2ec-40d3-9251-babf579e8a54/bin/ukojak/witness.graphml [2019-11-20 06:03:25,716 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 06:03:25,718 INFO L168 Benchmark]: Toolchain (without parser) took 438667.89 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 940.8 MB in the beginning and 1.0 GB in the end (delta: -75.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-20 06:03:25,719 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:03:25,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-20 06:03:25,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 06:03:25,720 INFO L168 Benchmark]: Boogie Preprocessor took 52.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 06:03:25,720 INFO L168 Benchmark]: RCFGBuilder took 2308.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 114.3 kB). Peak memory consumption was 245.6 MB. Max. memory is 11.5 GB. [2019-11-20 06:03:25,721 INFO L168 Benchmark]: CodeCheck took 435287.20 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-20 06:03:25,721 INFO L168 Benchmark]: Witness Printer took 206.82 ms. Allocated memory is still 2.8 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. [2019-11-20 06:03:25,723 INFO L335 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, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 434.9s, OverallIterations: 70, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 80741432 SDtfs, 627469476 SDslu, 1749323012 SDs, 0 SdLazy, 2082141852 SolverSat, 136315000 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 95.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46947 GetRequests, 45170 SyntacticMatches, 543 SemanticMatches, 1234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752493 ImplicationChecksByTransitivity, 426.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 5798 NumberOfCodeBlocks, 5798 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 5641 ConstructedInterpolants, 0 QuantifiedInterpolants, 2020270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 69 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 569]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L17] port_t p13 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L21] port_t p21 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L25] port_t p23 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L29] port_t p31 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L33] port_t p32 = 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] _Bool newmax1 = 0; [L45] char id2 = '\x0'; [L46] unsigned char r2 = '\x0'; [L47] char st2 = '\x0'; [L48] char nl2 = '\x0'; [L49] char m2 = '\x0'; [L50] char max2 = '\x0'; [L51] _Bool mode2 = 0; [L52] _Bool newmax2 = 0; [L53] char id3 = '\x0'; [L54] unsigned char r3 = '\x0'; [L55] char st3 = '\x0'; [L56] char nl3 = '\x0'; [L57] char m3 = '\x0'; [L58] char max3 = '\x0'; [L59] _Bool mode3 = 0; [L60] _Bool newmax3 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L68] int __return_1248; [L69] int __return_1394; [L70] int __return_1872; [L71] int __return_1528; [L72] int __return_1653; [L75] int main__c1; [L76] int main__i2; [L77] main__c1 = 0 [L78] ep12 = __VERIFIER_nondet_bool() [L79] ep13 = __VERIFIER_nondet_bool() [L80] ep21 = __VERIFIER_nondet_bool() [L81] ep23 = __VERIFIER_nondet_bool() [L82] ep31 = __VERIFIER_nondet_bool() [L83] ep32 = __VERIFIER_nondet_bool() [L84] id1 = __VERIFIER_nondet_char() [L85] r1 = __VERIFIER_nondet_uchar() [L86] st1 = __VERIFIER_nondet_char() [L87] nl1 = __VERIFIER_nondet_char() [L88] m1 = __VERIFIER_nondet_char() [L89] max1 = __VERIFIER_nondet_char() [L90] mode1 = __VERIFIER_nondet_bool() [L91] newmax1 = __VERIFIER_nondet_bool() [L92] id2 = __VERIFIER_nondet_char() [L93] r2 = __VERIFIER_nondet_uchar() [L94] st2 = __VERIFIER_nondet_char() [L95] nl2 = __VERIFIER_nondet_char() [L96] m2 = __VERIFIER_nondet_char() [L97] max2 = __VERIFIER_nondet_char() [L98] mode2 = __VERIFIER_nondet_bool() [L99] newmax2 = __VERIFIER_nondet_bool() [L100] id3 = __VERIFIER_nondet_char() [L101] r3 = __VERIFIER_nondet_uchar() [L102] st3 = __VERIFIER_nondet_char() [L103] nl3 = __VERIFIER_nondet_char() [L104] m3 = __VERIFIER_nondet_char() [L105] max3 = __VERIFIER_nondet_char() [L106] mode3 = __VERIFIER_nondet_bool() [L107] newmax3 = __VERIFIER_nondet_bool() [L109] _Bool init__r121; [L110] _Bool init__r131; [L111] _Bool init__r211; [L112] _Bool init__r231; [L113] _Bool init__r311; [L114] _Bool init__r321; [L115] _Bool init__r122; [L116] int init__tmp; [L117] _Bool init__r132; [L118] int init__tmp___0; [L119] _Bool init__r212; [L120] int init__tmp___1; [L121] _Bool init__r232; [L122] int init__tmp___2; [L123] _Bool init__r312; [L124] int init__tmp___3; [L125] _Bool init__r322; [L126] int init__tmp___4; [L127] int init__tmp___5; [L128] init__r121 = ep12 [L129] init__r131 = ep13 [L130] init__r211 = ep21 [L131] init__r231 = ep23 [L132] init__r311 = ep31 [L133] init__r321 = ep32 [L134] COND FALSE !(!(init__r121 == 0)) [L1987] COND TRUE !(init__r131 == 0) [L1989] COND TRUE !(ep32 == 0) [L1991] init__tmp = 1 [L138] init__r122 = (_Bool)init__tmp [L139] COND TRUE !(init__r131 == 0) [L141] init__tmp___0 = 1 [L143] init__r132 = (_Bool)init__tmp___0 [L144] COND TRUE !(init__r211 == 0) [L146] init__tmp___1 = 1 [L148] init__r212 = (_Bool)init__tmp___1 [L149] COND FALSE !(!(init__r231 == 0)) [L1918] COND TRUE !(init__r211 == 0) [L1920] COND TRUE !(ep13 == 0) [L1922] init__tmp___2 = 1 [L153] init__r232 = (_Bool)init__tmp___2 [L154] COND FALSE !(!(init__r311 == 0)) [L1895] COND TRUE !(init__r321 == 0) [L1897] COND TRUE !(ep21 == 0) [L1899] init__tmp___3 = 1 [L158] init__r312 = (_Bool)init__tmp___3 [L159] COND TRUE !(init__r321 == 0) [L161] init__tmp___4 = 1 [L163] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, 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] [L164] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, 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] [L166] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, 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] [L168] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, 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] [L170] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, 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] [L172] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, 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] [L174] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, 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] [L176] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, 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] [L178] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, 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] [L180] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, 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] [L214] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, 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] [L216] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, 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] [L218] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L220] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L222] COND TRUE !(newmax3 == 0) [L224] init__tmp___5 = 1 [L225] __return_1248 = init__tmp___5 [L226] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L227] COND TRUE main__i2 != 0 [L229] p12_old = nomsg [L230] p12_new = nomsg [L231] p13_old = nomsg [L232] p13_new = nomsg [L233] p21_old = nomsg [L234] p21_new = nomsg [L235] p23_old = nomsg [L236] p23_new = nomsg [L237] p31_old = nomsg [L238] p31_new = nomsg [L239] p32_old = nomsg [L240] p32_new = nomsg [L241] main__i2 = 0 [L243] _Bool node1__newmax; [L244] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L245] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L251] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L253] COND FALSE !(!(ep12 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L266] COND TRUE !(ep13 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L268] COND TRUE !(newmax1 == 0) [L270] int node1____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L271] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L273] COND TRUE p13_new == nomsg [L275] node1____CPAchecker_TMP_1 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L277] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L279] mode1 = 1 [L281] _Bool node2__newmax; [L282] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L283] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L289] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L291] COND TRUE !(ep21 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L293] COND TRUE !(newmax2 == 0) [L295] int node2____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L296] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L298] COND TRUE p21_new == nomsg [L300] node2____CPAchecker_TMP_0 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L302] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, 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] [L304] COND FALSE !(!(ep23 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, 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] [L317] mode2 = 1 [L319] _Bool node3__newmax; [L320] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, 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] [L321] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, 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] [L327] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, 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] [L329] COND FALSE !(!(ep31 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, 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] [L342] COND TRUE !(ep32 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, 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] [L344] COND TRUE !(newmax3 == 0) [L346] int node3____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, 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] [L347] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, 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] [L349] COND TRUE p32_new == nomsg [L351] node3____CPAchecker_TMP_1 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, 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] [L353] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=126, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] mode3 = 1 [L356] p12_old = p12_new [L357] p12_new = nomsg [L358] p13_old = p13_new [L359] p13_new = nomsg [L360] p21_old = p21_new [L361] p21_new = nomsg [L362] p23_old = p23_new [L363] p23_new = nomsg [L364] p31_old = p31_new [L365] p31_new = nomsg [L366] p32_old = p32_new [L367] p32_new = nomsg [L369] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L370] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L372] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L374] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L376] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L378] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L384] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L394] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L396] COND TRUE ((int)r1) < 2 [L398] check__tmp = 1 [L399] __return_1394 = check__tmp [L400] main__c1 = __return_1394 [L402] _Bool __tmp_1; [L403] __tmp_1 = main__c1 [L404] _Bool assert__arg; [L405] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L406] COND FALSE !(assert__arg == 0) [L413] _Bool node1__newmax; [L414] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=-128, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L417] COND FALSE !(r1 == 255) [L423] r1 = r1 + 1 [L424] COND TRUE !(ep21 == 0) [L426] m1 = p21_old [L427] p21_old = nomsg [L428] COND FALSE !(((int)m1) > ((int)max1)) [L433] COND FALSE !(!(ep31 == 0)) [L442] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=126, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int)r1) == 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=126, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE ((int)max1) == ((int)id1) [L447] st1 = 1 [L448] mode1 = 0 [L450] _Bool node2__newmax; [L451] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=126, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L452] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=127, m3=0, max1=1, max2=0, max3=126, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=126, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L454] COND FALSE !(r2 == 255) [L460] r2 = r2 + 1 [L461] COND FALSE !(!(ep12 == 0)) [L470] COND TRUE !(ep32 == 0) [L472] m2 = p32_old [L473] p32_old = nomsg [L474] COND TRUE ((int)m2) > ((int)max2) [L476] max2 = m2 [L477] node2__newmax = 1 [L479] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=0, max1=1, max2=126, max3=126, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=0, st1=1, st2=0, st3=0] [L480] COND FALSE !(((int)r2) == 2) [L486] mode2 = 0 [L488] _Bool node3__newmax; [L489] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=0, max1=1, max2=126, max3=126, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=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=0, st1=1, st2=0, st3=0] [L490] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=0, max1=1, max2=126, max3=126, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=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=0, st1=1, st2=0, st3=0] [L492] COND FALSE !(r3 == 255) [L498] r3 = r3 + 1 [L499] COND TRUE !(ep13 == 0) [L501] m3 = p13_old [L502] p13_old = nomsg [L503] COND FALSE !(((int)m3) > ((int)max3)) [L508] COND FALSE !(!(ep23 == 0)) [L517] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=1, max1=1, max2=126, max3=126, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L518] COND FALSE !(((int)r3) == 2) [L524] mode3 = 0 [L525] p12_old = p12_new [L526] p12_new = nomsg [L527] p13_old = p13_new [L528] p13_new = nomsg [L529] p21_old = p21_new [L530] p21_new = nomsg [L531] p23_old = p23_new [L532] p23_new = nomsg [L533] p31_old = p31_new [L534] p31_new = nomsg [L535] p32_old = p32_new [L536] p32_new = nomsg [L538] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=1, max1=1, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L539] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=1, max1=1, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L541] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=1, max1=1, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L543] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=1, max1=1, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L545] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=1, max1=1, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L547] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=1, max1=1, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L553] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L559] check__tmp = 0 [L560] __return_1872 = check__tmp [L561] main__c1 = __return_1872 [L563] _Bool __tmp_2; [L564] __tmp_2 = main__c1 [L565] _Bool assert__arg; [L566] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=1, max1=1, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L567] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=1, max1=1, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L569] __VERIFIER_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=126, m1=0, m2=126, m3=1, max1=1, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 724.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2308.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 114.3 kB). Peak memory consumption was 245.6 MB. Max. memory is 11.5 GB. * CodeCheck took 435287.20 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 206.82 ms. Allocated memory is still 2.8 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...