./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.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_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/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 00d162608be697d65baff4581155da4ea0225a1e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 17:24:59,619 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:24:59,620 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:24:59,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:24:59,629 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:24:59,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:24:59,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:24:59,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:24:59,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:24:59,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:24:59,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:24:59,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:24:59,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:24:59,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:24:59,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:24:59,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:24:59,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:24:59,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:24:59,643 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:24:59,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:24:59,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:24:59,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:24:59,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:24:59,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:24:59,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:24:59,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:24:59,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:24:59,652 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:24:59,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:24:59,654 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:24:59,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:24:59,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:24:59,655 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:24:59,655 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:24:59,656 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:24:59,656 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:24:59,656 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 17:24:59,668 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:24:59,669 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:24:59,669 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:24:59,669 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 17:24:59,670 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 17:24:59,670 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 17:24:59,670 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:24:59,670 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:24:59,671 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:24:59,671 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:24:59,671 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:24:59,671 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:24:59,671 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:24:59,671 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:24:59,671 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:24:59,671 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:24:59,672 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:24:59,672 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:24:59,672 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 17:24:59,673 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 17:24:59,674 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:24:59,674 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:24:59,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 17:24:59,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:24:59,674 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:24:59,674 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:24:59,674 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 17:24:59,674 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:24:59,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:24:59,674 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_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/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 -> 00d162608be697d65baff4581155da4ea0225a1e [2018-11-18 17:24:59,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:24:59,709 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:24:59,712 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:24:59,713 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:24:59,713 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:24:59,714 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c [2018-11-18 17:24:59,756 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/bin-2019/ukojak/data/8eea59628/c6125a78e68540f2ba0cd03ee05108f7/FLAG9eec3ff27 [2018-11-18 17:25:00,127 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:25:00,128 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c [2018-11-18 17:25:00,137 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/bin-2019/ukojak/data/8eea59628/c6125a78e68540f2ba0cd03ee05108f7/FLAG9eec3ff27 [2018-11-18 17:25:00,148 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/bin-2019/ukojak/data/8eea59628/c6125a78e68540f2ba0cd03ee05108f7 [2018-11-18 17:25:00,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:25:00,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:25:00,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:25:00,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:25:00,155 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:25:00,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:25:00" (1/1) ... [2018-11-18 17:25:00,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae989df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:25:00, skipping insertion in model container [2018-11-18 17:25:00,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:25:00" (1/1) ... [2018-11-18 17:25:00,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:25:00,197 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:25:00,367 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:25:00,378 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:25:00,463 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:25:00,478 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:25:00,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:25:00 WrapperNode [2018-11-18 17:25:00,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:25:00,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:25:00,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:25:00,480 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:25:00,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:25:00" (1/1) ... [2018-11-18 17:25:00,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:25:00" (1/1) ... [2018-11-18 17:25:00,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:25:00,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:25:00,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:25:00,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:25:00,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:25:00" (1/1) ... [2018-11-18 17:25:00,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:25:00" (1/1) ... [2018-11-18 17:25:00,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:25:00" (1/1) ... [2018-11-18 17:25:00,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:25:00" (1/1) ... [2018-11-18 17:25:00,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:25:00" (1/1) ... [2018-11-18 17:25:00,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:25:00" (1/1) ... [2018-11-18 17:25:00,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:25:00" (1/1) ... [2018-11-18 17:25:00,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:25:00,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:25:00,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:25:00,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:25:00,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:25:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/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 17:25:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:25:00,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:25:02,417 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:25:02,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:25:02 BoogieIcfgContainer [2018-11-18 17:25:02,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:25:02,418 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 17:25:02,419 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 17:25:02,426 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 17:25:02,426 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:25:02" (1/1) ... [2018-11-18 17:25:02,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:25:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-18 17:25:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-18 17:25:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 17:25:02,464 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:02,791 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 17:25:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-18 17:25:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-18 17:25:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-18 17:25:02,881 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:03,010 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 17:25:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 26 states and 41 transitions. [2018-11-18 17:25:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2018-11-18 17:25:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 17:25:03,209 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:03,308 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 17:25:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 31 states and 50 transitions. [2018-11-18 17:25:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-11-18 17:25:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 17:25:03,613 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:03,709 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 17:25:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 37 states and 61 transitions. [2018-11-18 17:25:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2018-11-18 17:25:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 17:25:04,150 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:04,262 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 17:25:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 74 transitions. [2018-11-18 17:25:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2018-11-18 17:25:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 17:25:04,975 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:05,181 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 17:25:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2018-11-18 17:25:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-11-18 17:25:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 17:25:05,998 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:06,065 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 17:25:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 53 states and 86 transitions. [2018-11-18 17:25:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2018-11-18 17:25:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 17:25:06,218 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:06,255 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 17:25:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 54 states and 87 transitions. [2018-11-18 17:25:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 87 transitions. [2018-11-18 17:25:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 17:25:06,272 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:06,463 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 17:25:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 65 states and 104 transitions. [2018-11-18 17:25:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2018-11-18 17:25:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 17:25:08,108 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:08,280 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 17:25:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 68 states and 109 transitions. [2018-11-18 17:25:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 109 transitions. [2018-11-18 17:25:08,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 17:25:08,532 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:09,410 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 17:25:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 86 states and 139 transitions. [2018-11-18 17:25:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 139 transitions. [2018-11-18 17:25:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 17:25:12,767 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:13,054 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 17:25:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 104 states and 170 transitions. [2018-11-18 17:25:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2018-11-18 17:25:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 17:25:16,124 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:16,321 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 17:25:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 105 states and 172 transitions. [2018-11-18 17:25:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 172 transitions. [2018-11-18 17:25:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 17:25:16,588 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:17,325 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 17:25:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 125 states and 206 transitions. [2018-11-18 17:25:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 206 transitions. [2018-11-18 17:25:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 17:25:21,150 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:21,237 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 17:25:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 126 states and 209 transitions. [2018-11-18 17:25:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 209 transitions. [2018-11-18 17:25:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 17:25:21,655 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:21,746 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 17:25:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 127 states and 213 transitions. [2018-11-18 17:25:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 213 transitions. [2018-11-18 17:25:22,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 17:25:22,134 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:22,724 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 17:25:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 142 states and 242 transitions. [2018-11-18 17:25:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 242 transitions. [2018-11-18 17:25:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 17:25:26,077 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:26,136 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 17:25:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 145 states and 251 transitions. [2018-11-18 17:25:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 251 transitions. [2018-11-18 17:25:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 17:25:27,037 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:27,094 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 17:25:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 146 states and 254 transitions. [2018-11-18 17:25:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 254 transitions. [2018-11-18 17:25:27,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 17:25:27,394 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:28,609 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 17:25:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 168 states and 289 transitions. [2018-11-18 17:25:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 289 transitions. [2018-11-18 17:25:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 17:25:34,393 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:35,009 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 17:25:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 173 states and 298 transitions. [2018-11-18 17:25:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 298 transitions. [2018-11-18 17:25:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:25:36,711 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:37,758 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 17:25:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 182 states and 317 transitions. [2018-11-18 17:25:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 317 transitions. [2018-11-18 17:25:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 17:25:42,326 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:43,680 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 17:25:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 197 states and 368 transitions. [2018-11-18 17:25:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 368 transitions. [2018-11-18 17:25:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 17:25:50,226 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:25:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:25:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 212 states and 400 transitions. [2018-11-18 17:25:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 400 transitions. [2018-11-18 17:25:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 17:25:59,423 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:25:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:25:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:26:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 214 states and 413 transitions. [2018-11-18 17:26:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 413 transitions. [2018-11-18 17:26:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 17:26:00,221 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:01,231 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 17:26:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 225 states and 433 transitions. [2018-11-18 17:26:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 433 transitions. [2018-11-18 17:26:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 17:26:06,226 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:06,282 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 17:26:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 227 states and 437 transitions. [2018-11-18 17:26:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 437 transitions. [2018-11-18 17:26:06,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 17:26:06,837 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:06,945 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 17:26:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 229 states and 438 transitions. [2018-11-18 17:26:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 438 transitions. [2018-11-18 17:26:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 17:26:07,524 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:26:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 245 states and 474 transitions. [2018-11-18 17:26:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 474 transitions. [2018-11-18 17:26:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 17:26:17,040 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:26:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 247 states and 477 transitions. [2018-11-18 17:26:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 477 transitions. [2018-11-18 17:26:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 17:26:17,850 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:26:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 249 states and 485 transitions. [2018-11-18 17:26:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 485 transitions. [2018-11-18 17:26:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 17:26:18,711 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:19,923 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 17:26:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 256 states and 502 transitions. [2018-11-18 17:26:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 502 transitions. [2018-11-18 17:26:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 17:26:25,783 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:25,999 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 17:26:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 261 states and 519 transitions. [2018-11-18 17:26:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 519 transitions. [2018-11-18 17:26:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 17:26:28,436 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:28,685 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 17:26:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 264 states and 533 transitions. [2018-11-18 17:26:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 533 transitions. [2018-11-18 17:26:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 17:26:30,050 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:30,244 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 17:26:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 265 states and 534 transitions. [2018-11-18 17:26:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 534 transitions. [2018-11-18 17:26:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 17:26:30,778 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:32,374 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 17:26:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 283 states and 582 transitions. [2018-11-18 17:26:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 582 transitions. [2018-11-18 17:26:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 17:26:40,498 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:40,569 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 17:26:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 285 states and 588 transitions. [2018-11-18 17:26:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 588 transitions. [2018-11-18 17:26:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 17:26:41,316 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:41,379 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 17:26:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 286 states and 599 transitions. [2018-11-18 17:26:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 599 transitions. [2018-11-18 17:26:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 17:26:42,143 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:42,484 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 17:26:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 290 states and 609 transitions. [2018-11-18 17:26:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 609 transitions. [2018-11-18 17:26:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 17:26:45,274 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:26:45,436 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 17:26:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 17:26:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 296 states and 628 transitions. [2018-11-18 17:26:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 628 transitions. [2018-11-18 17:26:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 17:26:49,344 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 17:26:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:26:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:26:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:26:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:26:52,046 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 41 iterations. [2018-11-18 17:26:52,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 05:26:52 ImpRootNode [2018-11-18 17:26:52,162 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 17:26:52,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:26:52,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:26:52,163 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:26:52,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:25:02" (3/4) ... [2018-11-18 17:26:52,166 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 17:26:52,280 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_392b3fd5-8222-4b3e-a9ee-f2116b26cd0c/bin-2019/ukojak/witness.graphml [2018-11-18 17:26:52,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:26:52,281 INFO L168 Benchmark]: Toolchain (without parser) took 112130.03 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 960.2 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 248.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:26:52,282 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:26:52,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -194.9 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:26:52,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:26:52,283 INFO L168 Benchmark]: Boogie Preprocessor took 28.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:26:52,283 INFO L168 Benchmark]: RCFGBuilder took 1871.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.9 MB). Peak memory consumption was 329.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:26:52,283 INFO L168 Benchmark]: CodeCheck took 109743.39 ms. Allocated memory was 1.3 GB in the beginning and 2.4 GB in the end (delta: 1.1 GB). Free memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: -819.8 MB). Peak memory consumption was 268.1 MB. Max. memory is 11.5 GB. [2018-11-18 17:26:52,284 INFO L168 Benchmark]: Witness Printer took 118.08 ms. Allocated memory is still 2.4 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:26:52,285 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, 136 locations, 1 error locations. UNSAFE Result, 109.6s OverallTime, 41 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 1184513400 SDslu, -1161396476 SDs, 0 SdLazy, 1735430888 SolverSat, 1100878296 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 63.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11413 GetRequests, 9799 SyntacticMatches, 664 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567025 ImplicationChecksByTransitivity, 99.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 1208 NumberOfCodeBlocks, 1208 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1116 ConstructedInterpolants, 0 QuantifiedInterpolants, 522736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 10 PerfectInterpolantSequences, 127/681 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: 610]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] char id2 ; [L103] unsigned char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] char id3 ; [L110] unsigned char r3 ; [L111] char st3 ; [L112] char nl3 ; [L113] char m3 ; [L114] char max3 ; [L115] _Bool mode3 ; [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L75] port_t p13 ; [L79] port_t p21 ; [L83] port_t p23 ; [L87] port_t p31 ; [L91] port_t p32 ; [L254] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L532] int c1 ; [L533] int i2 ; [L536] c1 = 0 [L537] ep12 = __VERIFIER_nondet_bool() [L538] ep13 = __VERIFIER_nondet_bool() [L539] ep21 = __VERIFIER_nondet_bool() [L540] ep23 = __VERIFIER_nondet_bool() [L541] ep31 = __VERIFIER_nondet_bool() [L542] ep32 = __VERIFIER_nondet_bool() [L543] id1 = __VERIFIER_nondet_char() [L544] r1 = __VERIFIER_nondet_uchar() [L545] st1 = __VERIFIER_nondet_char() [L546] nl1 = __VERIFIER_nondet_char() [L547] m1 = __VERIFIER_nondet_char() [L548] max1 = __VERIFIER_nondet_char() [L549] mode1 = __VERIFIER_nondet_bool() [L550] id2 = __VERIFIER_nondet_char() [L551] r2 = __VERIFIER_nondet_uchar() [L552] st2 = __VERIFIER_nondet_char() [L553] nl2 = __VERIFIER_nondet_char() [L554] m2 = __VERIFIER_nondet_char() [L555] max2 = __VERIFIER_nondet_char() [L556] mode2 = __VERIFIER_nondet_bool() [L557] id3 = __VERIFIER_nondet_char() [L558] r3 = __VERIFIER_nondet_uchar() [L559] st3 = __VERIFIER_nondet_char() [L560] nl3 = __VERIFIER_nondet_char() [L561] m3 = __VERIFIER_nondet_char() [L562] max3 = __VERIFIER_nondet_char() [L563] mode3 = __VERIFIER_nondet_bool() [L564] CALL, EXPR init() [L257] _Bool r121 ; [L258] _Bool r131 ; [L259] _Bool r211 ; [L260] _Bool r231 ; [L261] _Bool r311 ; [L262] _Bool r321 ; [L263] _Bool r122 ; [L264] int tmp ; [L265] _Bool r132 ; [L266] int tmp___0 ; [L267] _Bool r212 ; [L268] int tmp___1 ; [L269] _Bool r232 ; [L270] int tmp___2 ; [L271] _Bool r312 ; [L272] int tmp___3 ; [L273] _Bool r322 ; [L274] int tmp___4 ; [L275] int tmp___5 ; [L278] r121 = ep12 [L279] r131 = ep13 [L280] r211 = ep21 [L281] r231 = ep23 [L282] r311 = ep31 [L283] r321 = ep32 [L284] COND FALSE !(\read(r121)) [L287] COND TRUE \read(r131) [L288] COND TRUE \read(ep32) [L289] tmp = 1 [L296] r122 = (_Bool )tmp [L297] COND TRUE \read(r131) [L298] tmp___0 = 1 [L309] r132 = (_Bool )tmp___0 [L310] COND FALSE !(\read(r211)) [L313] COND TRUE \read(r231) [L314] COND TRUE \read(ep31) [L315] tmp___1 = 1 [L322] r212 = (_Bool )tmp___1 [L323] COND TRUE \read(r231) [L324] tmp___2 = 1 [L335] r232 = (_Bool )tmp___2 [L336] COND TRUE \read(r311) [L337] tmp___3 = 1 [L348] r312 = (_Bool )tmp___3 [L349] COND TRUE \read(r321) [L350] tmp___4 = 1 [L361] r322 = (_Bool )tmp___4 [L362] COND TRUE (int )id1 != (int )id2 [L363] COND TRUE (int )id1 != (int )id3 [L364] COND TRUE (int )id2 != (int )id3 [L365] COND TRUE (int )id1 >= 0 [L366] COND TRUE (int )id2 >= 0 [L367] COND TRUE (int )id3 >= 0 [L368] COND TRUE (int )r1 == 0 [L369] COND TRUE (int )r2 == 0 [L370] COND TRUE (int )r3 == 0 [L371] COND TRUE \read(r122) [L372] COND TRUE \read(r132) [L373] COND TRUE \read(r212) [L374] COND TRUE \read(r232) [L375] COND TRUE \read(r312) [L376] COND TRUE \read(r322) [L377] COND TRUE (int )max1 == (int )id1 [L378] COND TRUE (int )max2 == (int )id2 [L379] COND TRUE (int )max3 == (int )id3 [L380] COND TRUE (int )st1 == 0 [L381] COND TRUE (int )st2 == 0 [L382] COND TRUE (int )st3 == 0 [L383] COND TRUE (int )nl1 == 0 [L384] COND TRUE (int )nl2 == 0 [L385] COND TRUE (int )nl3 == 0 [L386] COND TRUE (int )mode1 == 0 [L387] COND TRUE (int )mode2 == 0 [L388] COND TRUE (int )mode3 == 0 [L389] tmp___5 = 1 [L471] RET return (tmp___5); [L564] EXPR init() [L564] i2 = init() [L566] p12_old = nomsg [L567] p12_new = nomsg [L568] p13_old = nomsg [L569] p13_new = nomsg [L570] p21_old = nomsg [L571] p21_new = nomsg [L572] p23_old = nomsg [L573] p23_new = nomsg [L574] p31_old = nomsg [L575] p31_new = nomsg [L576] p32_old = nomsg [L577] p32_new = nomsg [L578] i2 = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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] [L579] COND TRUE 1 [L581] CALL node1() [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND FALSE !(\read(ep12)) [L153] COND TRUE \read(ep13) [L154] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L154] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L157] RET mode1 = (_Bool)1 [L581] node1() [L582] CALL node2() [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND FALSE !(\read(ep21)) [L199] COND TRUE \read(ep23) [L200] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L200] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L203] RET mode2 = (_Bool)1 [L582] node2() [L583] CALL node3() [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND TRUE \read(ep32) [L246] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] RET mode3 = (_Bool)1 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, 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=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=4, m3=2, max1=3, max2=5, max3=4, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L597] assert(c1) [L579] COND TRUE 1 [L581] CALL node1() [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND FALSE !(\read(ep21)) [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND TRUE (int )m1 > (int )max1 [L137] max1 = m1 [L140] COND FALSE !((int )r1 == 2) [L147] RET mode1 = (_Bool)0 [L581] node1() [L582] CALL node2() [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [L186] COND FALSE !((int )r2 == 2) [L193] RET mode2 = (_Bool)0 [L582] node2() [L583] CALL node3() [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND TRUE \read(ep13) [L219] m3 = p13_old [L220] p13_old = nomsg [L221] COND FALSE !((int )m3 > (int )max3) [L225] COND TRUE \read(ep23) [L226] m3 = p23_old [L227] p23_old = nomsg [L228] COND TRUE (int )m3 > (int )max3 [L229] max3 = m3 [L232] COND FALSE !((int )r3 == 2) [L239] RET mode3 = (_Bool)0 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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 )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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] [L597] assert(c1) [L579] COND TRUE 1 [L581] CALL node1() [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND FALSE !(\read(ep12)) [L153] COND TRUE \read(ep13) [L154] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L154] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L157] RET mode1 = (_Bool)1 [L581] node1() [L582] CALL node2() [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND FALSE !(\read(ep21)) [L199] COND TRUE \read(ep23) [L200] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L200] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L203] RET mode2 = (_Bool)1 [L582] node2() [L583] CALL node3() [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND TRUE \read(ep32) [L246] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] RET mode3 = (_Bool)1 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, 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=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=4, m2=4, m3=5, max1=4, max2=5, max3=5, 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=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] assert(c1) [L579] COND TRUE 1 [L581] CALL node1() [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND FALSE !(\read(ep21)) [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND TRUE (int )m1 > (int )max1 [L137] max1 = m1 [L140] COND TRUE (int )r1 == 2 [L141] COND FALSE !((int )max1 == (int )id1) [L144] st1 = (char)1 [L147] RET mode1 = (_Bool)0 [L581] node1() [L582] CALL node2() [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [L186] COND TRUE (int )r2 == 2 [L187] COND TRUE (int )max2 == (int )id2 [L188] st2 = (char)1 [L193] RET mode2 = (_Bool)0 [L582] node2() [L583] CALL node3() [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND TRUE \read(ep13) [L219] m3 = p13_old [L220] p13_old = nomsg [L221] COND FALSE !((int )m3 > (int )max3) [L225] COND TRUE \read(ep23) [L226] m3 = p23_old [L227] p23_old = nomsg [L228] COND FALSE !((int )m3 > (int )max3) [L232] COND TRUE (int )r3 == 2 [L233] COND FALSE !((int )max3 == (int )id3) [L236] nl3 = (char)1 [L239] RET mode3 = (_Bool)0 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=5, m3=5, max1=5, max2=5, max3=5, 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] [L479] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L525] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=5, m3=5, max1=5, max2=5, max3=5, 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] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=5, m3=5, max1=5, max2=5, max3=5, 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] [L610] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=5, m3=5, max1=5, max2=5, max3=5, 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -194.9 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1871.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.9 MB). Peak memory consumption was 329.8 MB. Max. memory is 11.5 GB. * CodeCheck took 109743.39 ms. Allocated memory was 1.3 GB in the beginning and 2.4 GB in the end (delta: 1.1 GB). Free memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: -819.8 MB). Peak memory consumption was 268.1 MB. Max. memory is 11.5 GB. * Witness Printer took 118.08 ms. Allocated memory is still 2.4 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...