./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.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_85ace3af-fd92-4cec-af04-0f6629a70e9b/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/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 5d95b8e7a8fedd65e6b8b86c7096e4359b05d81c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:44:17,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:44:17,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:44:17,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:44:17,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:44:17,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:44:17,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:44:17,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:44:17,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:44:17,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:44:17,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:44:17,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:44:17,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:44:17,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:44:17,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:44:17,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:44:17,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:44:17,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:44:17,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:44:17,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:44:17,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:44:17,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:44:17,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:44:17,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:44:17,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:44:17,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:44:17,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:44:17,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:44:17,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:44:17,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:44:17,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:44:17,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:44:17,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:44:17,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:44:17,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:44:17,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:44:17,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:44:17,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:44:17,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:44:17,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:44:17,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:44:17,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 00:44:17,287 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:44:17,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:44:17,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 00:44:17,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 00:44:17,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:44:17,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:44:17,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:44:17,299 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:44:17,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:44:17,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:44:17,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:44:17,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:44:17,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:44:17,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:44:17,300 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:44:17,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:44:17,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:44:17,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:44:17,302 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 00:44:17,302 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 00:44:17,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:44:17,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:44:17,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 00:44:17,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:44:17,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:44:17,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:44:17,304 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 00:44:17,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:44:17,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:44:17,305 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_85ace3af-fd92-4cec-af04-0f6629a70e9b/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 -> 5d95b8e7a8fedd65e6b8b86c7096e4359b05d81c [2019-11-20 00:44:17,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:44:17,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:44:17,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:44:17,454 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:44:17,454 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:44:17,455 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-20 00:44:17,504 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/bin/ukojak/data/ec0d753a8/26f1a2bfeaa447c286221bd0a0f2da10/FLAG355cbcc35 [2019-11-20 00:44:17,956 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:44:17,957 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-20 00:44:17,970 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/bin/ukojak/data/ec0d753a8/26f1a2bfeaa447c286221bd0a0f2da10/FLAG355cbcc35 [2019-11-20 00:44:17,981 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/bin/ukojak/data/ec0d753a8/26f1a2bfeaa447c286221bd0a0f2da10 [2019-11-20 00:44:17,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:44:17,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:44:17,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:44:17,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:44:17,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:44:17,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:44:17" (1/1) ... [2019-11-20 00:44:17,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca82aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:17, skipping insertion in model container [2019-11-20 00:44:17,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:44:17" (1/1) ... [2019-11-20 00:44:18,000 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:44:18,060 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:44:18,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:44:18,621 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:44:18,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:44:18,810 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:44:18,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:18 WrapperNode [2019-11-20 00:44:18,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:44:18,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:44:18,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:44:18,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:44:18,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:18" (1/1) ... [2019-11-20 00:44:18,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:18" (1/1) ... [2019-11-20 00:44:18,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:44:18,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:44:18,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:44:18,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:44:18,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:18" (1/1) ... [2019-11-20 00:44:18,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:18" (1/1) ... [2019-11-20 00:44:18,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:18" (1/1) ... [2019-11-20 00:44:18,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:18" (1/1) ... [2019-11-20 00:44:18,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:18" (1/1) ... [2019-11-20 00:44:18,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:18" (1/1) ... [2019-11-20 00:44:18,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:18" (1/1) ... [2019-11-20 00:44:18,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:44:18,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:44:18,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:44:18,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:44:18,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/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 00:44:19,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:44:19,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:44:21,516 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:44:21,517 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 00:44:21,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:44:21 BoogieIcfgContainer [2019-11-20 00:44:21,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:44:21,523 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 00:44:21,523 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 00:44:21,533 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 00:44:21,535 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:44:21" (1/1) ... [2019-11-20 00:44:21,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 236 states and 418 transitions. [2019-11-20 00:44:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 418 transitions. [2019-11-20 00:44:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 00:44:21,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:22,530 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 00:44:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 242 states and 431 transitions. [2019-11-20 00:44:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 431 transitions. [2019-11-20 00:44:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 00:44:22,698 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:22,801 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 00:44:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 244 states and 434 transitions. [2019-11-20 00:44:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 434 transitions. [2019-11-20 00:44:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 00:44:22,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:23,125 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 00:44:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 251 states and 449 transitions. [2019-11-20 00:44:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 449 transitions. [2019-11-20 00:44:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 00:44:23,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:23,545 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 00:44:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 252 states and 450 transitions. [2019-11-20 00:44:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 450 transitions. [2019-11-20 00:44:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 00:44:23,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:23,644 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 00:44:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 252 states and 448 transitions. [2019-11-20 00:44:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 448 transitions. [2019-11-20 00:44:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:44:23,667 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:24,192 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 00:44:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 266 states and 479 transitions. [2019-11-20 00:44:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 479 transitions. [2019-11-20 00:44:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:44:25,965 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:26,239 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 00:44:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 269 states and 485 transitions. [2019-11-20 00:44:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 485 transitions. [2019-11-20 00:44:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:44:29,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:29,424 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 00:44:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 313 states and 576 transitions. [2019-11-20 00:44:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 576 transitions. [2019-11-20 00:44:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:44:29,813 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:29,950 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 00:44:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 311 states and 571 transitions. [2019-11-20 00:44:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 571 transitions. [2019-11-20 00:44:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:44:29,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:30,184 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 00:44:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 354 states and 660 transitions. [2019-11-20 00:44:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 660 transitions. [2019-11-20 00:44:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:44:31,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:31,374 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 00:44:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 353 states and 655 transitions. [2019-11-20 00:44:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 655 transitions. [2019-11-20 00:44:31,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:44:31,398 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:31,721 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 00:44:32,181 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-20 00:44:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 354 states and 656 transitions. [2019-11-20 00:44:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 656 transitions. [2019-11-20 00:44:33,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:44:33,260 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:33,329 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 00:44:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 354 states and 655 transitions. [2019-11-20 00:44:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 655 transitions. [2019-11-20 00:44:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:44:34,174 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:34,222 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 00:44:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 358 states and 662 transitions. [2019-11-20 00:44:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 662 transitions. [2019-11-20 00:44:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:44:35,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:35,533 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 00:44:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 373 states and 695 transitions. [2019-11-20 00:44:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 695 transitions. [2019-11-20 00:44:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:44:38,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:38,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 00:44:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 377 states and 703 transitions. [2019-11-20 00:44:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 703 transitions. [2019-11-20 00:44:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:44:38,993 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:39,188 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 00:44:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 381 states and 709 transitions. [2019-11-20 00:44:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 709 transitions. [2019-11-20 00:44:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:44:41,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:41,305 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 00:44:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 427 states and 801 transitions. [2019-11-20 00:44:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 801 transitions. [2019-11-20 00:44:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:44:42,428 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:42,471 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 00:44:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 436 states and 821 transitions. [2019-11-20 00:44:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 821 transitions. [2019-11-20 00:44:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:44:44,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:44,703 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 00:44:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 444 states and 841 transitions. [2019-11-20 00:44:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 841 transitions. [2019-11-20 00:44:54,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:44:54,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:54,935 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 00:45:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 453 states and 862 transitions. [2019-11-20 00:45:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 862 transitions. [2019-11-20 00:45:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:45:01,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:01,422 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 00:45:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 454 states and 865 transitions. [2019-11-20 00:45:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 865 transitions. [2019-11-20 00:45:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:45:02,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:02,242 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 00:45:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 455 states and 865 transitions. [2019-11-20 00:45:02,656 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 865 transitions. [2019-11-20 00:45:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:45:02,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:02,817 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 00:45:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 459 states and 871 transitions. [2019-11-20 00:45:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 871 transitions. [2019-11-20 00:45:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:45:03,153 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:03,190 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 00:45:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 460 states and 872 transitions. [2019-11-20 00:45:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 872 transitions. [2019-11-20 00:45:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:45:03,597 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:03,636 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 00:45:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 464 states and 883 transitions. [2019-11-20 00:45:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 883 transitions. [2019-11-20 00:45:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:45:05,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:05,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 00:45:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 465 states and 886 transitions. [2019-11-20 00:45:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 886 transitions. [2019-11-20 00:45:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:45:06,086 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:06,150 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 00:45:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 467 states and 888 transitions. [2019-11-20 00:45:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 888 transitions. [2019-11-20 00:45:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:45:06,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:06,855 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 00:45:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 468 states and 889 transitions. [2019-11-20 00:45:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 889 transitions. [2019-11-20 00:45:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:45:07,261 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:07,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 00:45:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 469 states and 890 transitions. [2019-11-20 00:45:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 890 transitions. [2019-11-20 00:45:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:45:08,146 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:08,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 00:45:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 459 states and 857 transitions. [2019-11-20 00:45:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 857 transitions. [2019-11-20 00:45:11,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 00:45:11,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:11,588 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 00:45:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 468 states and 874 transitions. [2019-11-20 00:45:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 874 transitions. [2019-11-20 00:45:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 00:45:16,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:16,691 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 00:45:21,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 476 states and 892 transitions. [2019-11-20 00:45:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 892 transitions. [2019-11-20 00:45:21,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 00:45:21,144 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:21,202 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 00:45:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 520 states and 984 transitions. [2019-11-20 00:45:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 984 transitions. [2019-11-20 00:45:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 00:45:22,650 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:22,708 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 00:45:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 518 states and 977 transitions. [2019-11-20 00:45:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 977 transitions. [2019-11-20 00:45:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 00:45:22,763 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:23,057 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 00:45:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 518 states and 976 transitions. [2019-11-20 00:45:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 976 transitions. [2019-11-20 00:45:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 00:45:27,488 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:27,694 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 00:45:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 514 states and 966 transitions. [2019-11-20 00:45:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 966 transitions. [2019-11-20 00:45:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:45:30,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:30,434 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 00:45:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 518 states and 972 transitions. [2019-11-20 00:45:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 972 transitions. [2019-11-20 00:45:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:45:33,935 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:33,989 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 00:45:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 527 states and 987 transitions. [2019-11-20 00:45:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 987 transitions. [2019-11-20 00:45:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:45:36,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:37,120 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 00:45:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 543 states and 1022 transitions. [2019-11-20 00:45:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1022 transitions. [2019-11-20 00:45:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:45:59,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:59,724 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 00:45:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 544 states and 1022 transitions. [2019-11-20 00:45:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1022 transitions. [2019-11-20 00:45:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:45:59,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:59,861 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 00:46:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 552 states and 1035 transitions. [2019-11-20 00:46:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1035 transitions. [2019-11-20 00:46:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:46:01,740 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:02,620 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 00:46:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 561 states and 1051 transitions. [2019-11-20 00:46:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1051 transitions. [2019-11-20 00:46:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:46:28,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:30,041 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 00:46:30,455 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-11-20 00:46:31,301 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-20 00:46:33,135 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-11-20 00:46:33,545 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-20 00:46:35,343 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2019-11-20 00:46:35,762 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-20 00:46:37,652 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-11-20 00:46:38,055 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-11-20 00:47:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 580 states and 1099 transitions. [2019-11-20 00:47:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1099 transitions. [2019-11-20 00:47:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:13,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 590 states and 1116 transitions. [2019-11-20 00:47:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1116 transitions. [2019-11-20 00:47:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:18,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:18,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 00:47:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 590 states and 1115 transitions. [2019-11-20 00:47:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1115 transitions. [2019-11-20 00:47:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:18,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:18,842 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 00:47:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 596 states and 1124 transitions. [2019-11-20 00:47:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1124 transitions. [2019-11-20 00:47:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:21,663 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:21,713 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 00:47:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 635 states and 1204 transitions. [2019-11-20 00:47:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1204 transitions. [2019-11-20 00:47:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:21,787 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:21,823 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 00:47:23,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 638 states and 1210 transitions. [2019-11-20 00:47:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1210 transitions. [2019-11-20 00:47:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:23,004 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:23,045 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 00:47:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 645 states and 1219 transitions. [2019-11-20 00:47:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1219 transitions. [2019-11-20 00:47:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:24,927 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:24,962 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 00:47:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 643 states and 1214 transitions. [2019-11-20 00:47:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1214 transitions. [2019-11-20 00:47:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:25,593 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:26,028 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 00:47:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 647 states and 1219 transitions. [2019-11-20 00:47:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1219 transitions. [2019-11-20 00:47:29,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:29,848 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:29,894 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 00:47:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:29,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 648 states and 1219 transitions. [2019-11-20 00:47:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1219 transitions. [2019-11-20 00:47:29,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:29,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:29,945 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 00:47:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 654 states and 1227 transitions. [2019-11-20 00:47:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1227 transitions. [2019-11-20 00:47:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:34,914 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:34,955 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 00:47:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 655 states and 1228 transitions. [2019-11-20 00:47:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1228 transitions. [2019-11-20 00:47:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:34,973 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 656 states and 1229 transitions. [2019-11-20 00:47:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1229 transitions. [2019-11-20 00:47:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:36,259 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:36,285 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 00:47:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 661 states and 1238 transitions. [2019-11-20 00:47:36,309 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1238 transitions. [2019-11-20 00:47:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:36,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:36,363 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 00:47:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 658 states and 1233 transitions. [2019-11-20 00:47:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1233 transitions. [2019-11-20 00:47:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:41,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:41,498 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 00:47:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 655 states and 1228 transitions. [2019-11-20 00:47:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1228 transitions. [2019-11-20 00:47:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:46,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:46,678 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 00:47:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 652 states and 1220 transitions. [2019-11-20 00:47:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1220 transitions. [2019-11-20 00:47:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:51,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:51,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 00:47:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 651 states and 1218 transitions. [2019-11-20 00:47:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1218 transitions. [2019-11-20 00:47:55,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:55,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:55,625 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 00:47:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 650 states and 1214 transitions. [2019-11-20 00:47:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1214 transitions. [2019-11-20 00:47:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:47:59,955 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:59,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 00:48:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 607 states and 1122 transitions. [2019-11-20 00:48:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1122 transitions. [2019-11-20 00:48:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:48:02,896 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:02,933 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 00:48:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 607 states and 1121 transitions. [2019-11-20 00:48:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1121 transitions. [2019-11-20 00:48:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 00:48:04,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:04,628 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 00:48:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 611 states and 1126 transitions. [2019-11-20 00:48:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1126 transitions. [2019-11-20 00:48:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 00:48:11,773 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:11,802 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 00:48:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 615 states and 1131 transitions. [2019-11-20 00:48:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1131 transitions. [2019-11-20 00:48:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 00:48:19,025 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:19,049 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 00:48:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 622 states and 1142 transitions. [2019-11-20 00:48:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1142 transitions. [2019-11-20 00:48:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 00:48:23,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:25,488 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 00:48:29,462 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-20 00:49:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:49:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 641 states and 1179 transitions. [2019-11-20 00:49:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1179 transitions. [2019-11-20 00:49:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 00:49:16,852 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:49:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:16,907 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 00:49:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:49:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 650 states and 1194 transitions. [2019-11-20 00:49:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1194 transitions. [2019-11-20 00:49:24,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 00:49:24,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:49:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:25,074 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 00:49:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:49:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 664 states and 1217 transitions. [2019-11-20 00:49:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1217 transitions. [2019-11-20 00:49:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 00:49:36,787 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:49:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:36,899 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 00:49:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:49:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 672 states and 1227 transitions. [2019-11-20 00:49:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1227 transitions. [2019-11-20 00:49:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 00:49:46,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:49:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:46,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 00:49:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:49:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 673 states and 1227 transitions. [2019-11-20 00:49:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1227 transitions. [2019-11-20 00:49:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 00:49:47,946 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:49:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:47,969 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 00:49:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:49:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 670 states and 1218 transitions. [2019-11-20 00:49:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1218 transitions. [2019-11-20 00:49:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 00:49:57,210 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:49:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:57,231 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 00:50:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 667 states and 1210 transitions. [2019-11-20 00:50:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1210 transitions. [2019-11-20 00:50:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 00:50:03,046 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:03,068 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 00:50:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 667 states and 1209 transitions. [2019-11-20 00:50:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1209 transitions. [2019-11-20 00:50:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 00:50:05,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:05,982 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 00:50:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 684 states and 1239 transitions. [2019-11-20 00:50:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1239 transitions. [2019-11-20 00:50:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 00:50:23,018 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:23,067 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 00:50:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 688 states and 1245 transitions. [2019-11-20 00:50:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1245 transitions. [2019-11-20 00:50:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 00:50:24,035 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:24,081 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 00:50:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 689 states and 1245 transitions. [2019-11-20 00:50:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1245 transitions. [2019-11-20 00:50:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 00:50:24,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:24,976 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 00:50:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 693 states and 1252 transitions. [2019-11-20 00:50:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1252 transitions. [2019-11-20 00:50:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 00:50:32,784 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:32,833 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 00:50:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 697 states and 1257 transitions. [2019-11-20 00:50:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1257 transitions. [2019-11-20 00:50:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:50:36,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:36,296 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 00:50:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 699 states and 1261 transitions. [2019-11-20 00:50:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1261 transitions. [2019-11-20 00:50:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:50:37,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:37,230 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 00:50:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 744 states and 1353 transitions. [2019-11-20 00:50:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1353 transitions. [2019-11-20 00:50:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:50:46,069 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:46,112 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 00:50:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 782 states and 1428 transitions. [2019-11-20 00:50:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1428 transitions. [2019-11-20 00:50:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:50:54,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:54,680 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 00:50:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 780 states and 1422 transitions. [2019-11-20 00:50:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1422 transitions. [2019-11-20 00:50:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:50:54,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:54,786 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 00:50:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 778 states and 1416 transitions. [2019-11-20 00:50:54,813 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1416 transitions. [2019-11-20 00:50:54,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:50:54,814 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:50:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:50:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 782 states and 1421 transitions. [2019-11-20 00:50:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1421 transitions. [2019-11-20 00:50:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:50:58,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:50:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:58,760 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 00:51:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:51:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 804 states and 1457 transitions. [2019-11-20 00:51:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1457 transitions. [2019-11-20 00:51:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:51:23,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:51:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:23,878 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 00:51:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:51:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 801 states and 1452 transitions. [2019-11-20 00:51:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1452 transitions. [2019-11-20 00:51:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:51:31,275 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:51:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:31,325 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 00:51:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:51:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 792 states and 1431 transitions. [2019-11-20 00:51:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1431 transitions. [2019-11-20 00:51:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:51:45,758 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:51:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:45,790 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 00:51:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:51:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 792 states and 1428 transitions. [2019-11-20 00:51:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1428 transitions. [2019-11-20 00:51:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:51:48,367 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:51:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:51:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:51:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 790 states and 1422 transitions. [2019-11-20 00:51:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1422 transitions. [2019-11-20 00:51:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:51:55,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:51:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:55,538 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 00:51:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:51:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 785 states and 1410 transitions. [2019-11-20 00:51:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1410 transitions. [2019-11-20 00:51:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:51:59,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:51:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:59,880 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 00:52:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:52:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 782 states and 1406 transitions. [2019-11-20 00:52:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1406 transitions. [2019-11-20 00:52:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:52:05,256 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:52:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:05,296 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 00:52:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:52:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 757 states and 1350 transitions. [2019-11-20 00:52:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1350 transitions. [2019-11-20 00:52:09,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:52:09,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:52:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:10,248 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 00:52:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:52:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 750 states and 1340 transitions. [2019-11-20 00:52:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1340 transitions. [2019-11-20 00:52:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:52:17,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:52:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:18,635 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 00:52:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:52:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 754 states and 1345 transitions. [2019-11-20 00:52:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1345 transitions. [2019-11-20 00:52:29,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:52:29,005 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:52:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:29,044 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 00:52:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:52:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 758 states and 1351 transitions. [2019-11-20 00:52:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1351 transitions. [2019-11-20 00:52:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:52:30,052 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:52:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:30,096 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 00:52:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:52:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 766 states and 1366 transitions. [2019-11-20 00:52:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1366 transitions. [2019-11-20 00:52:39,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:52:39,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:52:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:52:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:52:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 774 states and 1378 transitions. [2019-11-20 00:52:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1378 transitions. [2019-11-20 00:52:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:52:45,124 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:52:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:45,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 00:52:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:52:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 791 states and 1406 transitions. [2019-11-20 00:52:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1406 transitions. [2019-11-20 00:52:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:52:56,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:52:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:56,970 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 00:52:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:52:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 792 states and 1406 transitions. [2019-11-20 00:52:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1406 transitions. [2019-11-20 00:52:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:52:57,008 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:52:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:52:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:52:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:52:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:52:57,769 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 102 iterations. [2019-11-20 00:52:58,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 12:52:58 ImpRootNode [2019-11-20 00:52:58,068 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 00:52:58,068 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:52:58,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:52:58,068 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:52:58,069 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:44:21" (3/4) ... [2019-11-20 00:52:58,071 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 00:52:58,338 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_85ace3af-fd92-4cec-af04-0f6629a70e9b/bin/ukojak/witness.graphml [2019-11-20 00:52:58,339 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:52:58,340 INFO L168 Benchmark]: Toolchain (without parser) took 520355.36 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 939.3 MB in the beginning and 1.8 GB in the end (delta: -886.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-20 00:52:58,340 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:52:58,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-20 00:52:58,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:52:58,341 INFO L168 Benchmark]: Boogie Preprocessor took 50.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:52:58,342 INFO L168 Benchmark]: RCFGBuilder took 2557.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.8 MB). Peak memory consumption was 244.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:52:58,342 INFO L168 Benchmark]: CodeCheck took 516545.00 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -788.2 MB). Peak memory consumption was 975.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:52:58,342 INFO L168 Benchmark]: Witness Printer took 270.89 ms. Allocated memory is still 2.9 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:52:58,344 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, 236 locations, 1 error locations. Result: UNSAFE, OverallTime: 516.2s, OverallIterations: 102, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1255604360 SDtfs, 2080447310 SDslu, -873833182 SDs, 0 SdLazy, 800523780 SolverSat, -1918795752 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 165.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97342 GetRequests, 94917 SyntacticMatches, 993 SemanticMatches, 1432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098640 ImplicationChecksByTransitivity, 502.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 12401 NumberOfCodeBlocks, 12401 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 12173 ConstructedInterpolants, 0 QuantifiedInterpolants, 5073620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 101 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: 878]: 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_1858; [L68] int __return_2004; [L69] int __return_2137; [L70] int __return_2256; [L71] int __return_2394; [L72] int __tmp_2395_0; [L73] int __return_2518; [L74] int __return_2408; [L77] int main__c1; [L78] int main__i2; [L79] main__c1 = 0 [L80] ep12 = __VERIFIER_nondet_bool() [L81] ep13 = __VERIFIER_nondet_bool() [L82] ep21 = __VERIFIER_nondet_bool() [L83] ep23 = __VERIFIER_nondet_bool() [L84] ep31 = __VERIFIER_nondet_bool() [L85] ep32 = __VERIFIER_nondet_bool() [L86] id1 = __VERIFIER_nondet_char() [L87] r1 = __VERIFIER_nondet_char() [L88] st1 = __VERIFIER_nondet_char() [L89] nl1 = __VERIFIER_nondet_char() [L90] m1 = __VERIFIER_nondet_char() [L91] max1 = __VERIFIER_nondet_char() [L92] mode1 = __VERIFIER_nondet_bool() [L93] newmax1 = __VERIFIER_nondet_bool() [L94] id2 = __VERIFIER_nondet_char() [L95] r2 = __VERIFIER_nondet_char() [L96] st2 = __VERIFIER_nondet_char() [L97] nl2 = __VERIFIER_nondet_char() [L98] m2 = __VERIFIER_nondet_char() [L99] max2 = __VERIFIER_nondet_char() [L100] mode2 = __VERIFIER_nondet_bool() [L101] newmax2 = __VERIFIER_nondet_bool() [L102] id3 = __VERIFIER_nondet_char() [L103] r3 = __VERIFIER_nondet_char() [L104] st3 = __VERIFIER_nondet_char() [L105] nl3 = __VERIFIER_nondet_char() [L106] m3 = __VERIFIER_nondet_char() [L107] max3 = __VERIFIER_nondet_char() [L108] mode3 = __VERIFIER_nondet_bool() [L109] newmax3 = __VERIFIER_nondet_bool() [L111] _Bool init__r121; [L112] _Bool init__r131; [L113] _Bool init__r211; [L114] _Bool init__r231; [L115] _Bool init__r311; [L116] _Bool init__r321; [L117] _Bool init__r122; [L118] int init__tmp; [L119] _Bool init__r132; [L120] int init__tmp___0; [L121] _Bool init__r212; [L122] int init__tmp___1; [L123] _Bool init__r232; [L124] int init__tmp___2; [L125] _Bool init__r312; [L126] int init__tmp___3; [L127] _Bool init__r322; [L128] int init__tmp___4; [L129] int init__tmp___5; [L130] init__r121 = ep12 [L131] init__r131 = ep13 [L132] init__r211 = ep21 [L133] init__r231 = ep23 [L134] init__r311 = ep31 [L135] init__r321 = ep32 [L136] COND FALSE !(!(init__r121 == 0)) [L2402] COND TRUE !(init__r131 == 0) [L2404] COND TRUE !(ep32 == 0) [L2406] init__tmp = 1 [L140] init__r122 = (_Bool)init__tmp [L141] COND TRUE !(init__r131 == 0) [L143] init__tmp___0 = 1 [L145] init__r132 = (_Bool)init__tmp___0 [L146] COND TRUE !(init__r211 == 0) [L148] init__tmp___1 = 1 [L150] init__r212 = (_Bool)init__tmp___1 [L151] COND FALSE !(!(init__r231 == 0)) [L2333] COND TRUE !(init__r211 == 0) [L2335] COND TRUE !(ep13 == 0) [L2337] init__tmp___2 = 1 [L155] init__r232 = (_Bool)init__tmp___2 [L156] COND FALSE !(!(init__r311 == 0)) [L2310] COND TRUE !(init__r321 == 0) [L2312] COND TRUE !(ep21 == 0) [L2314] init__tmp___3 = 1 [L160] init__r312 = (_Bool)init__tmp___3 [L161] COND TRUE !(init__r321 == 0) [L163] init__tmp___4 = 1 [L165] init__r322 = (_Bool)init__tmp___4 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L166] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L168] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L170] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L172] COND TRUE ((int)id1) >= 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L174] COND TRUE ((int)id2) >= 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L176] COND TRUE ((int)id3) >= 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L178] COND TRUE ((int)r1) == 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L180] COND TRUE ((int)r2) == 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L182] COND TRUE ((int)r3) == 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L184] COND TRUE !(init__r122 == 0) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L186] COND TRUE !(init__r132 == 0) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L188] COND TRUE !(init__r212 == 0) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L190] COND TRUE !(init__r232 == 0) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L192] COND TRUE !(init__r312 == 0) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L194] COND TRUE !(init__r322 == 0) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L196] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L198] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L200] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L202] COND TRUE ((int)st1) == 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L204] COND TRUE ((int)st2) == 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L206] COND TRUE ((int)st3) == 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L208] COND TRUE ((int)nl1) == 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L210] COND TRUE ((int)nl2) == 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L212] COND TRUE ((int)nl3) == 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=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] [L214] COND TRUE ((int)mode1) == 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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] [L216] COND TRUE ((int)mode2) == 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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] [L218] COND TRUE ((int)mode3) == 0 VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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] [L220] COND TRUE !(newmax1 == 0) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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] [L222] COND TRUE !(newmax2 == 0) VAL [__return_1858=0, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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] [L224] COND TRUE !(newmax3 == 0) [L226] init__tmp___5 = 1 [L227] __return_1858 = init__tmp___5 [L228] main__i2 = __return_1858 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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] [L229] COND TRUE main__i2 != 0 [L231] p12_old = nomsg [L232] p12_new = nomsg [L233] p13_old = nomsg [L234] p13_new = nomsg [L235] p21_old = nomsg [L236] p21_new = nomsg [L237] p23_old = nomsg [L238] p23_new = nomsg [L239] p31_old = nomsg [L240] p31_new = nomsg [L241] p32_old = nomsg [L242] p32_new = nomsg [L243] main__i2 = 0 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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] [L244] COND TRUE main__i2 < 6 [L247] _Bool node1__newmax; [L248] node1__newmax = 0 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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] [L249] COND FALSE !(!(mode1 == 0)) VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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 ((int)r1) < 1 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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 FALSE !(!(ep12 == 0)) VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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] [L270] COND TRUE !(ep13 == 0) VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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] [L272] COND TRUE !(newmax1 == 0) [L274] int node1____CPAchecker_TMP_1; VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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] [L275] COND TRUE max1 != nomsg VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L277] COND TRUE p13_new == nomsg [L279] node1____CPAchecker_TMP_1 = max1 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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] [L281] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, 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=0, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L283] mode1 = 1 [L285] _Bool node2__newmax; [L286] node2__newmax = 0 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, 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] [L287] COND FALSE !(!(mode2 == 0)) VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L293] COND TRUE ((int)r2) < 2 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L295] COND TRUE !(ep21 == 0) VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, 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] [L297] COND TRUE !(newmax2 == 0) [L299] int node2____CPAchecker_TMP_0; VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, 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] [L300] COND TRUE max2 != nomsg VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L302] COND TRUE p21_new == nomsg [L304] node2____CPAchecker_TMP_0 = max2 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, 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] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=72, 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 FALSE !(!(ep23 == 0)) VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=72, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L321] mode2 = 1 [L323] _Bool node3__newmax; [L324] node3__newmax = 0 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=72, 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] [L325] COND FALSE !(!(mode3 == 0)) VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=72, 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] [L331] COND TRUE ((int)r3) < 2 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=72, 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] [L333] COND FALSE !(!(ep31 == 0)) VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=72, 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] [L346] COND TRUE !(ep32 == 0) VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=72, 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] [L348] COND TRUE !(newmax3 == 0) [L350] int node3____CPAchecker_TMP_1; VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=72, 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] [L351] COND TRUE max3 != nomsg VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=72, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L353] COND TRUE p32_new == nomsg [L355] node3____CPAchecker_TMP_1 = max3 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=72, 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] [L357] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=72, 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] [L359] mode3 = 1 [L360] p12_old = p12_new [L361] p12_new = nomsg [L362] p13_old = p13_new [L363] p13_new = nomsg [L364] p21_old = p21_new [L365] p21_new = nomsg [L366] p23_old = p23_new [L367] p23_new = nomsg [L368] p31_old = p31_new [L369] p31_new = nomsg [L370] p32_old = p32_new [L371] p32_new = nomsg [L373] int check__tmp; VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L374] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L376] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L378] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L380] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L382] COND FALSE !(((int)r1) >= 2) VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L388] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L390] COND TRUE ((int)r1) < 2 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L392] COND FALSE !(((int)r1) >= 2) VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L398] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1858=1, __return_2004=0, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L400] COND TRUE ((int)r1) < 2 [L402] check__tmp = 1 [L403] __return_2004 = check__tmp [L404] main__c1 = __return_2004 [L406] _Bool __tmp_1; [L407] __tmp_1 = main__c1 [L408] _Bool assert__arg; [L409] assert__arg = __tmp_1 VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L410] COND FALSE !(assert__arg == 0) [L416] int main____CPAchecker_TMP_0 = main__i2; [L417] main__i2 = main__i2 + 1 VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L418] COND TRUE main__i2 < 6 [L421] _Bool node1__newmax; [L422] node1__newmax = 0 VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=0, m2=0, m3=0, max1=0, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=72, 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] [L423] COND TRUE !(mode1 == 0) [L425] r1 = (char)(((int)r1) + 1) [L426] COND TRUE !(ep21 == 0) [L428] m1 = p21_old [L429] p21_old = nomsg [L430] COND TRUE ((int)m1) > ((int)max1) [L432] max1 = m1 [L433] node1__newmax = 1 [L435] COND FALSE !(!(ep31 == 0)) [L444] newmax1 = node1__newmax VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=0, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, 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=0, r3=0, st1=0, st2=0, st3=0] [L445] COND FALSE !(((int)r1) == 2) [L451] mode1 = 0 [L453] _Bool node2__newmax; [L454] node2__newmax = 0 VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=0, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, 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=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE !(mode2 == 0) [L457] r2 = (char)(((int)r2) + 1) [L458] COND FALSE !(!(ep12 == 0)) [L467] COND TRUE !(ep32 == 0) [L469] m2 = p32_old [L470] p32_old = nomsg [L471] COND FALSE !(((int)m2) > ((int)max2)) [L476] newmax2 = node2__newmax VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=1, mode3=1, newmax1=1, 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=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L477] COND FALSE !(((int)r2) == 2) [L483] mode2 = 0 [L485] _Bool node3__newmax; [L486] node3__newmax = 0 VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=1, newmax1=1, 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=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L487] COND TRUE !(mode3 == 0) [L489] r3 = (char)(((int)r3) + 1) [L490] COND TRUE !(ep13 == 0) [L492] m3 = p13_old [L493] p13_old = nomsg [L494] COND FALSE !(((int)m3) > ((int)max3)) [L499] COND FALSE !(!(ep23 == 0)) [L508] newmax3 = node3__newmax VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L509] COND FALSE !(((int)r3) == 2) [L515] mode3 = 0 [L516] p12_old = p12_new [L517] p12_new = nomsg [L518] p13_old = p13_new [L519] p13_new = nomsg [L520] p21_old = p21_new [L521] p21_new = nomsg [L522] p23_old = p23_new [L523] p23_new = nomsg [L524] p31_old = p31_new [L525] p31_new = nomsg [L526] p32_old = p32_new [L527] p32_new = nomsg [L529] int check__tmp; VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L530] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L534] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L536] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L538] COND FALSE !(((int)r1) >= 2) VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L544] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L546] COND TRUE ((int)r1) < 2 VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L548] COND FALSE !(((int)r1) >= 2) VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1858=1, __return_2004=1, __return_2137=0, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L556] COND TRUE ((int)r1) < 2 [L558] check__tmp = 1 [L559] __return_2137 = check__tmp [L560] main__c1 = __return_2137 [L562] _Bool __tmp_2; [L563] __tmp_2 = main__c1 [L564] _Bool assert__arg; [L565] assert__arg = __tmp_2 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] COND FALSE !(assert__arg == 0) [L572] int main____CPAchecker_TMP_0 = main__i2; [L573] main__i2 = main__i2 + 1 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L574] COND TRUE main__i2 < 6 [L577] _Bool node1__newmax; [L578] node1__newmax = 0 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L579] COND FALSE !(!(mode1 == 0)) VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L585] COND FALSE !(((int)r1) < 1) [L591] mode1 = 1 [L593] _Bool node2__newmax; [L594] node2__newmax = 0 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L595] COND FALSE !(!(mode2 == 0)) VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L601] COND TRUE ((int)r2) < 2 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L603] COND TRUE !(ep21 == 0) VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L605] COND FALSE !(!(newmax2 == 0)) VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L616] COND FALSE !(!(ep23 == 0)) VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L629] mode2 = 1 [L631] _Bool node3__newmax; [L632] node3__newmax = 0 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L633] COND FALSE !(!(mode3 == 0)) VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L639] COND TRUE ((int)r3) < 2 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L641] COND FALSE !(!(ep31 == 0)) VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L654] COND TRUE !(ep32 == 0) VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L656] COND FALSE !(!(newmax3 == 0)) VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L667] mode3 = 1 [L668] p12_old = p12_new [L669] p12_new = nomsg [L670] p13_old = p13_new [L671] p13_new = nomsg [L672] p21_old = p21_new [L673] p21_new = nomsg [L674] p23_old = p23_new [L675] p23_new = nomsg [L676] p31_old = p31_new [L677] p31_new = nomsg [L678] p32_old = p32_new [L679] p32_new = nomsg [L681] int check__tmp; VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L682] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L684] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L686] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L688] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L690] COND FALSE !(((int)r1) >= 2) VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L696] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L698] COND TRUE ((int)r1) < 2 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L700] COND FALSE !(((int)r1) >= 2) VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L706] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=0, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L708] COND TRUE ((int)r1) < 2 [L710] check__tmp = 1 [L711] __return_2256 = check__tmp [L712] main__c1 = __return_2256 [L714] _Bool __tmp_3; [L715] __tmp_3 = main__c1 [L716] _Bool assert__arg; [L717] assert__arg = __tmp_3 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L718] COND FALSE !(assert__arg == 0) [L724] int main____CPAchecker_TMP_0 = main__i2; [L725] main__i2 = main__i2 + 1 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L726] COND TRUE main__i2 < 6 [L729] _Bool node1__newmax; [L730] node1__newmax = 0 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=72, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L731] COND TRUE !(mode1 == 0) [L733] r1 = (char)(((int)r1) + 1) [L734] COND TRUE !(ep21 == 0) [L736] m1 = p21_old [L737] p21_old = nomsg [L738] COND FALSE !(((int)m1) > ((int)max1)) [L743] COND FALSE !(!(ep31 == 0)) [L752] newmax1 = node1__newmax VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=-1, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L753] COND TRUE ((int)r1) == 2 [L755] COND FALSE !(((int)max1) == ((int)id1)) [L1601] nl1 = 1 [L759] mode1 = 0 [L761] _Bool node2__newmax; [L762] node2__newmax = 0 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=-1, m2=1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L763] COND TRUE !(mode2 == 0) [L765] r2 = (char)(((int)r2) + 1) [L766] COND FALSE !(!(ep12 == 0)) [L775] COND TRUE !(ep32 == 0) [L777] m2 = p32_old [L778] p32_old = nomsg [L779] COND FALSE !(((int)m2) > ((int)max2)) [L784] newmax2 = node2__newmax VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=-1, m2=-1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L785] COND TRUE ((int)r2) == 2 [L787] COND TRUE ((int)max2) == ((int)id2) [L789] st2 = 1 [L791] mode2 = 0 [L793] _Bool node3__newmax; [L794] node3__newmax = 0 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=-1, m2=-1, m3=0, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=1, st3=0] [L795] COND TRUE !(mode3 == 0) [L797] r3 = (char)(((int)r3) + 1) [L798] COND TRUE !(ep13 == 0) [L800] m3 = p13_old [L801] p13_old = nomsg [L802] COND FALSE !(((int)m3) > ((int)max3)) [L807] COND FALSE !(!(ep23 == 0)) [L816] newmax3 = node3__newmax VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=-1, m2=-1, m3=-1, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L817] COND TRUE ((int)r3) == 2 [L819] COND TRUE ((int)max3) == ((int)id3) [L821] st3 = 1 [L823] mode3 = 0 [L824] p12_old = p12_new [L825] p12_new = nomsg [L826] p13_old = p13_new [L827] p13_new = nomsg [L828] p21_old = p21_new [L829] p21_new = nomsg [L830] p23_old = p23_new [L831] p23_new = nomsg [L832] p31_old = p31_new [L833] p31_new = nomsg [L834] p32_old = p32_new [L835] p32_new = nomsg [L837] int check__tmp; VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=-1, m2=-1, m3=-1, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L838] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1520] check__tmp = 0 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=-1, m2=-1, m3=-1, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L866] __return_2394 = check__tmp [L867] main__c1 = __return_2394 [L868] __tmp_2395_0 = main____CPAchecker_TMP_0 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=2, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=-1, m2=-1, m3=-1, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L870] main____CPAchecker_TMP_0 = __tmp_2395_0 [L872] _Bool __tmp_4; [L873] __tmp_4 = main__c1 [L874] _Bool assert__arg; [L875] assert__arg = __tmp_4 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=2, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=-1, m2=-1, m3=-1, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L876] COND TRUE assert__arg == 0 VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=2, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=-1, m2=-1, m3=-1, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L878] __VERIFIER_error() VAL [__return_1858=1, __return_2004=1, __return_2137=1, __return_2256=1, __return_2394=0, __return_2408=0, __return_2518=0, __return_main=0, __tmp_2395_0=2, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=72, id3=1, m1=-1, m2=-1, m3=-1, max1=72, max2=72, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 824.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2557.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.8 MB). Peak memory consumption was 244.5 MB. Max. memory is 11.5 GB. * CodeCheck took 516545.00 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -788.2 MB). Peak memory consumption was 975.6 MB. Max. memory is 11.5 GB. * Witness Printer took 270.89 ms. Allocated memory is still 2.9 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...