./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/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 b21da786d95e06bc319c05bb1d8697b6b032c077 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-5842f4b [2018-11-18 18:43:20,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 18:43:20,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 18:43:20,590 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 18:43:20,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 18:43:20,591 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 18:43:20,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 18:43:20,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 18:43:20,597 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 18:43:20,598 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 18:43:20,599 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 18:43:20,600 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 18:43:20,601 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 18:43:20,603 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 18:43:20,604 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 18:43:20,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 18:43:20,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 18:43:20,610 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 18:43:20,612 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 18:43:20,614 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 18:43:20,615 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 18:43:20,616 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 18:43:20,634 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 18:43:20,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 18:43:20,634 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 18:43:20,635 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 18:43:20,636 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 18:43:20,638 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 18:43:20,639 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 18:43:20,640 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 18:43:20,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 18:43:20,641 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 18:43:20,645 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 18:43:20,645 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 18:43:20,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 18:43:20,647 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 18:43:20,647 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 18:43:20,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 18:43:20,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 18:43:20,673 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 18:43:20,681 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 18:43:20,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 18:43:20,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 18:43:20,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 18:43:20,686 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 18:43:20,686 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 18:43:20,687 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 18:43:20,687 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 18:43:20,687 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 18:43:20,687 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 18:43:20,687 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 18:43:20,687 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 18:43:20,687 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 18:43:20,687 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 18:43:20,688 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 18:43:20,688 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 18:43:20,688 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 18:43:20,688 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 18:43:20,688 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 18:43:20,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 18:43:20,689 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 18:43:20,689 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 18:43:20,689 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 18:43:20,689 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 18:43:20,689 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 18:43:20,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 18:43:20,689 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_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/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 -> b21da786d95e06bc319c05bb1d8697b6b032c077 [2018-11-18 18:43:20,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 18:43:20,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 18:43:20,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 18:43:20,770 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 18:43:20,772 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 18:43:20,773 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 18:43:20,910 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/bin-2019/ukojak/data/f66ae0cf7/e8a03e46d41449d1b3afaf7e0e833273/FLAG1d6bce4ef [2018-11-18 18:43:21,725 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 18:43:21,728 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 18:43:21,750 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/bin-2019/ukojak/data/f66ae0cf7/e8a03e46d41449d1b3afaf7e0e833273/FLAG1d6bce4ef [2018-11-18 18:43:21,855 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/bin-2019/ukojak/data/f66ae0cf7/e8a03e46d41449d1b3afaf7e0e833273 [2018-11-18 18:43:21,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 18:43:21,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 18:43:21,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 18:43:21,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 18:43:21,886 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 18:43:21,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:43:21" (1/1) ... [2018-11-18 18:43:21,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6fa06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:21, skipping insertion in model container [2018-11-18 18:43:21,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:43:21" (1/1) ... [2018-11-18 18:43:21,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 18:43:22,021 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 18:43:22,448 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:43:22,464 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 18:43:22,535 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:43:22,567 INFO L195 MainTranslator]: Completed translation [2018-11-18 18:43:22,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:22 WrapperNode [2018-11-18 18:43:22,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 18:43:22,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 18:43:22,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 18:43:22,577 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 18:43:22,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:22" (1/1) ... [2018-11-18 18:43:22,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:22" (1/1) ... [2018-11-18 18:43:22,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 18:43:22,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 18:43:22,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 18:43:22,775 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 18:43:22,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:22" (1/1) ... [2018-11-18 18:43:22,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:22" (1/1) ... [2018-11-18 18:43:22,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:22" (1/1) ... [2018-11-18 18:43:22,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:22" (1/1) ... [2018-11-18 18:43:22,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:22" (1/1) ... [2018-11-18 18:43:22,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:22" (1/1) ... [2018-11-18 18:43:22,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:22" (1/1) ... [2018-11-18 18:43:22,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 18:43:22,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 18:43:22,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 18:43:22,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 18:43:22,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:43:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/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-11-18 18:43:22,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 18:43:22,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 18:43:29,517 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 18:43:29,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:43:29 BoogieIcfgContainer [2018-11-18 18:43:29,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 18:43:29,518 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 18:43:29,518 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 18:43:29,526 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 18:43:29,526 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:43:29" (1/1) ... [2018-11-18 18:43:29,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:43:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-18 18:43:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-18 18:43:29,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 18:43:29,578 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:30,271 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 18:43:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-11-18 18:43:30,535 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-11-18 18:43:30,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-18 18:43:30,536 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:31,093 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 18:43:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-11-18 18:43:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-11-18 18:43:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 18:43:31,770 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:32,701 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2018-11-18 18:43:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-11-18 18:43:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-11-18 18:43:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 18:43:34,271 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:35,054 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-18 18:43:35,467 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-18 18:43:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-11-18 18:43:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-11-18 18:43:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 18:43:37,688 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:39,269 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-18 18:43:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:39,598 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-18 18:43:40,520 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 18:43:40,960 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-11-18 18:43:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-11-18 18:43:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-11-18 18:43:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 18:43:43,522 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:44,850 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-11-18 18:43:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-11-18 18:43:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-11-18 18:43:49,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 18:43:49,815 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-11-18 18:43:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-11-18 18:43:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 18:43:52,008 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:43:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-11-18 18:43:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-11-18 18:43:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 18:43:52,161 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:43:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:43:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:43:53,317 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-11-18 18:43:53,994 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-18 18:43:56,256 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 18:43:56,525 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 18:43:58,463 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 18:43:59,297 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 18:43:59,668 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 18:44:00,549 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 18:44:02,257 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-18 18:44:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 67 states and 114 transitions. [2018-11-18 18:44:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 114 transitions. [2018-11-18 18:44:02,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 18:44:02,369 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:03,747 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-18 18:44:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 70 states and 120 transitions. [2018-11-18 18:44:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 120 transitions. [2018-11-18 18:44:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 18:44:05,173 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:06,337 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 18:44:07,246 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2018-11-18 18:44:08,272 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2018-11-18 18:44:08,764 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2018-11-18 18:44:09,832 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2018-11-18 18:44:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:10,595 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:44:11,063 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 18:44:11,577 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2018-11-18 18:44:12,093 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 18:44:12,370 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-18 18:44:12,726 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 18:44:14,015 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 18:44:14,642 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:44:15,072 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 18:44:15,394 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 18:44:16,357 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 18:44:16,629 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:44:18,788 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 18:44:19,521 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 18:44:19,868 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 18:44:20,865 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2018-11-18 18:44:21,298 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 18:44:21,931 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 18:44:23,218 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-11-18 18:44:24,734 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-11-18 18:44:27,332 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-18 18:44:27,675 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 18:44:28,444 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 18:44:28,891 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 18:44:29,535 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-18 18:44:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:44:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 88 states and 159 transitions. [2018-11-18 18:44:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 159 transitions. [2018-11-18 18:44:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 18:44:30,835 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:44:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:44:31,808 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-18 18:44:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:44:33,725 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-18 18:44:34,766 WARN L180 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-11-18 18:44:35,491 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:44:36,233 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 18:44:36,712 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-11-18 18:44:37,290 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-11-18 18:44:37,938 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 18:44:39,113 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-18 18:44:39,882 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 18:44:40,311 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:44:40,753 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-18 18:44:41,323 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 18:44:42,574 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-18 18:44:43,220 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 18:44:43,521 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:44:44,529 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 18:44:45,382 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 18:44:45,928 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 18:44:47,078 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 18:44:47,887 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 18:44:48,402 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-18 18:44:49,488 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 18:44:50,178 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:44:50,611 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-18 18:44:51,021 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-18 18:44:51,763 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-18 18:44:52,572 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 18:44:52,933 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-18 18:44:55,236 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-18 18:44:55,647 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 18:44:56,541 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 18:44:57,827 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-18 18:44:59,632 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 18:45:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 107 states and 199 transitions. [2018-11-18 18:45:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 199 transitions. [2018-11-18 18:45:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 18:45:02,629 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:45:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 108 states and 202 transitions. [2018-11-18 18:45:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 202 transitions. [2018-11-18 18:45:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 18:45:05,116 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:45:08,657 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-11-18 18:45:09,671 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-18 18:45:10,102 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 18:45:10,835 WARN L180 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-11-18 18:45:11,660 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:45:12,378 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:45:12,856 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 18:45:14,173 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-11-18 18:45:14,969 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:45:15,873 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:45:16,217 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 18:45:16,698 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-11-18 18:45:17,694 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 18:45:18,597 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 18:45:19,366 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2018-11-18 18:45:20,234 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-18 18:45:21,014 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 18:45:21,555 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-11-18 18:45:22,869 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-11-18 18:45:23,598 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-18 18:45:24,513 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 18:45:25,157 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 18:45:26,792 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 18:45:28,197 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-18 18:45:29,296 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 18:45:30,670 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 18:45:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 123 states and 229 transitions. [2018-11-18 18:45:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 229 transitions. [2018-11-18 18:45:34,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 18:45:34,845 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:45:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 124 states and 233 transitions. [2018-11-18 18:45:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 233 transitions. [2018-11-18 18:45:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 18:45:38,008 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:45:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:45:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 125 states and 234 transitions. [2018-11-18 18:45:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 234 transitions. [2018-11-18 18:45:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 18:45:41,219 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:45:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:45:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:45:47,862 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 18:45:48,712 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2018-11-18 18:45:49,233 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-18 18:45:50,237 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 18:45:51,448 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 18:45:52,042 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-11-18 18:45:52,416 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:45:53,026 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 18:45:53,937 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 18:45:54,657 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-18 18:45:55,100 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 18:45:56,088 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 18:45:57,676 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-18 18:45:58,177 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 18:45:59,880 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 18:46:00,514 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-18 18:46:00,982 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 18:46:02,141 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 18:46:03,336 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 18:46:03,845 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-18 18:46:04,434 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 18:46:05,527 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 18:46:06,587 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 18:46:07,418 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 18:46:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:46:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 140 states and 266 transitions. [2018-11-18 18:46:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 266 transitions. [2018-11-18 18:46:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 18:46:16,034 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:46:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:46:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:46:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:46:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 142 states and 272 transitions. [2018-11-18 18:46:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 272 transitions. [2018-11-18 18:46:22,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 18:46:22,060 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:46:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:46:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:46:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:46:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 143 states and 273 transitions. [2018-11-18 18:46:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 273 transitions. [2018-11-18 18:46:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 18:46:25,992 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:46:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:46:27,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:46:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:46:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 144 states and 274 transitions. [2018-11-18 18:46:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 274 transitions. [2018-11-18 18:46:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 18:46:30,276 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:46:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:46:33,350 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 18 [2018-11-18 18:46:34,913 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2018-11-18 18:46:36,184 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-11-18 18:46:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:46:37,308 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 18:46:40,643 WARN L180 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-11-18 18:46:41,793 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 18:46:43,345 WARN L180 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-11-18 18:46:44,017 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-18 18:46:45,359 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 18:46:47,046 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-11-18 18:46:47,832 WARN L180 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-18 18:46:50,189 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 18:46:50,834 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-11-18 18:46:51,677 WARN L180 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-18 18:46:52,925 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 18:46:54,229 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 18:46:55,053 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-11-18 18:46:55,974 WARN L180 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-18 18:46:57,381 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 18:46:58,591 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 18:46:59,275 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2018-11-18 18:47:00,890 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-11-18 18:47:03,397 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 18:47:03,987 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 18:47:05,444 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 18:47:07,029 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-18 18:47:07,882 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-11-18 18:47:09,019 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-11-18 18:47:12,142 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-11-18 18:47:13,043 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2018-11-18 18:47:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:47:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 153 states and 298 transitions. [2018-11-18 18:47:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 298 transitions. [2018-11-18 18:47:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 18:47:14,459 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:47:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:47:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:47:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:47:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 155 states and 301 transitions. [2018-11-18 18:47:15,827 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 301 transitions. [2018-11-18 18:47:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 18:47:15,828 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:47:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:47:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:47:17,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:47:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 157 states and 305 transitions. [2018-11-18 18:47:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 305 transitions. [2018-11-18 18:47:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 18:47:17,247 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:47:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:47:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:47:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:47:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 158 states and 306 transitions. [2018-11-18 18:47:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 306 transitions. [2018-11-18 18:47:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 18:47:17,934 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:47:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:47:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:47:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:47:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 159 states and 307 transitions. [2018-11-18 18:47:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 307 transitions. [2018-11-18 18:47:18,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 18:47:18,782 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:47:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:47:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:47:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:47:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 160 states and 308 transitions. [2018-11-18 18:47:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 308 transitions. [2018-11-18 18:47:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 18:47:19,335 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:47:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:47:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:47:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:47:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 180 states and 341 transitions. [2018-11-18 18:47:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 341 transitions. [2018-11-18 18:47:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 18:47:25,907 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:47:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:47:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:47:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:47:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 185 states and 352 transitions. [2018-11-18 18:47:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 352 transitions. [2018-11-18 18:47:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 18:47:27,899 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:47:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:47:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:47:32,902 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-18 18:47:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:47:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 206 states and 383 transitions. [2018-11-18 18:47:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 383 transitions. [2018-11-18 18:47:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 18:47:38,172 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:47:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:47:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:47:38,518 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2018-11-18 18:47:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:47:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 211 states and 395 transitions. [2018-11-18 18:47:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 395 transitions. [2018-11-18 18:47:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 18:47:40,777 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:47:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:47:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 18:47:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:47:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 211 states and 386 transitions. [2018-11-18 18:47:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 386 transitions. [2018-11-18 18:47:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 18:47:41,999 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:47:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:47:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:47:46,670 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2018-11-18 18:47:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:47:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 241 states and 463 transitions. [2018-11-18 18:47:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 463 transitions. [2018-11-18 18:47:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 18:47:56,141 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:47:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:47:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 250 states and 480 transitions. [2018-11-18 18:48:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 480 transitions. [2018-11-18 18:48:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:48:00,100 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 265 states and 520 transitions. [2018-11-18 18:48:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 520 transitions. [2018-11-18 18:48:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:48:10,834 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:11,738 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-18 18:48:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 274 states and 535 transitions. [2018-11-18 18:48:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 535 transitions. [2018-11-18 18:48:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 18:48:15,341 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:23,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 285 states and 556 transitions. [2018-11-18 18:48:23,823 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 556 transitions. [2018-11-18 18:48:23,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 18:48:23,823 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 293 states and 572 transitions. [2018-11-18 18:48:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 572 transitions. [2018-11-18 18:48:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 18:48:27,826 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 304 states and 596 transitions. [2018-11-18 18:48:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 596 transitions. [2018-11-18 18:48:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 18:48:35,543 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 306 states and 600 transitions. [2018-11-18 18:48:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 600 transitions. [2018-11-18 18:48:37,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 18:48:37,637 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:37,671 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 309 states and 611 transitions. [2018-11-18 18:48:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 611 transitions. [2018-11-18 18:48:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 18:48:38,746 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 315 states and 624 transitions. [2018-11-18 18:48:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 624 transitions. [2018-11-18 18:48:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 18:48:44,532 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 317 states and 634 transitions. [2018-11-18 18:48:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 634 transitions. [2018-11-18 18:48:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 18:48:46,344 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:47,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 320 states and 645 transitions. [2018-11-18 18:48:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 645 transitions. [2018-11-18 18:48:47,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 18:48:47,787 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 328 states and 665 transitions. [2018-11-18 18:48:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 665 transitions. [2018-11-18 18:48:51,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 18:48:51,466 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:52,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 331 states and 676 transitions. [2018-11-18 18:48:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 676 transitions. [2018-11-18 18:48:52,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 18:48:52,375 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 335 states and 688 transitions. [2018-11-18 18:48:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 688 transitions. [2018-11-18 18:48:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 18:48:53,960 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 337 states and 693 transitions. [2018-11-18 18:48:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 693 transitions. [2018-11-18 18:48:54,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 18:48:54,585 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:48:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:48:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:48:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 344 states and 714 transitions. [2018-11-18 18:48:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 714 transitions. [2018-11-18 18:48:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 18:48:59,854 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:48:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:49:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:49:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:49:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 346 states and 718 transitions. [2018-11-18 18:49:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 718 transitions. [2018-11-18 18:49:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 18:49:00,852 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:49:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:49:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:49:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:49:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 351 states and 732 transitions. [2018-11-18 18:49:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 732 transitions. [2018-11-18 18:49:03,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 18:49:03,175 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:49:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:49:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:49:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:49:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 355 states and 743 transitions. [2018-11-18 18:49:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 743 transitions. [2018-11-18 18:49:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 18:49:04,865 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:49:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:49:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:49:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:49:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:49:06,299 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 52 iterations. [2018-11-18 18:49:06,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 06:49:06 ImpRootNode [2018-11-18 18:49:06,393 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 18:49:06,393 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 18:49:06,393 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 18:49:06,393 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 18:49:06,394 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:43:29" (3/4) ... [2018-11-18 18:49:06,396 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 18:49:06,515 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3b2af601-813d-40f3-b1f1-96a1d7c1c5b9/bin-2019/ukojak/witness.graphml [2018-11-18 18:49:06,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 18:49:06,515 INFO L168 Benchmark]: Toolchain (without parser) took 344642.38 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 962.3 MB in the beginning and 1.8 GB in the end (delta: -799.7 MB). Peak memory consumption was 256.2 MB. Max. memory is 11.5 GB. [2018-11-18 18:49:06,516 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:49:06,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.99 ms. Allocated memory is still 1.0 GB. Free memory was 962.3 MB in the beginning and 940.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 18:49:06,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 197.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-18 18:49:06,517 INFO L168 Benchmark]: Boogie Preprocessor took 86.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:49:06,517 INFO L168 Benchmark]: RCFGBuilder took 6655.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 816.2 MB in the end (delta: 318.6 MB). Peak memory consumption was 318.6 MB. Max. memory is 11.5 GB. [2018-11-18 18:49:06,519 INFO L168 Benchmark]: CodeCheck took 336874.53 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 911.7 MB). Free memory was 816.2 MB in the beginning and 1.8 GB in the end (delta: -968.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:49:06,519 INFO L168 Benchmark]: Witness Printer took 121.68 ms. Allocated memory is still 2.1 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-18 18:49:06,521 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, 130 locations, 1 error locations. UNSAFE Result, 336.7s OverallTime, 52 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 155975676 SDtfs, -1846269046 SDslu, 601186976 SDs, 0 SdLazy, 2082249598 SolverSat, -1820064172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 257.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15108 GetRequests, 13236 SyntacticMatches, 820 SemanticMatches, 1052 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678949 ImplicationChecksByTransitivity, 321.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 50.3s InterpolantComputationTime, 1546 NumberOfCodeBlocks, 1546 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1443 ConstructedInterpolants, 0 QuantifiedInterpolants, 515902 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 10 PerfectInterpolantSequences, 179/854 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: 601]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L74] port_t p13 ; [L78] port_t p21 ; [L82] port_t p23 ; [L86] port_t p31 ; [L90] port_t p32 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] ep12 = __VERIFIER_nondet_bool() [L528] ep13 = __VERIFIER_nondet_bool() [L529] ep21 = __VERIFIER_nondet_bool() [L530] ep23 = __VERIFIER_nondet_bool() [L531] ep31 = __VERIFIER_nondet_bool() [L532] ep32 = __VERIFIER_nondet_bool() [L533] id1 = __VERIFIER_nondet_char() [L534] r1 = __VERIFIER_nondet_char() [L535] st1 = __VERIFIER_nondet_char() [L536] nl1 = __VERIFIER_nondet_char() [L537] m1 = __VERIFIER_nondet_char() [L538] max1 = __VERIFIER_nondet_char() [L539] mode1 = __VERIFIER_nondet_bool() [L540] id2 = __VERIFIER_nondet_char() [L541] r2 = __VERIFIER_nondet_char() [L542] st2 = __VERIFIER_nondet_char() [L543] nl2 = __VERIFIER_nondet_char() [L544] m2 = __VERIFIER_nondet_char() [L545] max2 = __VERIFIER_nondet_char() [L546] mode2 = __VERIFIER_nondet_bool() [L547] id3 = __VERIFIER_nondet_char() [L548] r3 = __VERIFIER_nondet_char() [L549] st3 = __VERIFIER_nondet_char() [L550] nl3 = __VERIFIER_nondet_char() [L551] m3 = __VERIFIER_nondet_char() [L552] max3 = __VERIFIER_nondet_char() [L553] mode3 = __VERIFIER_nondet_bool() [L554] CALL, EXPR init() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND FALSE !(\read(r121)) [L277] COND TRUE \read(r131) [L278] COND TRUE \read(ep32) [L279] tmp = 1 [L286] r122 = (_Bool )tmp [L287] COND TRUE \read(r131) [L288] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND FALSE !(\read(r211)) [L303] COND TRUE \read(r231) [L304] COND TRUE \read(ep31) [L305] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND TRUE \read(r231) [L314] tmp___2 = 1 [L325] r232 = (_Bool )tmp___2 [L326] COND TRUE \read(r311) [L327] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND TRUE \read(r321) [L340] tmp___4 = 1 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE \read(r122) [L362] COND TRUE \read(r132) [L363] COND TRUE \read(r212) [L364] COND TRUE \read(r232) [L365] COND TRUE \read(r312) [L366] COND TRUE \read(r322) [L367] COND TRUE (int )max1 == (int )id1 [L368] COND TRUE (int )max2 == (int )id2 [L369] COND TRUE (int )max3 == (int )id3 [L370] COND TRUE (int )st1 == 0 [L371] COND TRUE (int )st2 == 0 [L372] COND TRUE (int )st3 == 0 [L373] COND TRUE (int )nl1 == 0 [L374] COND TRUE (int )nl2 == 0 [L375] COND TRUE (int )nl3 == 0 [L376] COND TRUE (int )mode1 == 0 [L377] COND TRUE (int )mode2 == 0 [L378] COND TRUE (int )mode3 == 0 [L379] tmp___5 = 1 [L461] RET return (tmp___5); [L554] EXPR init() [L554] i2 = init() [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND FALSE !(\read(ep12)) [L149] COND TRUE \read(ep13) [L150] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L150] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L153] RET mode1 = (_Bool)1 [L571] node1() [L572] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND FALSE !(\read(ep21)) [L192] COND TRUE \read(ep23) [L193] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] RET mode2 = (_Bool)1 [L572] node2() [L573] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND TRUE \read(ep32) [L236] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] RET mode3 = (_Bool)1 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=7, m2=7, m3=5, max1=0, max2=8, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND FALSE !(\read(ep21)) [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND TRUE (int )m1 > (int )max1 [L133] max1 = m1 [L136] COND FALSE !((int )r1 == 2) [L143] RET mode1 = (_Bool)0 [L571] node1() [L572] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND FALSE !((int )r2 == 2) [L186] RET mode2 = (_Bool)0 [L572] node2() [L573] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND TRUE \read(ep13) [L209] m3 = p13_old [L210] p13_old = nomsg [L211] COND FALSE !((int )m3 > (int )max3) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND TRUE (int )m3 > (int )max3 [L219] max3 = m3 [L222] COND FALSE !((int )r3 == 2) [L229] RET mode3 = (_Bool)0 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L478] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L587] assert(c1) [L588] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=0, mode2=0, mode3=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] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND FALSE !(\read(ep12)) [L149] COND TRUE \read(ep13) [L150] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L150] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L153] RET mode1 = (_Bool)1 [L571] node1() [L572] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND FALSE !(\read(ep21)) [L192] COND TRUE \read(ep23) [L193] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] RET mode2 = (_Bool)1 [L572] node2() [L573] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND TRUE \read(ep32) [L236] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] RET mode3 = (_Bool)1 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=6, m2=6, m3=8, max1=6, max2=8, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=6, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=8, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=8, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND FALSE !(\read(ep21)) [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND TRUE (int )m1 > (int )max1 [L133] max1 = m1 [L136] COND TRUE (int )r1 == 2 [L137] COND FALSE !((int )max1 == (int )id1) [L140] st1 = (char)1 [L143] RET mode1 = (_Bool)0 [L571] node1() [L572] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND TRUE (int )r2 == 2 [L180] COND TRUE (int )max2 == (int )id2 [L181] st2 = (char)1 [L186] RET mode2 = (_Bool)0 [L572] node2() [L573] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND TRUE \read(ep13) [L209] m3 = p13_old [L210] p13_old = nomsg [L211] COND FALSE !((int )m3 > (int )max3) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND FALSE !((int )m3 > (int )max3) [L222] COND TRUE (int )r3 == 2 [L223] COND FALSE !((int )max3 == (int )id3) [L226] nl3 = (char)1 [L229] RET mode3 = (_Bool)0 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=8, m2=8, m3=8, max1=8, max2=8, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=1, st2=1, st3=0] [L469] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L515] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=8, m2=8, m3=8, max1=8, max2=8, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=1, st2=1, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=8, m2=8, m3=8, max1=8, max2=8, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=1, st2=1, st3=0] [L601] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=0, id2=8, id3=6, m1=8, m2=8, m3=8, max1=8, max2=8, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 692.99 ms. Allocated memory is still 1.0 GB. Free memory was 962.3 MB in the beginning and 940.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 197.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 6655.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 816.2 MB in the end (delta: 318.6 MB). Peak memory consumption was 318.6 MB. Max. memory is 11.5 GB. * CodeCheck took 336874.53 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 911.7 MB). Free memory was 816.2 MB in the beginning and 1.8 GB in the end (delta: -968.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 121.68 ms. Allocated memory is still 2.1 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...