./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-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_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/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 e933d4cdc4956da0da3b7a9eafbe7f31dfa7607e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 02:38:25,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:38:25,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:38:25,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:38:25,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:38:25,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:38:25,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:38:25,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:38:25,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:38:25,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:38:25,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:38:25,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:38:25,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:38:25,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:38:25,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:38:25,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:38:25,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:38:25,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:38:25,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:38:25,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:38:25,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:38:25,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:38:25,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:38:25,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:38:25,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:38:25,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:38:25,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:38:25,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:38:25,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:38:25,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:38:25,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:38:25,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:38:25,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:38:25,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:38:25,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:38:25,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:38:25,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:38:25,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:38:25,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:38:25,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:38:25,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:38:25,461 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 02:38:25,484 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:38:25,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:38:25,495 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 02:38:25,495 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 02:38:25,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:38:25,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:38:25,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:38:25,497 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:38:25,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:38:25,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:38:25,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:38:25,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:38:25,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:38:25,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:38:25,498 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:38:25,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:38:25,498 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:38:25,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:38:25,499 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 02:38:25,499 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 02:38:25,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:38:25,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:38:25,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 02:38:25,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:38:25,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:38:25,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:38:25,502 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 02:38:25,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 02:38:25,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:38:25,502 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_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/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 -> e933d4cdc4956da0da3b7a9eafbe7f31dfa7607e [2019-11-20 02:38:25,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:38:25,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:38:25,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:38:25,688 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:38:25,689 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:38:25,690 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-20 02:38:25,750 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/bin/ukojak/data/dc7f19b1d/5fc19e9c4c0146c6a73c9e681e3d4324/FLAG08e6a946e [2019-11-20 02:38:26,223 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:38:26,223 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-20 02:38:26,234 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/bin/ukojak/data/dc7f19b1d/5fc19e9c4c0146c6a73c9e681e3d4324/FLAG08e6a946e [2019-11-20 02:38:26,561 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/bin/ukojak/data/dc7f19b1d/5fc19e9c4c0146c6a73c9e681e3d4324 [2019-11-20 02:38:26,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:38:26,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:38:26,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:38:26,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:38:26,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:38:26,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:38:26" (1/1) ... [2019-11-20 02:38:26,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d9bf82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:26, skipping insertion in model container [2019-11-20 02:38:26,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:38:26" (1/1) ... [2019-11-20 02:38:26,588 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:38:26,642 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:38:27,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:38:27,058 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:38:27,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:38:27,206 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:38:27,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:27 WrapperNode [2019-11-20 02:38:27,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:38:27,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:38:27,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:38:27,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:38:27,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:27" (1/1) ... [2019-11-20 02:38:27,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:27" (1/1) ... [2019-11-20 02:38:27,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:38:27,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:38:27,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:38:27,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:38:27,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:27" (1/1) ... [2019-11-20 02:38:27,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:27" (1/1) ... [2019-11-20 02:38:27,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:27" (1/1) ... [2019-11-20 02:38:27,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:27" (1/1) ... [2019-11-20 02:38:27,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:27" (1/1) ... [2019-11-20 02:38:27,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:27" (1/1) ... [2019-11-20 02:38:27,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:27" (1/1) ... [2019-11-20 02:38:27,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:38:27,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:38:27,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:38:27,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:38:27,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/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 02:38:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:38:27,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:38:29,646 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:38:29,646 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 02:38:29,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:38:29 BoogieIcfgContainer [2019-11-20 02:38:29,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:38:29,648 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 02:38:29,648 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 02:38:29,659 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 02:38:29,662 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:38:29" (1/1) ... [2019-11-20 02:38:29,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:38:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 173 states and 303 transitions. [2019-11-20 02:38:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 303 transitions. [2019-11-20 02:38:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 02:38:29,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:30,460 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 02:38:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 184 states and 330 transitions. [2019-11-20 02:38:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2019-11-20 02:38:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 02:38:30,628 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:30,763 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 02:38:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 184 states and 328 transitions. [2019-11-20 02:38:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 328 transitions. [2019-11-20 02:38:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 02:38:30,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:31,100 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 02:38:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 190 states and 341 transitions. [2019-11-20 02:38:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 341 transitions. [2019-11-20 02:38:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 02:38:31,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:31,583 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 02:38:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 192 states and 345 transitions. [2019-11-20 02:38:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 345 transitions. [2019-11-20 02:38:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 02:38:31,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:31,711 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 02:38:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 204 states and 372 transitions. [2019-11-20 02:38:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 372 transitions. [2019-11-20 02:38:32,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 02:38:32,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:32,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 02:38:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 205 states and 373 transitions. [2019-11-20 02:38:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 373 transitions. [2019-11-20 02:38:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 02:38:32,430 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:32,499 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 02:38:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 207 states and 379 transitions. [2019-11-20 02:38:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 379 transitions. [2019-11-20 02:38:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 02:38:32,696 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:33,088 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 02:38:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 214 states and 398 transitions. [2019-11-20 02:38:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 398 transitions. [2019-11-20 02:38:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 02:38:35,946 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:36,273 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 02:38:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 214 states and 397 transitions. [2019-11-20 02:38:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 397 transitions. [2019-11-20 02:38:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 02:38:40,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:40,925 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 02:38:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 221 states and 416 transitions. [2019-11-20 02:38:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 416 transitions. [2019-11-20 02:38:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 02:38:47,487 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:47,602 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 02:38:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 230 states and 437 transitions. [2019-11-20 02:38:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 437 transitions. [2019-11-20 02:38:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 02:38:49,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:49,568 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 02:38:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 234 states and 443 transitions. [2019-11-20 02:38:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 443 transitions. [2019-11-20 02:38:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 02:38:49,816 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:49,922 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 02:38:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:38:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 237 states and 450 transitions. [2019-11-20 02:38:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 450 transitions. [2019-11-20 02:38:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 02:38:50,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:38:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:38:51,324 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 02:39:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 250 states and 483 transitions. [2019-11-20 02:39:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 483 transitions. [2019-11-20 02:39:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 02:39:01,896 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:02,087 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 02:39:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 251 states and 483 transitions. [2019-11-20 02:39:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 483 transitions. [2019-11-20 02:39:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 02:39:02,548 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:02,655 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 02:39:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 255 states and 489 transitions. [2019-11-20 02:39:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 489 transitions. [2019-11-20 02:39:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 02:39:03,306 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:03,353 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 02:39:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 258 states and 498 transitions. [2019-11-20 02:39:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 498 transitions. [2019-11-20 02:39:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:05,292 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:05,332 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 02:39:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 264 states and 511 transitions. [2019-11-20 02:39:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 511 transitions. [2019-11-20 02:39:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:09,351 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:09,388 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 02:39:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 265 states and 512 transitions. [2019-11-20 02:39:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 512 transitions. [2019-11-20 02:39:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:09,409 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:09,444 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 02:39:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 267 states and 516 transitions. [2019-11-20 02:39:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 516 transitions. [2019-11-20 02:39:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:12,064 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:12,097 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 02:39:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 268 states and 518 transitions. [2019-11-20 02:39:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 518 transitions. [2019-11-20 02:39:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:13,709 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:13,964 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 02:39:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 255 states and 470 transitions. [2019-11-20 02:39:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 470 transitions. [2019-11-20 02:39:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:16,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:17,107 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 02:39:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 263 states and 488 transitions. [2019-11-20 02:39:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 488 transitions. [2019-11-20 02:39:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:22,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:22,069 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 02:39:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 265 states and 491 transitions. [2019-11-20 02:39:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 491 transitions. [2019-11-20 02:39:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:23,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:23,769 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 02:39:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 269 states and 498 transitions. [2019-11-20 02:39:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 498 transitions. [2019-11-20 02:39:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:25,975 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:26,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 02:39:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 278 states and 518 transitions. [2019-11-20 02:39:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 518 transitions. [2019-11-20 02:39:32,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:32,259 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:32,297 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 02:39:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 282 states and 523 transitions. [2019-11-20 02:39:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 523 transitions. [2019-11-20 02:39:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:34,639 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:34,669 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 02:39:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 284 states and 528 transitions. [2019-11-20 02:39:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 528 transitions. [2019-11-20 02:39:36,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:36,282 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:36,310 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 02:39:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 286 states and 532 transitions. [2019-11-20 02:39:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 532 transitions. [2019-11-20 02:39:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:39:38,472 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:38,985 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 02:39:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 290 states and 542 transitions. [2019-11-20 02:39:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 542 transitions. [2019-11-20 02:39:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:39:43,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:44,264 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 02:39:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 292 states and 545 transitions. [2019-11-20 02:39:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 545 transitions. [2019-11-20 02:39:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:39:48,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:48,684 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 02:39:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 291 states and 539 transitions. [2019-11-20 02:39:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 539 transitions. [2019-11-20 02:39:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:39:51,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:51,684 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 02:39:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:39:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 295 states and 546 transitions. [2019-11-20 02:39:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 546 transitions. [2019-11-20 02:39:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:39:53,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:39:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:39:55,205 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 02:40:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:40:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 308 states and 571 transitions. [2019-11-20 02:40:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 571 transitions. [2019-11-20 02:40:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:40:27,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:40:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:27,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 02:40:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:40:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 305 states and 563 transitions. [2019-11-20 02:40:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 563 transitions. [2019-11-20 02:40:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:40:31,597 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:40:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:31,640 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 02:40:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:40:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 308 states and 568 transitions. [2019-11-20 02:40:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 568 transitions. [2019-11-20 02:40:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:40:34,763 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:40:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:35,993 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 02:41:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:41:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 313 states and 575 transitions. [2019-11-20 02:41:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 575 transitions. [2019-11-20 02:41:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:41:11,010 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:41:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:11,035 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 02:41:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:41:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 313 states and 574 transitions. [2019-11-20 02:41:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 574 transitions. [2019-11-20 02:41:15,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:41:15,354 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:41:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:15,399 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 02:41:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:41:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 317 states and 584 transitions. [2019-11-20 02:41:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 584 transitions. [2019-11-20 02:41:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:41:19,445 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:41:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:20,210 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 02:41:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:41:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 321 states and 596 transitions. [2019-11-20 02:41:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 596 transitions. [2019-11-20 02:41:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:41:26,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:41:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:26,617 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 02:41:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:41:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 322 states and 597 transitions. [2019-11-20 02:41:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 597 transitions. [2019-11-20 02:41:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:41:27,835 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:41:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:27,916 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 02:41:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:41:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 326 states and 602 transitions. [2019-11-20 02:41:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 602 transitions. [2019-11-20 02:41:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:41:31,576 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:41:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:31,617 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 02:41:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:41:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 330 states and 607 transitions. [2019-11-20 02:41:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 607 transitions. [2019-11-20 02:41:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:41:35,606 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:41:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:38,065 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 02:41:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:41:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 343 states and 635 transitions. [2019-11-20 02:41:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 635 transitions. [2019-11-20 02:41:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:41:50,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:41:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:50,580 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 02:41:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:41:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 347 states and 641 transitions. [2019-11-20 02:41:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 641 transitions. [2019-11-20 02:41:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:41:51,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:41:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:51,367 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 02:41:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:41:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 349 states and 643 transitions. [2019-11-20 02:41:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 643 transitions. [2019-11-20 02:41:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:41:52,891 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:41:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:52,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 02:41:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:41:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 351 states and 648 transitions. [2019-11-20 02:41:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 648 transitions. [2019-11-20 02:41:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:41:58,583 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:41:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:58,664 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 02:42:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:42:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 355 states and 654 transitions. [2019-11-20 02:42:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 654 transitions. [2019-11-20 02:42:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:42:01,843 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:42:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:42:03,122 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 02:42:04,090 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-20 02:42:05,777 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-20 02:42:12,832 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-11-20 02:42:13,273 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-20 02:42:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:42:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 364 states and 674 transitions. [2019-11-20 02:42:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 674 transitions. [2019-11-20 02:42:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:42:28,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:42:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:42:28,637 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 02:42:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:42:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 366 states and 677 transitions. [2019-11-20 02:42:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 677 transitions. [2019-11-20 02:42:35,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:42:35,124 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:42:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:42:35,164 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 02:42:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:42:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 370 states and 683 transitions. [2019-11-20 02:42:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 683 transitions. [2019-11-20 02:42:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:42:36,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:42:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:42:36,873 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 02:42:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:42:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 369 states and 679 transitions. [2019-11-20 02:42:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 679 transitions. [2019-11-20 02:42:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:42:42,639 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:42:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:42:42,664 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 02:42:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:42:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 368 states and 674 transitions. [2019-11-20 02:42:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 674 transitions. [2019-11-20 02:42:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:42:48,507 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:42:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:42:48,531 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 02:42:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:42:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 363 states and 665 transitions. [2019-11-20 02:42:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 665 transitions. [2019-11-20 02:42:54,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:42:54,359 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:42:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:42:54,380 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 02:42:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:42:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 363 states and 664 transitions. [2019-11-20 02:42:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 664 transitions. [2019-11-20 02:42:55,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:42:55,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:42:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:42:55,953 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 02:42:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:42:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 367 states and 671 transitions. [2019-11-20 02:42:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 671 transitions. [2019-11-20 02:42:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:42:59,257 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:42:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:42:59,275 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 02:43:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 367 states and 670 transitions. [2019-11-20 02:43:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 670 transitions. [2019-11-20 02:43:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:00,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:00,938 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 02:43:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 371 states and 677 transitions. [2019-11-20 02:43:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 677 transitions. [2019-11-20 02:43:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:04,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:04,327 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 02:43:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 370 states and 675 transitions. [2019-11-20 02:43:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 675 transitions. [2019-11-20 02:43:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:08,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:08,778 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 02:43:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 378 states and 693 transitions. [2019-11-20 02:43:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 693 transitions. [2019-11-20 02:43:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:18,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:18,551 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 02:43:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 377 states and 690 transitions. [2019-11-20 02:43:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 690 transitions. [2019-11-20 02:43:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:21,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:21,247 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 02:43:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 386 states and 705 transitions. [2019-11-20 02:43:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 705 transitions. [2019-11-20 02:43:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:29,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:29,062 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 02:43:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 385 states and 702 transitions. [2019-11-20 02:43:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 702 transitions. [2019-11-20 02:43:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:31,981 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:32,005 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 02:43:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 386 states and 704 transitions. [2019-11-20 02:43:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 704 transitions. [2019-11-20 02:43:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:36,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:36,660 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 02:43:38,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 390 states and 709 transitions. [2019-11-20 02:43:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 709 transitions. [2019-11-20 02:43:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:38,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:38,103 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 02:43:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 364 states and 654 transitions. [2019-11-20 02:43:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 654 transitions. [2019-11-20 02:43:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:45,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:45,453 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 02:43:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 368 states and 660 transitions. [2019-11-20 02:43:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 660 transitions. [2019-11-20 02:43:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:48,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:48,789 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 02:43:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 371 states and 665 transitions. [2019-11-20 02:43:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 665 transitions. [2019-11-20 02:43:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:52,988 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:53,013 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 02:43:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 373 states and 666 transitions. [2019-11-20 02:43:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 666 transitions. [2019-11-20 02:43:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:55,890 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:55,912 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 02:43:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:43:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 375 states and 670 transitions. [2019-11-20 02:43:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 670 transitions. [2019-11-20 02:43:56,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:43:56,624 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:43:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:43:57,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 02:44:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:44:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 392 states and 705 transitions. [2019-11-20 02:44:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 705 transitions. [2019-11-20 02:44:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:44:15,899 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:44:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:44:15,917 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 02:44:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:44:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 394 states and 708 transitions. [2019-11-20 02:44:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 708 transitions. [2019-11-20 02:44:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:44:23,507 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:44:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:44:23,526 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 02:44:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:44:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 396 states and 711 transitions. [2019-11-20 02:44:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 711 transitions. [2019-11-20 02:44:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:44:31,098 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:44:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:44:31,116 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 02:44:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:44:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 403 states and 722 transitions. [2019-11-20 02:44:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 722 transitions. [2019-11-20 02:44:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:44:37,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:44:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:44:37,942 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 02:44:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:44:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 405 states and 725 transitions. [2019-11-20 02:44:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 725 transitions. [2019-11-20 02:44:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:44:41,829 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:44:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:44:41,849 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 02:44:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:44:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 407 states and 728 transitions. [2019-11-20 02:44:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 728 transitions. [2019-11-20 02:44:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 02:44:46,663 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:44:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:44:46,683 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 02:44:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:44:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 416 states and 743 transitions. [2019-11-20 02:44:57,991 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 743 transitions. [2019-11-20 02:44:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:44:57,992 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:44:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:44:58,024 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 02:44:59,483 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-20 02:45:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:45:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 420 states and 750 transitions. [2019-11-20 02:45:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 750 transitions. [2019-11-20 02:45:01,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:45:01,966 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:45:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:45:02,060 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 02:45:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:45:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 420 states and 749 transitions. [2019-11-20 02:45:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 749 transitions. [2019-11-20 02:45:04,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:45:04,069 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:45:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:45:04,108 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 02:45:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:45:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 418 states and 746 transitions. [2019-11-20 02:45:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 746 transitions. [2019-11-20 02:45:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:45:07,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:45:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:45:07,503 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 02:45:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:45:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 412 states and 733 transitions. [2019-11-20 02:45:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 733 transitions. [2019-11-20 02:45:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:45:13,397 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:45:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:45:13,432 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 02:45:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:45:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 394 states and 694 transitions. [2019-11-20 02:45:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 694 transitions. [2019-11-20 02:45:16,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:45:16,972 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:45:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:45:18,737 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 02:45:20,613 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-20 02:45:23,824 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-20 02:45:27,073 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-20 02:45:30,346 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-11-20 02:46:07,046 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-20 02:46:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:46:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 402 states and 707 transitions. [2019-11-20 02:46:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 707 transitions. [2019-11-20 02:46:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:46:18,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:46:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:46:18,455 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 02:46:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 02:46:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 405 states and 712 transitions. [2019-11-20 02:46:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 712 transitions. [2019-11-20 02:46:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:46:23,428 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 02:46:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:46:24,011 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 85 iterations. [2019-11-20 02:46:24,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 02:46:24 ImpRootNode [2019-11-20 02:46:24,200 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 02:46:24,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:46:24,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:46:24,201 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:46:24,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:38:29" (3/4) ... [2019-11-20 02:46:24,203 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 02:46:24,373 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a9bf6a6f-67a1-4d6c-80a9-0f1c97e2a837/bin/ukojak/witness.graphml [2019-11-20 02:46:24,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:46:24,375 INFO L168 Benchmark]: Toolchain (without parser) took 477810.11 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 944.7 MB in the beginning and 1.7 GB in the end (delta: -759.5 MB). Peak memory consumption was 892.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:46:24,375 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:46:24,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:46:24,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.40 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 02:46:24,376 INFO L168 Benchmark]: Boogie Preprocessor took 71.50 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 02:46:24,376 INFO L168 Benchmark]: RCFGBuilder took 2284.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 856.5 MB in the end (delta: 217.6 MB). Peak memory consumption was 217.6 MB. Max. memory is 11.5 GB. [2019-11-20 02:46:24,377 INFO L168 Benchmark]: CodeCheck took 474552.11 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 856.5 MB in the beginning and 1.8 GB in the end (delta: -893.9 MB). Peak memory consumption was 655.9 MB. Max. memory is 11.5 GB. [2019-11-20 02:46:24,377 INFO L168 Benchmark]: Witness Printer took 173.29 ms. Allocated memory is still 2.7 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:46:24,379 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, 173 locations, 1 error locations. Result: UNSAFE, OverallTime: 474.3s, OverallIterations: 85, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -1434147096 SDtfs, -2138347540 SDslu, 240542608 SDs, 0 SdLazy, 1924746096 SolverSat, 68210704 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 126.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56704 GetRequests, 54479 SyntacticMatches, 827 SemanticMatches, 1398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011991 ImplicationChecksByTransitivity, 463.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 7069 NumberOfCodeBlocks, 7069 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 6897 ConstructedInterpolants, 0 QuantifiedInterpolants, 2506830 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 84 InterpolantComputations, 84 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: 572]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L16] port_t p13 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L20] port_t p21 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L24] port_t p23 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L28] port_t p31 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 0; [L32] port_t p32 = 0; [L33] char p32_old = '\x0'; [L34] char p32_new = '\x0'; [L35] _Bool ep32 = 0; [L36] char id1 = '\x0'; [L37] char r1 = '\x0'; [L38] char st1 = '\x0'; [L39] char nl1 = '\x0'; [L40] char m1 = '\x0'; [L41] char max1 = '\x0'; [L42] _Bool mode1 = 0; [L43] _Bool newmax1 = 0; [L44] char id2 = '\x0'; [L45] char r2 = '\x0'; [L46] char st2 = '\x0'; [L47] char nl2 = '\x0'; [L48] char m2 = '\x0'; [L49] char max2 = '\x0'; [L50] _Bool mode2 = 0; [L51] _Bool newmax2 = 0; [L52] char id3 = '\x0'; [L53] char r3 = '\x0'; [L54] char st3 = '\x0'; [L55] char nl3 = '\x0'; [L56] char m3 = '\x0'; [L57] char max3 = '\x0'; [L58] _Bool mode3 = 0; [L59] _Bool newmax3 = 0; [L63] void (*nodes[3])() = { &node1, &node2, &node3 }; [L67] int __return_1237; [L68] int __return_1383; [L69] int __return_1517; [L70] int __tmp_1518_0; [L71] int __return_1641; [L72] int __return_1531; [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_char() [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_char() [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_char() [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 TRUE !(init__r121 == 0) [L136] init__tmp = 1 [L138] init__r122 = (_Bool)init__tmp [L139] COND FALSE !(!(init__r131 == 0)) [L1741] COND TRUE !(init__r121 == 0) [L1743] COND TRUE !(ep23 == 0) [L1745] init__tmp___0 = 1 [L143] init__r132 = (_Bool)init__tmp___0 [L144] COND FALSE !(!(init__r211 == 0)) [L1718] COND TRUE !(init__r231 == 0) [L1720] COND TRUE !(ep31 == 0) [L1722] init__tmp___1 = 1 [L148] init__r212 = (_Bool)init__tmp___1 [L149] COND TRUE !(init__r231 == 0) [L151] init__tmp___2 = 1 [L153] init__r232 = (_Bool)init__tmp___2 [L154] COND TRUE !(init__r311 == 0) [L156] init__tmp___3 = 1 [L158] init__r312 = (_Bool)init__tmp___3 [L159] COND FALSE !(!(init__r321 == 0)) [L1649] COND TRUE !(init__r311 == 0) [L1651] COND TRUE !(ep12 == 0) [L1653] init__tmp___4 = 1 [L163] init__r322 = (_Bool)init__tmp___4 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L164] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L166] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L170] COND TRUE ((int)id1) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)id2) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)id3) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L176] COND TRUE ((int)r1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)r2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)r3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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_1237 = init__tmp___5 [L226] main__i2 = __return_1237 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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] [L242] COND TRUE main__i2 < 6 [L245] _Bool node1__newmax; [L246] node1__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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] [L247] COND FALSE !(!(mode1 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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 TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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] [L255] COND TRUE !(ep12 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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] [L257] COND TRUE !(newmax1 == 0) [L259] int node1____CPAchecker_TMP_0; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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] [L260] COND TRUE max1 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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] [L262] COND TRUE p12_new == nomsg [L264] node1____CPAchecker_TMP_0 = max1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, 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 FALSE !(!(ep13 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, 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] [L281] mode1 = 1 [L283] _Bool node2__newmax; [L284] node2__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, 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] [L285] COND FALSE !(!(mode2 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, 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 ((int)r2) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, 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 FALSE !(!(ep21 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, 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] [L306] COND TRUE !(ep23 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, 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] [L308] COND TRUE !(newmax2 == 0) [L310] int node2____CPAchecker_TMP_1; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, 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] [L311] COND TRUE max2 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, 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] [L313] COND TRUE p23_new == nomsg [L315] node2____CPAchecker_TMP_1 = max2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, 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] [L317] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L319] mode2 = 1 [L321] _Bool node3__newmax; [L322] node3__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L323] COND FALSE !(!(mode3 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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 TRUE ((int)r3) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L331] COND TRUE !(ep31 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L333] COND TRUE !(newmax3 == 0) [L335] int node3____CPAchecker_TMP_0; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L336] COND TRUE max3 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L338] COND TRUE p31_new == nomsg [L340] node3____CPAchecker_TMP_0 = max3 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=15, 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 FALSE !(!(ep32 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=126, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=15, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] mode3 = 1 [L358] p12_old = p12_new [L359] p12_new = nomsg [L360] p13_old = p13_new [L361] p13_new = nomsg [L362] p21_old = p21_new [L363] p21_new = nomsg [L364] p23_old = p23_new [L365] p23_new = nomsg [L366] p31_old = p31_new [L367] p31_new = nomsg [L368] p32_old = p32_new [L369] p32_new = nomsg [L371] int check__tmp; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L372] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L374] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L376] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L378] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L380] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L390] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L396] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L398] COND TRUE ((int)r1) < 2 [L400] check__tmp = 1 [L401] __return_1383 = check__tmp [L402] main__c1 = __return_1383 [L404] _Bool __tmp_1; [L405] __tmp_1 = main__c1 [L406] _Bool assert__arg; [L407] assert__arg = __tmp_1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L408] COND FALSE !(assert__arg == 0) [L414] int main____CPAchecker_TMP_0 = main__i2; [L415] main__i2 = main__i2 + 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND TRUE main__i2 < 6 [L419] _Bool node1__newmax; [L420] node1__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=-128, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=15, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L421] COND TRUE !(mode1 == 0) [L423] r1 = (char)(((int)r1) + 1) [L424] COND FALSE !(!(ep21 == 0)) [L433] COND TRUE !(ep31 == 0) [L435] m1 = p31_old [L436] p31_old = nomsg [L437] COND FALSE !(((int)m1) > ((int)max1)) [L442] newmax1 = node1__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int)r1) == 1 [L445] COND TRUE ((int)max1) == ((int)id1) [L447] st1 = 1 [L449] mode1 = 0 [L451] _Bool node2__newmax; [L452] node2__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=-128, m3=16, max1=126, max2=127, max3=15, 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=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L453] COND TRUE !(mode2 == 0) [L455] r2 = (char)(((int)r2) + 1) [L456] COND TRUE !(ep12 == 0) [L458] m2 = p12_old [L459] p12_old = nomsg [L460] COND FALSE !(((int)m2) > ((int)max2)) [L465] COND FALSE !(!(ep32 == 0)) [L474] newmax2 = node2__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=16, max1=126, max2=127, max3=15, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=127, 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] [L475] COND FALSE !(((int)r2) == 2) [L481] mode2 = 0 [L483] _Bool node3__newmax; [L484] node3__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=16, max1=126, max2=127, max3=15, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, 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=127, 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] [L485] COND TRUE !(mode3 == 0) [L487] r3 = (char)(((int)r3) + 1) [L488] COND FALSE !(!(ep13 == 0)) [L497] COND TRUE !(ep23 == 0) [L499] m3 = p23_old [L500] p23_old = nomsg [L501] COND TRUE ((int)m3) > ((int)max3) [L503] max3 = m3 [L504] node3__newmax = 1 [L506] newmax3 = node3__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, 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=1, st1=1, st2=0, st3=0] [L507] COND FALSE !(((int)r3) == 2) [L513] mode3 = 0 [L514] p12_old = p12_new [L515] p12_new = nomsg [L516] p13_old = p13_new [L517] p13_new = nomsg [L518] p21_old = p21_new [L519] p21_new = nomsg [L520] p23_old = p23_new [L521] p23_new = nomsg [L522] p31_old = p31_new [L523] p31_new = nomsg [L524] p32_old = p32_new [L525] p32_new = nomsg [L527] int check__tmp; VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, st1=1, st2=0, st3=0] [L528] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, st1=1, st2=0, st3=0] [L530] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, st1=1, st2=0, st3=0] [L532] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, st1=1, st2=0, st3=0] [L534] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, st1=1, st2=0, st3=0] [L536] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, st1=1, st2=0, st3=0] [L542] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1167] check__tmp = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, st1=1, st2=0, st3=0] [L560] __return_1517 = check__tmp [L561] main__c1 = __return_1517 [L562] __tmp_1518_0 = main____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, st1=1, st2=0, st3=0] [L564] main____CPAchecker_TMP_0 = __tmp_1518_0 [L566] _Bool __tmp_2; [L567] __tmp_2 = main__c1 [L568] _Bool assert__arg; [L569] assert__arg = __tmp_2 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, st1=1, st2=0, st3=0] [L570] COND TRUE assert__arg == 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, st1=1, st2=0, st3=0] [L572] __VERIFIER_error() VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=127, id3=15, m1=15, m2=126, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, st1=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 641.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.40 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 71.50 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 2284.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 856.5 MB in the end (delta: 217.6 MB). Peak memory consumption was 217.6 MB. Max. memory is 11.5 GB. * CodeCheck took 474552.11 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 856.5 MB in the beginning and 1.8 GB in the end (delta: -893.9 MB). Peak memory consumption was 655.9 MB. Max. memory is 11.5 GB. * Witness Printer took 173.29 ms. Allocated memory is still 2.7 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...