./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d9066a9c9a0f98758515c22da9fb874b191c54e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:02:22,686 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:02:22,687 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:02:22,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:02:22,694 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:02:22,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:02:22,695 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:02:22,696 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:02:22,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:02:22,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:02:22,697 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:02:22,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:02:22,698 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:02:22,699 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:02:22,699 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:02:22,700 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:02:22,700 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:02:22,701 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:02:22,702 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:02:22,703 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:02:22,703 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:02:22,704 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:02:22,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:02:22,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:02:22,705 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:02:22,706 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:02:22,707 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:02:22,707 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:02:22,707 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:02:22,708 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:02:22,708 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:02:22,709 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:02:22,709 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:02:22,709 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:02:22,709 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:02:22,710 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:02:22,710 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-03 01:02:22,717 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:02:22,718 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:02:22,718 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:02:22,718 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-03 01:02:22,719 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 01:02:22,719 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 01:02:22,719 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:02:22,719 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:02:22,719 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:02:22,719 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:02:22,719 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:02:22,719 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:02:22,719 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:02:22,720 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:02:22,720 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:02:22,720 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:02:22,720 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 01:02:22,720 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:02:22,720 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-03 01:02:22,720 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-03 01:02:22,720 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:02:22,720 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:02:22,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-03 01:02:22,721 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:02:22,721 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:02:22,721 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:02:22,721 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-03 01:02:22,721 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:02:22,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:02:22,721 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d9066a9c9a0f98758515c22da9fb874b191c54e [2018-12-03 01:02:22,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:02:22,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:02:22,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:02:22,749 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:02:22,749 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:02:22,750 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c [2018-12-03 01:02:22,786 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak/data/a8ea6e04e/cac575898845478cb9f7bbe620daee00/FLAG9d18de553 [2018-12-03 01:02:23,174 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:02:23,174 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c [2018-12-03 01:02:23,180 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak/data/a8ea6e04e/cac575898845478cb9f7bbe620daee00/FLAG9d18de553 [2018-12-03 01:02:23,535 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak/data/a8ea6e04e/cac575898845478cb9f7bbe620daee00 [2018-12-03 01:02:23,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:02:23,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:02:23,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:02:23,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:02:23,540 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:02:23,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:02:23" (1/1) ... [2018-12-03 01:02:23,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1a3593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:23, skipping insertion in model container [2018-12-03 01:02:23,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:02:23" (1/1) ... [2018-12-03 01:02:23,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:02:23,565 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:02:23,686 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:02:23,691 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:02:23,755 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:02:23,765 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:02:23,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:23 WrapperNode [2018-12-03 01:02:23,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:02:23,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:02:23,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:02:23,766 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:02:23,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:23" (1/1) ... [2018-12-03 01:02:23,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:23" (1/1) ... [2018-12-03 01:02:23,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:02:23,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:02:23,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:02:23,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:02:23,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:23" (1/1) ... [2018-12-03 01:02:23,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:23" (1/1) ... [2018-12-03 01:02:23,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:23" (1/1) ... [2018-12-03 01:02:23,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:23" (1/1) ... [2018-12-03 01:02:23,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:23" (1/1) ... [2018-12-03 01:02:23,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:23" (1/1) ... [2018-12-03 01:02:23,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:23" (1/1) ... [2018-12-03 01:02:23,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:02:23,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:02:23,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:02:23,814 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:02:23,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:02:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-03 01:02:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:02:23,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:02:25,350 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:02:25,350 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-03 01:02:25,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:02:25 BoogieIcfgContainer [2018-12-03 01:02:25,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:02:25,351 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-03 01:02:25,351 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-03 01:02:25,360 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-03 01:02:25,360 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:02:25" (1/1) ... [2018-12-03 01:02:25,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:02:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2018-12-03 01:02:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2018-12-03 01:02:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 01:02:25,393 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:25,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2018-12-03 01:02:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2018-12-03 01:02:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 01:02:25,757 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2018-12-03 01:02:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2018-12-03 01:02:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 01:02:26,035 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2018-12-03 01:02:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2018-12-03 01:02:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 01:02:26,369 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2018-12-03 01:02:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2018-12-03 01:02:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 01:02:26,865 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2018-12-03 01:02:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2018-12-03 01:02:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 01:02:27,676 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2018-12-03 01:02:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2018-12-03 01:02:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 01:02:28,564 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2018-12-03 01:02:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2018-12-03 01:02:28,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 01:02:28,790 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2018-12-03 01:02:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2018-12-03 01:02:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 01:02:28,829 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-12-03 01:02:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-12-03 01:02:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 01:02:30,321 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2018-12-03 01:02:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2018-12-03 01:02:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 01:02:30,619 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 74 states and 135 transitions. [2018-12-03 01:02:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 135 transitions. [2018-12-03 01:02:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 01:02:35,259 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:37,903 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-12-03 01:02:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 90 states and 165 transitions. [2018-12-03 01:02:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 165 transitions. [2018-12-03 01:02:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 01:02:43,689 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 91 states and 167 transitions. [2018-12-03 01:02:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 167 transitions. [2018-12-03 01:02:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:02:43,952 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 96 states and 180 transitions. [2018-12-03 01:02:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 180 transitions. [2018-12-03 01:02:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:02:47,422 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 98 states and 184 transitions. [2018-12-03 01:02:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2018-12-03 01:02:47,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 01:02:47,941 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 115 states and 216 transitions. [2018-12-03 01:02:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 216 transitions. [2018-12-03 01:02:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 01:02:56,845 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:02:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:02:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 116 states and 220 transitions. [2018-12-03 01:02:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 220 transitions. [2018-12-03 01:02:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 01:02:57,252 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:02:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:02:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 133 states and 250 transitions. [2018-12-03 01:03:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 250 transitions. [2018-12-03 01:03:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 01:03:09,926 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 136 states and 259 transitions. [2018-12-03 01:03:11,304 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 259 transitions. [2018-12-03 01:03:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 01:03:11,304 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 137 states and 264 transitions. [2018-12-03 01:03:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 264 transitions. [2018-12-03 01:03:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 01:03:11,895 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 142 states and 273 transitions. [2018-12-03 01:03:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 273 transitions. [2018-12-03 01:03:14,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 01:03:14,285 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 145 states and 278 transitions. [2018-12-03 01:03:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 278 transitions. [2018-12-03 01:03:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 01:03:15,352 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 146 states and 280 transitions. [2018-12-03 01:03:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 280 transitions. [2018-12-03 01:03:15,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 01:03:15,913 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 153 states and 300 transitions. [2018-12-03 01:03:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 300 transitions. [2018-12-03 01:03:24,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 01:03:24,356 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 156 states and 308 transitions. [2018-12-03 01:03:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 308 transitions. [2018-12-03 01:03:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 01:03:26,521 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 157 states and 313 transitions. [2018-12-03 01:03:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 313 transitions. [2018-12-03 01:03:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 01:03:27,623 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:29,533 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-12-03 01:03:39,418 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-12-03 01:03:39,813 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-03 01:03:41,236 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-12-03 01:03:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 182 states and 386 transitions. [2018-12-03 01:03:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 386 transitions. [2018-12-03 01:03:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 01:03:51,788 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 187 states and 396 transitions. [2018-12-03 01:03:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 396 transitions. [2018-12-03 01:03:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 01:03:55,758 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 188 states and 401 transitions. [2018-12-03 01:03:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 401 transitions. [2018-12-03 01:03:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 01:03:56,676 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:57,950 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-12-03 01:03:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 190 states and 404 transitions. [2018-12-03 01:03:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 404 transitions. [2018-12-03 01:03:59,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 01:03:59,171 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:02,248 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2018-12-03 01:04:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:07,063 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-12-03 01:04:08,229 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-12-03 01:04:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 203 states and 447 transitions. [2018-12-03 01:04:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 447 transitions. [2018-12-03 01:04:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 01:04:19,832 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 209 states and 457 transitions. [2018-12-03 01:04:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 457 transitions. [2018-12-03 01:04:27,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 01:04:27,311 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 212 states and 462 transitions. [2018-12-03 01:04:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 462 transitions. [2018-12-03 01:04:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 01:04:32,302 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:42,445 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-03 01:04:47,748 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-03 01:04:48,273 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-12-03 01:04:49,999 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-12-03 01:04:51,064 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-03 01:05:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 240 states and 524 transitions. [2018-12-03 01:05:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 524 transitions. [2018-12-03 01:05:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 01:05:00,382 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 246 states and 549 transitions. [2018-12-03 01:05:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 549 transitions. [2018-12-03 01:05:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 01:05:05,872 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 247 states and 557 transitions. [2018-12-03 01:05:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 557 transitions. [2018-12-03 01:05:07,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 01:05:07,100 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:13,621 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-12-03 01:05:16,417 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 01:05:18,097 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-12-03 01:05:22,479 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-03 01:05:23,098 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-12-03 01:05:23,455 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-12-03 01:05:26,344 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2018-12-03 01:05:32,419 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-03 01:05:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 274 states and 615 transitions. [2018-12-03 01:05:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 615 transitions. [2018-12-03 01:05:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 01:05:38,055 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 279 states and 631 transitions. [2018-12-03 01:05:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 631 transitions. [2018-12-03 01:05:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 01:05:42,942 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 280 states and 638 transitions. [2018-12-03 01:05:44,347 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 638 transitions. [2018-12-03 01:05:44,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 01:05:44,348 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 281 states and 646 transitions. [2018-12-03 01:05:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 646 transitions. [2018-12-03 01:05:45,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 01:05:45,370 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:05:54,166 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2018-12-03 01:05:56,066 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-12-03 01:05:59,489 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-03 01:06:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 284 states and 659 transitions. [2018-12-03 01:06:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 659 transitions. [2018-12-03 01:06:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 01:06:03,389 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:06:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 285 states and 666 transitions. [2018-12-03 01:06:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 666 transitions. [2018-12-03 01:06:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 01:06:04,703 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:06:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 288 states and 681 transitions. [2018-12-03 01:06:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 681 transitions. [2018-12-03 01:06:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 01:06:08,390 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:06:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 289 states and 682 transitions. [2018-12-03 01:06:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 682 transitions. [2018-12-03 01:06:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 01:06:09,878 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:06:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 301 states and 710 transitions. [2018-12-03 01:06:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 710 transitions. [2018-12-03 01:06:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 01:06:26,017 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:06:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 302 states and 716 transitions. [2018-12-03 01:06:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 716 transitions. [2018-12-03 01:06:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 01:06:27,363 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:06:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 303 states and 720 transitions. [2018-12-03 01:06:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 720 transitions. [2018-12-03 01:06:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 01:06:29,880 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:06:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 306 states and 747 transitions. [2018-12-03 01:06:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 747 transitions. [2018-12-03 01:06:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 01:06:34,492 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:06:41,224 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-03 01:06:45,203 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-12-03 01:06:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 308 states and 755 transitions. [2018-12-03 01:06:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 755 transitions. [2018-12-03 01:06:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 01:06:49,962 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:06:50,780 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-03 01:06:51,433 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2018-12-03 01:06:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 309 states and 757 transitions. [2018-12-03 01:06:52,525 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 757 transitions. [2018-12-03 01:06:52,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 01:06:52,525 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:06:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 310 states and 762 transitions. [2018-12-03 01:06:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 762 transitions. [2018-12-03 01:06:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 01:06:53,950 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:06:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 313 states and 777 transitions. [2018-12-03 01:06:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 777 transitions. [2018-12-03 01:06:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 01:06:57,495 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:06:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:06:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:06:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:06:59,228 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 53 iterations. [2018-12-03 01:06:59,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.12 01:06:59 ImpRootNode [2018-12-03 01:06:59,318 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-03 01:06:59,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:06:59,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:06:59,318 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:06:59,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:02:25" (3/4) ... [2018-12-03 01:06:59,321 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 01:06:59,427 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ef607cdc-17a0-49d2-94ef-37368a9c9ab9/bin-2019/ukojak/witness.graphml [2018-12-03 01:06:59,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:06:59,428 INFO L168 Benchmark]: Toolchain (without parser) took 275890.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 953.3 MB in the beginning and 785.8 MB in the end (delta: 167.5 MB). Peak memory consumption was 246.7 MB. Max. memory is 11.5 GB. [2018-12-03 01:06:59,428 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:06:59,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-12-03 01:06:59,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.61 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. [2018-12-03 01:06:59,429 INFO L168 Benchmark]: Boogie Preprocessor took 19.88 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: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2018-12-03 01:06:59,429 INFO L168 Benchmark]: RCFGBuilder took 1536.91 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 100.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -42.2 MB). Peak memory consumption was 331.4 MB. Max. memory is 11.5 GB. [2018-12-03 01:06:59,429 INFO L168 Benchmark]: CodeCheck took 273966.55 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Free memory was 1.1 GB in the beginning and 810.8 MB in the end (delta: 315.3 MB). Peak memory consumption was 191.0 MB. Max. memory is 11.5 GB. [2018-12-03 01:06:59,429 INFO L168 Benchmark]: Witness Printer took 108.84 ms. Allocated memory is still 1.1 GB. Free memory was 810.8 MB in the beginning and 785.8 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-03 01:06:59,431 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 146 locations, 1 error locations. UNSAFE Result, 273.8s OverallTime, 53 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 1853786994 SDslu, 0 SDs, 0 SdLazy, 2041412238 SolverSat, -1606870888 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 130.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16661 GetRequests, 14585 SyntacticMatches, 914 SemanticMatches, 1162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870636 ImplicationChecksByTransitivity, 260.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 34.2s InterpolantComputationTime, 1456 NumberOfCodeBlocks, 1456 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1359 ConstructedInterpolants, 0 QuantifiedInterpolants, 696355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 10 PerfectInterpolantSequences, 159/862 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 652]: 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}; [L571] int c1 ; [L572] int i2 ; [L575] c1 = 0 [L576] ep12 = __VERIFIER_nondet_bool() [L577] ep13 = __VERIFIER_nondet_bool() [L578] ep21 = __VERIFIER_nondet_bool() [L579] ep23 = __VERIFIER_nondet_bool() [L580] ep31 = __VERIFIER_nondet_bool() [L581] ep32 = __VERIFIER_nondet_bool() [L582] id1 = __VERIFIER_nondet_char() [L583] r1 = __VERIFIER_nondet_uchar() [L584] st1 = __VERIFIER_nondet_char() [L585] nl1 = __VERIFIER_nondet_char() [L586] m1 = __VERIFIER_nondet_char() [L587] max1 = __VERIFIER_nondet_char() [L588] mode1 = __VERIFIER_nondet_bool() [L589] newmax1 = __VERIFIER_nondet_bool() [L590] id2 = __VERIFIER_nondet_char() [L591] r2 = __VERIFIER_nondet_uchar() [L592] st2 = __VERIFIER_nondet_char() [L593] nl2 = __VERIFIER_nondet_char() [L594] m2 = __VERIFIER_nondet_char() [L595] max2 = __VERIFIER_nondet_char() [L596] mode2 = __VERIFIER_nondet_bool() [L597] newmax2 = __VERIFIER_nondet_bool() [L598] id3 = __VERIFIER_nondet_char() [L599] r3 = __VERIFIER_nondet_uchar() [L600] st3 = __VERIFIER_nondet_char() [L601] nl3 = __VERIFIER_nondet_char() [L602] m3 = __VERIFIER_nondet_char() [L603] max3 = __VERIFIER_nondet_char() [L604] mode3 = __VERIFIER_nondet_bool() [L605] 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 TRUE \read(r121) [L312] tmp = 1 [L323] r122 = (_Bool )tmp [L324] COND FALSE !(\read(r131)) [L327] COND TRUE \read(r121) [L328] COND TRUE \read(ep23) [L329] tmp___0 = 1 [L336] r132 = (_Bool )tmp___0 [L337] COND TRUE \read(r211) [L338] tmp___1 = 1 [L349] r212 = (_Bool )tmp___1 [L350] COND TRUE \read(r231) [L351] tmp___2 = 1 [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 TRUE \read(ep12) [L381] tmp___4 = 1 [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 \read(r122) [L399] COND TRUE \read(r132) [L400] COND TRUE \read(r212) [L401] COND TRUE \read(r232) [L402] COND TRUE \read(r312) [L403] COND TRUE \read(r322) [L404] COND TRUE (int )max1 == (int )id1 [L405] COND TRUE (int )max2 == (int )id2 [L406] COND TRUE (int )max3 == (int )id3 [L407] COND TRUE (int )st1 == 0 [L408] COND TRUE (int )st2 == 0 [L409] COND TRUE (int )st3 == 0 [L410] COND TRUE (int )nl1 == 0 [L411] COND TRUE (int )nl2 == 0 [L412] COND TRUE (int )nl3 == 0 [L413] COND TRUE (int )mode1 == 0 [L414] COND TRUE (int )mode2 == 0 [L415] COND TRUE (int )mode3 == 0 [L416] COND TRUE \read(newmax1) [L417] COND TRUE \read(newmax2) [L418] COND TRUE \read(newmax3) [L419] tmp___5 = 1 [L510] return (tmp___5); [L606] i2 = init() [L608] p12_old = nomsg [L609] p12_new = nomsg [L610] p13_old = nomsg [L611] p13_new = nomsg [L612] p21_old = nomsg [L613] p21_new = nomsg [L614] p23_old = nomsg [L615] p23_new = nomsg [L616] p31_old = nomsg [L617] p31_new = nomsg [L618] p32_old = nomsg [L619] p32_new = nomsg [L620] i2 = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 1 [L157] COND TRUE \read(ep12) [L158] COND TRUE \read(newmax1) [L159] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L159] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [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 TRUE \read(ep21) [L212] COND TRUE \read(newmax2) [L213] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L213] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L216] COND TRUE \read(ep23) [L217] COND TRUE \read(newmax2) [L218] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L218] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [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 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=88, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=88, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=88, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=88, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=88, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=88, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=88, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=88, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=88, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=88, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=88, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=127, m2=0, m3=3, max1=1, max2=2, max3=88, 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=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=88, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L621] 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 TRUE \read(ep21) [L131] m1 = p21_old [L132] p21_old = nomsg [L133] COND TRUE (int )m1 > (int )max1 [L134] max1 = m1 [L135] newmax = (_Bool)1 [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 TRUE \read(ep12) [L185] m2 = p12_old [L186] p12_old = nomsg [L187] COND FALSE !((int )m2 > (int )max2) [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 TRUE \read(ep23) [L247] m3 = p23_old [L248] p23_old = nomsg [L249] COND FALSE !((int )m3 > (int )max3) [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] mode3 = (_Bool)0 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L527] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND FALSE !((int )r1 < 1) [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND TRUE \read(ep21) [L212] COND FALSE !(\read(newmax2)) [L216] COND TRUE \read(ep23) [L217] COND FALSE !(\read(newmax2)) [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 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L527] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=88, m2=1, m3=2, max1=88, max2=2, max3=88, 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] [L621] 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 TRUE \read(ep21) [L131] m1 = p21_old [L132] p21_old = nomsg [L133] COND FALSE !((int )m1 > (int )max1) [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 TRUE \read(ep12) [L185] m2 = p12_old [L186] p12_old = nomsg [L187] COND FALSE !((int )m2 > (int )max2) [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 TRUE \read(ep23) [L247] m3 = p23_old [L248] p23_old = nomsg [L249] COND FALSE !((int )m3 > (int )max3) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND TRUE (int )max3 == (int )id3 [L257] st3 = (char)1 [L262] mode3 = (_Bool)0 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=-1, m2=-1, m3=-1, max1=88, max2=2, max3=88, 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] [L518] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L564] tmp = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=-1, m2=-1, m3=-1, max1=88, max2=2, max3=88, 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] [L566] return (tmp); [L638] c1 = check() [L650] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=-1, m2=-1, m3=-1, max1=88, max2=2, max3=88, 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] [L652] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=88, m1=-1, m2=-1, m3=-1, max1=88, max2=2, max3=88, 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 227.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.61 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. * Boogie Preprocessor took 19.88 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: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1536.91 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 100.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -42.2 MB). Peak memory consumption was 331.4 MB. Max. memory is 11.5 GB. * CodeCheck took 273966.55 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Free memory was 1.1 GB in the beginning and 810.8 MB in the end (delta: 315.3 MB). Peak memory consumption was 191.0 MB. Max. memory is 11.5 GB. * Witness Printer took 108.84 ms. Allocated memory is still 1.1 GB. Free memory was 810.8 MB in the beginning and 785.8 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...