./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/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 597d75969acc1d8bcee1b027bc47b6559ce75136 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-01 22:43:06,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 22:43:06,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 22:43:06,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 22:43:06,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 22:43:06,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 22:43:06,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 22:43:06,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 22:43:06,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 22:43:06,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 22:43:06,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 22:43:06,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 22:43:06,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 22:43:06,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 22:43:06,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 22:43:06,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 22:43:06,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 22:43:06,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 22:43:06,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 22:43:06,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 22:43:06,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 22:43:06,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 22:43:06,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 22:43:06,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 22:43:06,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 22:43:06,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 22:43:06,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 22:43:06,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 22:43:06,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 22:43:06,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 22:43:06,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 22:43:06,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 22:43:06,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 22:43:06,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 22:43:06,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 22:43:06,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 22:43:06,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 22:43:06,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 22:43:06,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 22:43:06,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 22:43:06,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 22:43:06,761 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-01 22:43:06,773 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 22:43:06,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 22:43:06,774 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 22:43:06,774 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 22:43:06,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 22:43:06,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 22:43:06,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 22:43:06,776 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-01 22:43:06,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 22:43:06,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-01 22:43:06,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 22:43:06,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 22:43:06,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 22:43:06,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 22:43:06,777 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-01 22:43:06,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 22:43:06,777 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 22:43:06,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 22:43:06,778 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 22:43:06,778 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 22:43:06,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 22:43:06,778 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 22:43:06,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 22:43:06,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 22:43:06,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 22:43:06,779 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 22:43:06,779 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 22:43:06,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 22:43:06,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 22:43:06,780 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_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/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 -> 597d75969acc1d8bcee1b027bc47b6559ce75136 [2019-12-01 22:43:06,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 22:43:06,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 22:43:06,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 22:43:06,906 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 22:43:06,907 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 22:43:06,907 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2019-12-01 22:43:06,950 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/bin/ukojak/data/35a78d29a/dfcd27d76bef4f58b1124d523f36e395/FLAG40d17a904 [2019-12-01 22:43:07,404 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 22:43:07,404 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2019-12-01 22:43:07,411 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/bin/ukojak/data/35a78d29a/dfcd27d76bef4f58b1124d523f36e395/FLAG40d17a904 [2019-12-01 22:43:07,419 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/bin/ukojak/data/35a78d29a/dfcd27d76bef4f58b1124d523f36e395 [2019-12-01 22:43:07,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 22:43:07,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 22:43:07,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 22:43:07,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 22:43:07,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 22:43:07,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:43:07" (1/1) ... [2019-12-01 22:43:07,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec2c2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:43:07, skipping insertion in model container [2019-12-01 22:43:07,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:43:07" (1/1) ... [2019-12-01 22:43:07,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 22:43:07,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 22:43:07,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 22:43:07,643 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 22:43:07,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 22:43:07,692 INFO L208 MainTranslator]: Completed translation [2019-12-01 22:43:07,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:43:07 WrapperNode [2019-12-01 22:43:07,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 22:43:07,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 22:43:07,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 22:43:07,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 22:43:07,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:43:07" (1/1) ... [2019-12-01 22:43:07,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:43:07" (1/1) ... [2019-12-01 22:43:07,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 22:43:07,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 22:43:07,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 22:43:07,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 22:43:07,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:43:07" (1/1) ... [2019-12-01 22:43:07,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:43:07" (1/1) ... [2019-12-01 22:43:07,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:43:07" (1/1) ... [2019-12-01 22:43:07,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:43:07" (1/1) ... [2019-12-01 22:43:07,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:43:07" (1/1) ... [2019-12-01 22:43:07,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:43:07" (1/1) ... [2019-12-01 22:43:07,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:43:07" (1/1) ... [2019-12-01 22:43:07,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 22:43:07,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 22:43:07,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 22:43:07,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 22:43:07,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:43:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/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-12-01 22:43:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 22:43:07,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 22:43:09,350 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 22:43:09,351 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-12-01 22:43:09,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:43:09 BoogieIcfgContainer [2019-12-01 22:43:09,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 22:43:09,353 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 22:43:09,353 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 22:43:09,362 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 22:43:09,362 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:43:09" (1/1) ... [2019-12-01 22:43:09,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 22:43:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2019-12-01 22:43:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2019-12-01 22:43:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-01 22:43:09,397 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2019-12-01 22:43:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2019-12-01 22:43:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-01 22:43:09,805 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2019-12-01 22:43:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2019-12-01 22:43:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-01 22:43:10,295 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2019-12-01 22:43:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-12-01 22:43:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-01 22:43:10,729 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 31 states and 54 transitions. [2019-12-01 22:43:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2019-12-01 22:43:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-01 22:43:11,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2019-12-01 22:43:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2019-12-01 22:43:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-01 22:43:12,139 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2019-12-01 22:43:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2019-12-01 22:43:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-01 22:43:13,412 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2019-12-01 22:43:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2019-12-01 22:43:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-01 22:43:13,688 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 46 states and 80 transitions. [2019-12-01 22:43:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 80 transitions. [2019-12-01 22:43:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-01 22:43:13,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 53 states and 91 transitions. [2019-12-01 22:43:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 91 transitions. [2019-12-01 22:43:15,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-01 22:43:15,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 56 states and 103 transitions. [2019-12-01 22:43:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 103 transitions. [2019-12-01 22:43:15,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-01 22:43:15,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:19,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 71 states and 132 transitions. [2019-12-01 22:43:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 132 transitions. [2019-12-01 22:43:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-01 22:43:19,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 82 states and 151 transitions. [2019-12-01 22:43:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 151 transitions. [2019-12-01 22:43:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-01 22:43:22,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:22,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 83 states and 153 transitions. [2019-12-01 22:43:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 153 transitions. [2019-12-01 22:43:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 22:43:22,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:25,436 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-12-01 22:43:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 93 states and 172 transitions. [2019-12-01 22:43:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 172 transitions. [2019-12-01 22:43:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 22:43:27,826 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 94 states and 175 transitions. [2019-12-01 22:43:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 175 transitions. [2019-12-01 22:43:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 22:43:28,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 95 states and 176 transitions. [2019-12-01 22:43:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 176 transitions. [2019-12-01 22:43:28,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 22:43:28,540 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 101 states and 192 transitions. [2019-12-01 22:43:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 192 transitions. [2019-12-01 22:43:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 22:43:34,657 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 104 states and 200 transitions. [2019-12-01 22:43:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 200 transitions. [2019-12-01 22:43:35,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 22:43:35,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 105 states and 205 transitions. [2019-12-01 22:43:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 205 transitions. [2019-12-01 22:43:36,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 22:43:36,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 106 states and 206 transitions. [2019-12-01 22:43:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 206 transitions. [2019-12-01 22:43:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 22:43:36,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 126 states and 240 transitions. [2019-12-01 22:43:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 240 transitions. [2019-12-01 22:43:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 22:43:45,674 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:43:49,638 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-01 22:43:50,334 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-01 22:43:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:43:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 133 states and 255 transitions. [2019-12-01 22:43:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 255 transitions. [2019-12-01 22:43:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 22:43:54,828 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:43:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:43:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:44:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:44:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 138 states and 265 transitions. [2019-12-01 22:44:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 265 transitions. [2019-12-01 22:44:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 22:44:00,781 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:44:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:44:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 22:44:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:44:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 138 states and 264 transitions. [2019-12-01 22:44:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 264 transitions. [2019-12-01 22:44:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-01 22:44:01,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:44:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:44:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:44:06,339 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-01 22:44:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:44:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 143 states and 272 transitions. [2019-12-01 22:44:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 272 transitions. [2019-12-01 22:44:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-01 22:44:07,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:44:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:44:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:44:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:44:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 158 states and 308 transitions. [2019-12-01 22:44:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 308 transitions. [2019-12-01 22:44:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-01 22:44:18,587 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:44:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:44:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 22:44:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:44:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 165 states and 320 transitions. [2019-12-01 22:44:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 320 transitions. [2019-12-01 22:44:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-01 22:44:22,813 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:44:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:44:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 22:44:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:44:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 166 states and 324 transitions. [2019-12-01 22:44:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 324 transitions. [2019-12-01 22:44:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 22:44:23,593 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:44:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:44:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:44:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:44:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 173 states and 336 transitions. [2019-12-01 22:44:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 336 transitions. [2019-12-01 22:44:30,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 22:44:30,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:44:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:44:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:44:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:44:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 174 states and 340 transitions. [2019-12-01 22:44:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 340 transitions. [2019-12-01 22:44:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 22:44:31,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:44:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:44:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:44:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:44:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 181 states and 354 transitions. [2019-12-01 22:44:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 354 transitions. [2019-12-01 22:44:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 22:44:40,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:44:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:44:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:44:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:44:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 182 states and 356 transitions. [2019-12-01 22:44:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 356 transitions. [2019-12-01 22:44:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 22:44:40,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:44:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:44:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:44:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:44:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 183 states and 357 transitions. [2019-12-01 22:44:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 357 transitions. [2019-12-01 22:44:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 22:44:41,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:44:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:44:43,752 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 14 [2019-12-01 22:44:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:44:53,182 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-12-01 22:44:55,245 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-01 22:45:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 191 states and 379 transitions. [2019-12-01 22:45:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 379 transitions. [2019-12-01 22:45:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 22:45:00,191 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 192 states and 382 transitions. [2019-12-01 22:45:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 382 transitions. [2019-12-01 22:45:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 22:45:02,197 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 194 states and 391 transitions. [2019-12-01 22:45:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 391 transitions. [2019-12-01 22:45:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 22:45:05,363 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 196 states and 394 transitions. [2019-12-01 22:45:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 394 transitions. [2019-12-01 22:45:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-01 22:45:09,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 204 states and 414 transitions. [2019-12-01 22:45:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 414 transitions. [2019-12-01 22:45:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-01 22:45:23,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 205 states and 416 transitions. [2019-12-01 22:45:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 416 transitions. [2019-12-01 22:45:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-01 22:45:24,819 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 207 states and 427 transitions. [2019-12-01 22:45:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 427 transitions. [2019-12-01 22:45:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-01 22:45:27,688 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:32,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 211 states and 443 transitions. [2019-12-01 22:45:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 443 transitions. [2019-12-01 22:45:32,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-01 22:45:32,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 212 states and 445 transitions. [2019-12-01 22:45:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 445 transitions. [2019-12-01 22:45:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-01 22:45:34,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:34,590 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-12-01 22:45:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 213 states and 450 transitions. [2019-12-01 22:45:36,086 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 450 transitions. [2019-12-01 22:45:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-01 22:45:36,087 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 214 states and 450 transitions. [2019-12-01 22:45:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 450 transitions. [2019-12-01 22:45:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 22:45:38,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:45,837 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-12-01 22:45:47,870 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-12-01 22:45:52,666 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-01 22:46:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 225 states and 479 transitions. [2019-12-01 22:46:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 479 transitions. [2019-12-01 22:46:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 22:46:03,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 228 states and 486 transitions. [2019-12-01 22:46:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 486 transitions. [2019-12-01 22:46:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 22:46:05,512 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 231 states and 497 transitions. [2019-12-01 22:46:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 497 transitions. [2019-12-01 22:46:09,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 22:46:09,756 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 233 states and 501 transitions. [2019-12-01 22:46:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 501 transitions. [2019-12-01 22:46:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 22:46:12,484 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 234 states and 502 transitions. [2019-12-01 22:46:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 502 transitions. [2019-12-01 22:46:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 22:46:13,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 235 states and 503 transitions. [2019-12-01 22:46:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 503 transitions. [2019-12-01 22:46:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 22:46:14,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 236 states and 505 transitions. [2019-12-01 22:46:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 505 transitions. [2019-12-01 22:46:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 22:46:15,489 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 237 states and 505 transitions. [2019-12-01 22:46:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 505 transitions. [2019-12-01 22:46:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-01 22:46:16,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-01 22:46:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 236 states and 485 transitions. [2019-12-01 22:46:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 485 transitions. [2019-12-01 22:46:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-01 22:46:17,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 22:46:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 22:46:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 22:46:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 22:46:19,624 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 54 iterations. [2019-12-01 22:46:19,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 10:46:19 ImpRootNode [2019-12-01 22:46:19,719 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 22:46:19,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 22:46:19,720 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 22:46:19,720 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 22:46:19,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:43:09" (3/4) ... [2019-12-01 22:46:19,722 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-01 22:46:19,823 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f1c0dcdd-ca18-40a5-9ac2-01959f49c4e0/bin/ukojak/witness.graphml [2019-12-01 22:46:19,823 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 22:46:19,824 INFO L168 Benchmark]: Toolchain (without parser) took 192402.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 943.4 MB in the beginning and 684.7 MB in the end (delta: 258.7 MB). Peak memory consumption was 430.1 MB. Max. memory is 11.5 GB. [2019-12-01 22:46:19,824 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 22:46:19,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-01 22:46:19,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-01 22:46:19,825 INFO L168 Benchmark]: Boogie Preprocessor took 26.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 22:46:19,825 INFO L168 Benchmark]: RCFGBuilder took 1597.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 975.5 MB in the end (delta: 104.3 MB). Peak memory consumption was 256.8 MB. Max. memory is 11.5 GB. [2019-12-01 22:46:19,825 INFO L168 Benchmark]: CodeCheck took 190366.82 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 975.5 MB in the beginning and 713.3 MB in the end (delta: 262.1 MB). Peak memory consumption was 337.6 MB. Max. memory is 11.5 GB. [2019-12-01 22:46:19,826 INFO L168 Benchmark]: Witness Printer took 103.77 ms. Allocated memory is still 1.2 GB. Free memory was 713.3 MB in the beginning and 684.7 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-12-01 22:46:19,827 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, 18 locations, 1 error locations. Result: UNSAFE, OverallTime: 190.2s, OverallIterations: 54, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 0 SDtfs, -1403204602 SDslu, 1024 SDs, 0 SdLazy, 627551416 SolverSat, 233323826 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 116.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16276 GetRequests, 14463 SyntacticMatches, 917 SemanticMatches, 896 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498422 ImplicationChecksByTransitivity, 177.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 31.5s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1439 ConstructedInterpolants, 0 QuantifiedInterpolants, 538878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 11 PerfectInterpolantSequences, 220/983 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: 628]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L75] port_t p13 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L79] port_t p21 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L83] port_t p23 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L87] port_t p31 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L91] port_t p32 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] _Bool newmax1 ; [L103] char id2 ; [L104] unsigned char r2 ; [L105] char st2 ; [L106] char nl2 ; [L107] char m2 ; [L108] char max2 ; [L109] _Bool mode2 ; [L110] _Bool newmax2 ; [L111] char id3 ; [L112] unsigned char r3 ; [L113] char st3 ; [L114] char nl3 ; [L115] char m3 ; [L116] char max3 ; [L117] _Bool mode3 ; [L118] _Bool newmax3 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L547] int c1 ; [L548] int i2 ; [L551] c1 = 0 [L552] ep12 = __VERIFIER_nondet_bool() [L553] ep13 = __VERIFIER_nondet_bool() [L554] ep21 = __VERIFIER_nondet_bool() [L555] ep23 = __VERIFIER_nondet_bool() [L556] ep31 = __VERIFIER_nondet_bool() [L557] ep32 = __VERIFIER_nondet_bool() [L558] id1 = __VERIFIER_nondet_char() [L559] r1 = __VERIFIER_nondet_uchar() [L560] st1 = __VERIFIER_nondet_char() [L561] nl1 = __VERIFIER_nondet_char() [L562] m1 = __VERIFIER_nondet_char() [L563] max1 = __VERIFIER_nondet_char() [L564] mode1 = __VERIFIER_nondet_bool() [L565] newmax1 = __VERIFIER_nondet_bool() [L566] id2 = __VERIFIER_nondet_char() [L567] r2 = __VERIFIER_nondet_uchar() [L568] st2 = __VERIFIER_nondet_char() [L569] nl2 = __VERIFIER_nondet_char() [L570] m2 = __VERIFIER_nondet_char() [L571] max2 = __VERIFIER_nondet_char() [L572] mode2 = __VERIFIER_nondet_bool() [L573] newmax2 = __VERIFIER_nondet_bool() [L574] id3 = __VERIFIER_nondet_char() [L575] r3 = __VERIFIER_nondet_uchar() [L576] st3 = __VERIFIER_nondet_char() [L577] nl3 = __VERIFIER_nondet_char() [L578] m3 = __VERIFIER_nondet_char() [L579] max3 = __VERIFIER_nondet_char() [L580] mode3 = __VERIFIER_nondet_bool() [L581] newmax3 = __VERIFIER_nondet_bool() [L284] _Bool r121 ; [L285] _Bool r131 ; [L286] _Bool r211 ; [L287] _Bool r231 ; [L288] _Bool r311 ; [L289] _Bool r321 ; [L290] _Bool r122 ; [L291] int tmp ; [L292] _Bool r132 ; [L293] int tmp___0 ; [L294] _Bool r212 ; [L295] int tmp___1 ; [L296] _Bool r232 ; [L297] int tmp___2 ; [L298] _Bool r312 ; [L299] int tmp___3 ; [L300] _Bool r322 ; [L301] int tmp___4 ; [L302] int tmp___5 ; [L305] r121 = ep12 [L306] r131 = ep13 [L307] r211 = ep21 [L308] r231 = ep23 [L309] r311 = ep31 [L310] r321 = ep32 [L311] COND FALSE !(\read(r121)) [L314] COND FALSE !(\read(r131)) [L321] tmp = 0 [L323] r122 = (_Bool )tmp [L324] COND FALSE !(\read(r131)) [L327] COND FALSE !(\read(r121)) [L334] tmp___0 = 0 [L336] r132 = (_Bool )tmp___0 [L337] COND FALSE !(\read(r211)) [L340] COND FALSE !(\read(r231)) [L347] tmp___1 = 0 [L349] r212 = (_Bool )tmp___1 [L350] COND FALSE !(\read(r231)) [L353] COND FALSE !(\read(r211)) [L360] tmp___2 = 0 [L362] r232 = (_Bool )tmp___2 [L363] COND TRUE \read(r311) [L364] tmp___3 = 1 [L375] r312 = (_Bool )tmp___3 [L376] COND FALSE !(\read(r321)) [L379] COND TRUE \read(r311) [L380] COND FALSE !(\read(ep12)) [L383] tmp___4 = 0 [L388] r322 = (_Bool )tmp___4 [L389] COND TRUE (int )id1 != (int )id2 [L390] COND TRUE (int )id1 != (int )id3 [L391] COND TRUE (int )id2 != (int )id3 [L392] COND TRUE (int )id1 >= 0 [L393] COND TRUE (int )id2 >= 0 [L394] COND TRUE (int )id3 >= 0 [L395] COND TRUE (int )r1 == 0 [L396] COND TRUE (int )r2 == 0 [L397] COND TRUE (int )r3 == 0 [L398] COND TRUE (int )max1 == (int )id1 [L399] COND TRUE (int )max2 == (int )id2 [L400] COND TRUE (int )max3 == (int )id3 [L401] COND TRUE (int )st1 == 0 [L402] COND TRUE (int )st2 == 0 [L403] COND TRUE (int )st3 == 0 [L404] COND TRUE (int )nl1 == 0 [L405] COND TRUE (int )nl2 == 0 [L406] COND TRUE (int )nl3 == 0 [L407] COND TRUE (int )mode1 == 0 [L408] COND TRUE (int )mode2 == 0 [L409] COND TRUE (int )mode3 == 0 [L410] COND TRUE \read(newmax1) [L411] COND TRUE \read(newmax2) [L412] COND TRUE \read(newmax3) [L413] tmp___5 = 1 [L486] return (tmp___5); [L582] i2 = init() [L584] p12_old = nomsg [L585] p12_new = nomsg [L586] p13_old = nomsg [L587] p13_new = nomsg [L588] p21_old = nomsg [L589] p21_new = nomsg [L590] p23_old = nomsg [L591] p23_new = nomsg [L592] p31_old = nomsg [L593] p31_new = nomsg [L594] p32_old = nomsg [L595] p32_new = nomsg [L596] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND FALSE !(\read(ep12)) [L162] COND FALSE !(\read(ep13)) [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND FALSE !(\read(ep23)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND TRUE \read(newmax3) [L267] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L267] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L270] COND FALSE !(\read(ep32)) [L276] mode3 = (_Bool)1 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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=-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] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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=-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] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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=-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] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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=-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] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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=-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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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=-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] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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=-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] [L503] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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=-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] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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=-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] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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=-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] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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=-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] [L542] return (tmp); [L614] c1 = check() [L626] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=0, m2=3, m3=2, max1=0, max2=2, 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=-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] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND TRUE (int )m1 > (int )max1 [L142] max1 = m1 [L143] newmax = (_Bool)1 [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND FALSE !(\read(ep32)) [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND FALSE !(\read(ep13)) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] mode3 = (_Bool)0 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L503] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L542] return (tmp); [L614] c1 = check() [L626] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND FALSE !(\read(ep12)) [L162] COND FALSE !(\read(ep13)) [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND FALSE !(\read(ep23)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND FALSE !(\read(newmax3)) [L270] COND FALSE !(\read(ep32)) [L276] mode3 = (_Bool)1 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L503] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L542] return (tmp); [L614] c1 = check() [L626] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, 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] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND FALSE !((int )m1 > (int )max1) [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND FALSE !((int )max1 == (int )id1) [L151] nl1 = (char)1 [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND FALSE !(\read(ep32)) [L200] newmax2 = newmax [L201] COND TRUE (int )r2 == 2 [L202] COND TRUE (int )max2 == (int )id2 [L203] st2 = (char)1 [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND FALSE !(\read(ep13)) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND TRUE (int )max3 == (int )id3 [L257] st3 = (char)1 [L262] mode3 = (_Bool)0 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=1, max2=2, 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] [L494] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L540] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=1, max2=2, 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] [L542] return (tmp); [L614] c1 = check() [L626] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=1, max2=2, 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] [L628] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=1, max2=2, 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1597.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 975.5 MB in the end (delta: 104.3 MB). Peak memory consumption was 256.8 MB. Max. memory is 11.5 GB. * CodeCheck took 190366.82 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 975.5 MB in the beginning and 713.3 MB in the end (delta: 262.1 MB). Peak memory consumption was 337.6 MB. Max. memory is 11.5 GB. * Witness Printer took 103.77 ms. Allocated memory is still 1.2 GB. Free memory was 713.3 MB in the beginning and 684.7 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...