./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/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 fca7014573b2ba8b0b911628482f19638a6ab990 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-11-10 12:03:20,234 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:03:20,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:03:20,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:03:20,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:03:20,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:03:20,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:03:20,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:03:20,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:03:20,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:03:20,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:03:20,249 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:03:20,250 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:03:20,250 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:03:20,251 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:03:20,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:03:20,252 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:03:20,253 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:03:20,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:03:20,255 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:03:20,256 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:03:20,257 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:03:20,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:03:20,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:03:20,259 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:03:20,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:03:20,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:03:20,260 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:03:20,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:03:20,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:03:20,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:03:20,262 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:03:20,262 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:03:20,262 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:03:20,263 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:03:20,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:03:20,264 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 12:03:20,273 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:03:20,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:03:20,274 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:03:20,274 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:03:20,274 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:03:20,274 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:03:20,275 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:03:20,275 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:03:20,275 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:03:20,275 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:03:20,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:03:20,275 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:03:20,275 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:03:20,275 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:03:20,276 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:03:20,276 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:03:20,276 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:03:20,276 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 12:03:20,276 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 12:03:20,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:03:20,276 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:03:20,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 12:03:20,277 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:03:20,277 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:03:20,277 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:03:20,277 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 12:03:20,277 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:03:20,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:03:20,277 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_da8830bb-67f2-4a25-967b-25f9f0dfb2af/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 -> fca7014573b2ba8b0b911628482f19638a6ab990 [2018-11-10 12:03:20,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:03:20,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:03:20,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:03:20,313 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:03:20,313 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:03:20,314 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c [2018-11-10 12:03:20,357 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/bin-2019/ukojak/data/ef6d3f9e3/e34f61a4728f4f749a6e5700f7c9b5c1/FLAG163836be5 [2018-11-10 12:03:20,780 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:03:20,780 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c [2018-11-10 12:03:20,786 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/bin-2019/ukojak/data/ef6d3f9e3/e34f61a4728f4f749a6e5700f7c9b5c1/FLAG163836be5 [2018-11-10 12:03:20,795 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/bin-2019/ukojak/data/ef6d3f9e3/e34f61a4728f4f749a6e5700f7c9b5c1 [2018-11-10 12:03:20,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:03:20,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:03:20,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:03:20,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:03:20,801 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:03:20,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:03:20" (1/1) ... [2018-11-10 12:03:20,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626e2faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:20, skipping insertion in model container [2018-11-10 12:03:20,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:03:20" (1/1) ... [2018-11-10 12:03:20,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:03:20,838 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:03:20,972 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:03:20,977 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:03:21,014 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:03:21,024 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:03:21,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:21 WrapperNode [2018-11-10 12:03:21,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:03:21,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:03:21,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:03:21,025 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:03:21,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:21" (1/1) ... [2018-11-10 12:03:21,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:21" (1/1) ... [2018-11-10 12:03:21,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:03:21,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:03:21,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:03:21,105 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:03:21,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:21" (1/1) ... [2018-11-10 12:03:21,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:21" (1/1) ... [2018-11-10 12:03:21,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:21" (1/1) ... [2018-11-10 12:03:21,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:21" (1/1) ... [2018-11-10 12:03:21,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:21" (1/1) ... [2018-11-10 12:03:21,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:21" (1/1) ... [2018-11-10 12:03:21,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:21" (1/1) ... [2018-11-10 12:03:21,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:03:21,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:03:21,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:03:21,130 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:03:21,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/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-10 12:03:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:03:21,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:03:23,131 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:03:23,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:03:23 BoogieIcfgContainer [2018-11-10 12:03:23,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:03:23,133 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 12:03:23,133 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 12:03:23,139 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 12:03:23,139 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:03:23" (1/1) ... [2018-11-10 12:03:23,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:03:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-10 12:03:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-10 12:03:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 12:03:23,172 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:23,549 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-10 12:03:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-10 12:03:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-10 12:03:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 12:03:23,633 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:23,785 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-10 12:03:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 26 states and 41 transitions. [2018-11-10 12:03:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2018-11-10 12:03:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 12:03:24,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:24,394 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-10 12:03:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 31 states and 50 transitions. [2018-11-10 12:03:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-11-10 12:03:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 12:03:24,697 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:24,874 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-10 12:03:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 37 states and 61 transitions. [2018-11-10 12:03:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2018-11-10 12:03:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 12:03:25,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:25,600 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-10 12:03:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 74 transitions. [2018-11-10 12:03:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2018-11-10 12:03:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 12:03:26,228 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:26,429 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-10 12:03:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2018-11-10 12:03:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-11-10 12:03:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 12:03:27,262 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:27,307 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-10 12:03:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 53 states and 86 transitions. [2018-11-10 12:03:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2018-11-10 12:03:27,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 12:03:27,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:27,379 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-10 12:03:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 54 states and 87 transitions. [2018-11-10 12:03:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 87 transitions. [2018-11-10 12:03:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 12:03:27,405 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:27,668 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-10 12:03:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 65 states and 104 transitions. [2018-11-10 12:03:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2018-11-10 12:03:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 12:03:29,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:29,167 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-10 12:03:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 68 states and 109 transitions. [2018-11-10 12:03:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 109 transitions. [2018-11-10 12:03:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:03:29,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:29,926 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-10 12:03:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 86 states and 140 transitions. [2018-11-10 12:03:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 140 transitions. [2018-11-10 12:03:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:03:32,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:32,868 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-10 12:03:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 105 states and 172 transitions. [2018-11-10 12:03:35,860 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 172 transitions. [2018-11-10 12:03:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:03:35,861 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:36,376 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-10 12:03:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 123 states and 203 transitions. [2018-11-10 12:03:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 203 transitions. [2018-11-10 12:03:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:03:39,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:39,541 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-10 12:03:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 124 states and 207 transitions. [2018-11-10 12:03:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 207 transitions. [2018-11-10 12:03:39,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:03:39,825 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:03:40,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 125 states and 208 transitions. [2018-11-10 12:03:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 208 transitions. [2018-11-10 12:03:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:03:40,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:40,964 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-10 12:03:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:43,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 140 states and 235 transitions. [2018-11-10 12:03:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 235 transitions. [2018-11-10 12:03:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:03:43,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:44,123 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-10 12:03:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 141 states and 240 transitions. [2018-11-10 12:03:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2018-11-10 12:03:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:03:44,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:44,760 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-10 12:03:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 142 states and 241 transitions. [2018-11-10 12:03:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 241 transitions. [2018-11-10 12:03:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:03:45,000 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:45,274 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-10 12:03:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 143 states and 246 transitions. [2018-11-10 12:03:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 246 transitions. [2018-11-10 12:03:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:03:45,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:46,489 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-10 12:03:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 165 states and 280 transitions. [2018-11-10 12:03:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 280 transitions. [2018-11-10 12:03:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:03:51,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:51,904 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-10 12:03:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:03:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 169 states and 285 transitions. [2018-11-10 12:03:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 285 transitions. [2018-11-10 12:03:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 12:03:53,420 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:03:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:03:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:04:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 186 states and 325 transitions. [2018-11-10 12:04:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 325 transitions. [2018-11-10 12:04:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 12:04:00,536 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:01,451 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-10 12:04:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:05,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 198 states and 344 transitions. [2018-11-10 12:04:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 344 transitions. [2018-11-10 12:04:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 12:04:05,510 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:04:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 213 states and 377 transitions. [2018-11-10 12:04:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 377 transitions. [2018-11-10 12:04:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 12:04:13,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:04:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 216 states and 384 transitions. [2018-11-10 12:04:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 384 transitions. [2018-11-10 12:04:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 12:04:15,037 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:16,247 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-10 12:04:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 221 states and 396 transitions. [2018-11-10 12:04:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 396 transitions. [2018-11-10 12:04:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 12:04:19,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:20,116 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-10 12:04:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 224 states and 404 transitions. [2018-11-10 12:04:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 404 transitions. [2018-11-10 12:04:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 12:04:21,043 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:21,344 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-10 12:04:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 226 states and 408 transitions. [2018-11-10 12:04:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 408 transitions. [2018-11-10 12:04:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 12:04:21,799 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:23,034 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-10 12:04:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 233 states and 426 transitions. [2018-11-10 12:04:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 426 transitions. [2018-11-10 12:04:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 12:04:27,429 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:27,846 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-10 12:04:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 235 states and 428 transitions. [2018-11-10 12:04:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 428 transitions. [2018-11-10 12:04:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 12:04:29,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:29,516 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-10 12:04:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 239 states and 441 transitions. [2018-11-10 12:04:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 441 transitions. [2018-11-10 12:04:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 12:04:31,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:32,061 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-10 12:04:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 254 states and 479 transitions. [2018-11-10 12:04:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 479 transitions. [2018-11-10 12:04:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 12:04:38,100 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:38,349 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-10 12:04:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 256 states and 484 transitions. [2018-11-10 12:04:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 484 transitions. [2018-11-10 12:04:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 12:04:38,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:39,209 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-10 12:04:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 262 states and 503 transitions. [2018-11-10 12:04:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 503 transitions. [2018-11-10 12:04:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:04:42,333 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:42,904 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-10 12:04:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 270 states and 525 transitions. [2018-11-10 12:04:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 525 transitions. [2018-11-10 12:04:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:04:48,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:48,454 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-10 12:04:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 274 states and 535 transitions. [2018-11-10 12:04:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 535 transitions. [2018-11-10 12:04:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:04:49,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:50,216 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-10 12:04:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:04:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 276 states and 538 transitions. [2018-11-10 12:04:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 538 transitions. [2018-11-10 12:04:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 12:04:50,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:04:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:04:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:04:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:04:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:04:52,545 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 38 iterations. [2018-11-10 12:04:52,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 12:04:52 ImpRootNode [2018-11-10 12:04:52,648 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 12:04:52,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:04:52,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:04:52,649 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:04:52,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:03:23" (3/4) ... [2018-11-10 12:04:52,651 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:04:52,765 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_da8830bb-67f2-4a25-967b-25f9f0dfb2af/bin-2019/ukojak/witness.graphml [2018-11-10 12:04:52,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:04:52,766 INFO L168 Benchmark]: Toolchain (without parser) took 91967.69 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 960.2 MB in the beginning and 1.9 GB in the end (delta: -911.8 MB). Peak memory consumption was 251.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:04:52,767 INFO L168 Benchmark]: CDTParser took 0.15 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-10 12:04:52,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.09 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 940.3 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:04:52,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -236.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:04:52,767 INFO L168 Benchmark]: Boogie Preprocessor took 25.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:04:52,768 INFO L168 Benchmark]: RCFGBuilder took 2002.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.0 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.4 MB). Peak memory consumption was 315.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:04:52,768 INFO L168 Benchmark]: CodeCheck took 89515.42 ms. Allocated memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: 916.5 MB). Free memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: -735.4 MB). Peak memory consumption was 181.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:04:52,768 INFO L168 Benchmark]: Witness Printer took 116.62 ms. Allocated memory is still 2.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:04:52,770 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, 148 locations, 1 error locations. UNSAFE Result, 89.3s OverallTime, 38 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1073741824 SDtfs, -420866166 SDslu, -2038781166 SDs, 0 SdLazy, 1316687806 SolverSat, -400621366 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10424 GetRequests, 9008 SyntacticMatches, 580 SemanticMatches, 836 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444326 ImplicationChecksByTransitivity, 79.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 1108 NumberOfCodeBlocks, 1108 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1019 ConstructedInterpolants, 0 QuantifiedInterpolants, 418095 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 10 PerfectInterpolantSequences, 120/623 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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] _Bool newmax1 ; [L103] char id2 ; [L104] unsigned char r2 ; [L105] char st2 ; [L106] char nl2 ; [L107] char m2 ; [L108] char max2 ; [L109] _Bool mode2 ; [L110] _Bool newmax2 ; [L111] char id3 ; [L112] unsigned char r3 ; [L113] char st3 ; [L114] char nl3 ; [L115] char m3 ; [L116] char max3 ; [L117] _Bool mode3 ; [L118] _Bool newmax3 ; [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 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L571] int c1 ; [L572] int i2 ; [L575] c1 = 0 [L576] ep12 = __VERIFIER_nondet_bool() [L577] ep13 = __VERIFIER_nondet_bool() [L578] ep21 = __VERIFIER_nondet_bool() [L579] ep23 = __VERIFIER_nondet_bool() [L580] ep31 = __VERIFIER_nondet_bool() [L581] ep32 = __VERIFIER_nondet_bool() [L582] id1 = __VERIFIER_nondet_char() [L583] r1 = __VERIFIER_nondet_uchar() [L584] st1 = __VERIFIER_nondet_char() [L585] nl1 = __VERIFIER_nondet_char() [L586] m1 = __VERIFIER_nondet_char() [L587] max1 = __VERIFIER_nondet_char() [L588] mode1 = __VERIFIER_nondet_bool() [L589] newmax1 = __VERIFIER_nondet_bool() [L590] id2 = __VERIFIER_nondet_char() [L591] r2 = __VERIFIER_nondet_uchar() [L592] st2 = __VERIFIER_nondet_char() [L593] nl2 = __VERIFIER_nondet_char() [L594] m2 = __VERIFIER_nondet_char() [L595] max2 = __VERIFIER_nondet_char() [L596] mode2 = __VERIFIER_nondet_bool() [L597] newmax2 = __VERIFIER_nondet_bool() [L598] id3 = __VERIFIER_nondet_char() [L599] r3 = __VERIFIER_nondet_uchar() [L600] st3 = __VERIFIER_nondet_char() [L601] nl3 = __VERIFIER_nondet_char() [L602] m3 = __VERIFIER_nondet_char() [L603] max3 = __VERIFIER_nondet_char() [L604] mode3 = __VERIFIER_nondet_bool() [L605] newmax3 = __VERIFIER_nondet_bool() [L606] CALL, EXPR init() [L284] _Bool r121 ; [L285] _Bool r131 ; [L286] _Bool r211 ; [L287] _Bool r231 ; [L288] _Bool r311 ; [L289] _Bool r321 ; [L290] _Bool r122 ; [L291] int tmp ; [L292] _Bool r132 ; [L293] int tmp___0 ; [L294] _Bool r212 ; [L295] int tmp___1 ; [L296] _Bool r232 ; [L297] int tmp___2 ; [L298] _Bool r312 ; [L299] int tmp___3 ; [L300] _Bool r322 ; [L301] int tmp___4 ; [L302] int tmp___5 ; [L305] r121 = ep12 [L306] r131 = ep13 [L307] r211 = ep21 [L308] r231 = ep23 [L309] r311 = ep31 [L310] r321 = ep32 [L311] COND TRUE \read(r121) [L312] tmp = 1 [L323] r122 = (_Bool )tmp [L324] COND TRUE \read(r131) [L325] tmp___0 = 1 [L336] r132 = (_Bool )tmp___0 [L337] COND TRUE \read(r211) [L338] tmp___1 = 1 [L349] r212 = (_Bool )tmp___1 [L350] COND FALSE !(\read(r231)) [L353] COND TRUE \read(r211) [L354] COND TRUE \read(ep13) [L355] tmp___2 = 1 [L362] r232 = (_Bool )tmp___2 [L363] COND FALSE !(\read(r311)) [L366] COND TRUE \read(r321) [L367] COND TRUE \read(ep21) [L368] tmp___3 = 1 [L375] r312 = (_Bool )tmp___3 [L376] COND TRUE \read(r321) [L377] tmp___4 = 1 [L388] r322 = (_Bool )tmp___4 [L389] COND TRUE (int )id1 != (int )id2 [L390] COND TRUE (int )id1 != (int )id3 [L391] COND TRUE (int )id2 != (int )id3 [L392] COND TRUE (int )id1 >= 0 [L393] COND TRUE (int )id2 >= 0 [L394] COND TRUE (int )id3 >= 0 [L395] COND TRUE (int )r1 == 0 [L396] COND TRUE (int )r2 == 0 [L397] COND TRUE (int )r3 == 0 [L398] COND TRUE \read(r122) [L399] COND TRUE \read(r132) [L400] COND TRUE \read(r212) [L401] COND TRUE \read(r232) [L402] COND TRUE \read(r312) [L403] COND TRUE \read(r322) [L404] COND TRUE (int )max1 == (int )id1 [L405] COND TRUE (int )max2 == (int )id2 [L406] COND TRUE (int )max3 == (int )id3 [L407] COND TRUE (int )st1 == 0 [L408] COND TRUE (int )st2 == 0 [L409] COND TRUE (int )st3 == 0 [L410] COND TRUE (int )nl1 == 0 [L411] COND TRUE (int )nl2 == 0 [L412] COND TRUE (int )nl3 == 0 [L413] COND TRUE (int )mode1 == 0 [L414] COND TRUE (int )mode2 == 0 [L415] COND TRUE (int )mode3 == 0 [L416] COND TRUE \read(newmax1) [L417] COND TRUE \read(newmax2) [L418] COND TRUE \read(newmax3) [L419] tmp___5 = 1 [L510] RET return (tmp___5); [L606] EXPR init() [L606] i2 = init() [L608] p12_old = nomsg [L609] p12_new = nomsg [L610] p13_old = nomsg [L611] p13_new = nomsg [L612] p21_old = nomsg [L613] p21_new = nomsg [L614] p23_old = nomsg [L615] p23_new = nomsg [L616] p31_old = nomsg [L617] p31_new = nomsg [L618] p32_old = nomsg [L619] p32_new = nomsg [L620] i2 = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L623] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND TRUE \read(ep12) [L158] COND TRUE \read(newmax1) [L159] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L159] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L162] COND TRUE \read(ep13) [L163] COND TRUE \read(newmax1) [L164] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L168] RET mode1 = (_Bool)1 [L623] node1() [L624] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND TRUE \read(ep21) [L212] COND TRUE \read(newmax2) [L213] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L213] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L216] COND FALSE !(\read(ep23)) [L222] RET mode2 = (_Bool)1 [L624] node2() [L625] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND FALSE !(\read(ep31)) [L270] COND TRUE \read(ep32) [L271] COND TRUE \read(newmax3) [L272] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L272] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L276] RET mode3 = (_Bool)1 [L625] node3() [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L638] CALL, EXPR check() [L515] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L566] RET return (tmp); [L638] EXPR check() [L638] c1 = check() [L639] CALL assert(c1) [L650] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=1, m2=-1, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L639] assert(c1) [L621] COND TRUE 1 [L623] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND TRUE \read(ep21) [L131] m1 = p21_old [L132] p21_old = nomsg [L133] COND TRUE (int )m1 > (int )max1 [L134] max1 = m1 [L135] newmax = (_Bool)1 [L138] COND FALSE !(\read(ep31)) [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] RET mode1 = (_Bool)0 [L623] node1() [L624] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND TRUE \read(ep12) [L185] m2 = p12_old [L186] p12_old = nomsg [L187] COND FALSE !((int )m2 > (int )max2) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND FALSE !((int )m2 > (int )max2) [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] RET mode2 = (_Bool)0 [L624] node2() [L625] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND TRUE (int )m3 > (int )max3 [L242] max3 = m3 [L243] newmax = (_Bool)1 [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] RET mode3 = (_Bool)0 [L625] node3() [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L638] CALL, EXPR check() [L515] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] RET return (tmp); [L638] EXPR check() [L638] c1 = check() [L639] CALL assert(c1) [L650] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L639] assert(c1) [L621] COND TRUE 1 [L623] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND TRUE \read(ep12) [L158] COND TRUE \read(newmax1) [L159] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L159] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L162] COND TRUE \read(ep13) [L163] COND TRUE \read(newmax1) [L164] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L168] RET mode1 = (_Bool)1 [L623] node1() [L624] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND TRUE \read(ep21) [L212] COND FALSE !(\read(newmax2)) [L216] COND FALSE !(\read(ep23)) [L222] RET mode2 = (_Bool)1 [L624] node2() [L625] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND FALSE !(\read(ep31)) [L270] COND TRUE \read(ep32) [L271] COND TRUE \read(newmax3) [L272] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L272] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L276] RET mode3 = (_Bool)1 [L625] node3() [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L638] CALL, EXPR check() [L515] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] RET return (tmp); [L638] EXPR check() [L638] c1 = check() [L639] CALL assert(c1) [L650] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=2, m2=0, m3=1, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L639] assert(c1) [L621] COND TRUE 1 [L623] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND TRUE \read(ep21) [L131] m1 = p21_old [L132] p21_old = nomsg [L133] COND FALSE !((int )m1 > (int )max1) [L138] COND FALSE !(\read(ep31)) [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND FALSE !((int )max1 == (int )id1) [L151] st1 = (char)1 [L154] RET mode1 = (_Bool)0 [L623] node1() [L624] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND TRUE \read(ep12) [L185] m2 = p12_old [L186] p12_old = nomsg [L187] COND FALSE !((int )m2 > (int )max2) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND FALSE !((int )m2 > (int )max2) [L200] newmax2 = newmax [L201] COND TRUE (int )r2 == 2 [L202] COND TRUE (int )max2 == (int )id2 [L203] st2 = (char)1 [L208] RET mode2 = (_Bool)0 [L624] node2() [L625] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND TRUE (int )m3 > (int )max3 [L242] max3 = m3 [L243] newmax = (_Bool)1 [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND FALSE !((int )max3 == (int )id3) [L259] nl3 = (char)1 [L262] RET mode3 = (_Bool)0 [L625] node3() [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L638] CALL, EXPR check() [L515] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=-1, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L518] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L564] tmp = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=-1, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L566] RET return (tmp); [L638] EXPR check() [L638] c1 = check() [L639] CALL assert(c1) [L650] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=-1, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L652] __VERIFIER_error() VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=0, m1=-1, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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.15 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 225.09 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 940.3 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -236.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2002.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.0 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.4 MB). Peak memory consumption was 315.1 MB. Max. memory is 11.5 GB. * CodeCheck took 89515.42 ms. Allocated memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: 916.5 MB). Free memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: -735.4 MB). Peak memory consumption was 181.0 MB. Max. memory is 11.5 GB. * Witness Printer took 116.62 ms. Allocated memory is still 2.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...