./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d9066a9c9a0f98758515c22da9fb874b191c54e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 08:23:28,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:23:28,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:23:28,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:23:28,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:23:28,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:23:28,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:23:28,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:23:28,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:23:28,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:23:28,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:23:28,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:23:28,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:23:28,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:23:28,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:23:28,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:23:28,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:23:28,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:23:28,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:23:28,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:23:28,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:23:28,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:23:28,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:23:28,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:23:28,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:23:28,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:23:28,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:23:28,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:23:28,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:23:28,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:23:28,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:23:28,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:23:28,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:23:28,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:23:28,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:23:28,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:23:28,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:23:28,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:23:28,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:23:28,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:23:28,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:23:28,242 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 08:23:28,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:23:28,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:23:28,272 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 08:23:28,272 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 08:23:28,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:23:28,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:23:28,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:23:28,273 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:23:28,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 08:23:28,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:23:28,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:23:28,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 08:23:28,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:23:28,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 08:23:28,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:23:28,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 08:23:28,275 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:23:28,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 08:23:28,275 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 08:23:28,279 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 08:23:28,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:23:28,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:23:28,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 08:23:28,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:23:28,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:23:28,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 08:23:28,281 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 08:23:28,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 08:23:28,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 08:23:28,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d9066a9c9a0f98758515c22da9fb874b191c54e [2019-11-20 08:23:28,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:23:28,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:23:28,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:23:28,433 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:23:28,434 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:23:28,434 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2019-11-20 08:23:28,491 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak/data/2f399b8c2/c912d3c04dea40dc9c76ed1bc6cb7c9b/FLAG123b940e5 [2019-11-20 08:23:28,904 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:23:28,904 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2019-11-20 08:23:28,915 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak/data/2f399b8c2/c912d3c04dea40dc9c76ed1bc6cb7c9b/FLAG123b940e5 [2019-11-20 08:23:29,286 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak/data/2f399b8c2/c912d3c04dea40dc9c76ed1bc6cb7c9b [2019-11-20 08:23:29,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:23:29,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 08:23:29,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:23:29,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:23:29,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:23:29,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:23:29" (1/1) ... [2019-11-20 08:23:29,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55928634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29, skipping insertion in model container [2019-11-20 08:23:29,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:23:29" (1/1) ... [2019-11-20 08:23:29,304 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:23:29,347 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:23:29,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:23:29,655 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:23:29,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:23:29,733 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:23:29,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29 WrapperNode [2019-11-20 08:23:29,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:23:29,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 08:23:29,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 08:23:29,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 08:23:29,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2019-11-20 08:23:29,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2019-11-20 08:23:29,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 08:23:29,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:23:29,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:23:29,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:23:29,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2019-11-20 08:23:29,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2019-11-20 08:23:29,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2019-11-20 08:23:29,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2019-11-20 08:23:29,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2019-11-20 08:23:29,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2019-11-20 08:23:29,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2019-11-20 08:23:29,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:23:29,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:23:29,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:23:29,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:23:29,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 08:23:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:23:29,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:23:32,801 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:23:32,801 INFO L285 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-20 08:23:32,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:32 BoogieIcfgContainer [2019-11-20 08:23:32,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:23:32,803 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 08:23:32,803 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 08:23:32,812 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 08:23:32,813 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:32" (1/1) ... [2019-11-20 08:23:32,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:23:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2019-11-20 08:23:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2019-11-20 08:23:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 08:23:32,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2019-11-20 08:23:33,675 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2019-11-20 08:23:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 08:23:33,676 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2019-11-20 08:23:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2019-11-20 08:23:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 08:23:34,335 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2019-11-20 08:23:35,121 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-11-20 08:23:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 08:23:35,122 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2019-11-20 08:23:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2019-11-20 08:23:36,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 08:23:36,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2019-11-20 08:23:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2019-11-20 08:23:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 08:23:37,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2019-11-20 08:23:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2019-11-20 08:23:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 08:23:38,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2019-11-20 08:23:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2019-11-20 08:23:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 08:23:38,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2019-11-20 08:23:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2019-11-20 08:23:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 08:23:38,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:41,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2019-11-20 08:23:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2019-11-20 08:23:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 08:23:41,037 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2019-11-20 08:23:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2019-11-20 08:23:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 08:23:41,492 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 74 states and 137 transitions. [2019-11-20 08:23:46,993 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 137 transitions. [2019-11-20 08:23:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 08:23:46,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 90 states and 169 transitions. [2019-11-20 08:23:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 169 transitions. [2019-11-20 08:23:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 08:23:52,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 91 states and 171 transitions. [2019-11-20 08:23:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 171 transitions. [2019-11-20 08:23:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:23:52,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 104 states and 198 transitions. [2019-11-20 08:23:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 198 transitions. [2019-11-20 08:23:57,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:23:57,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:23:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:23:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 105 states and 199 transitions. [2019-11-20 08:23:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 199 transitions. [2019-11-20 08:23:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 08:23:58,654 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:23:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:23:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:24:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 118 states and 227 transitions. [2019-11-20 08:24:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 227 transitions. [2019-11-20 08:24:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 08:24:05,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:24:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:24:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 119 states and 228 transitions. [2019-11-20 08:24:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 228 transitions. [2019-11-20 08:24:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 08:24:05,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:24:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:24:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 120 states and 229 transitions. [2019-11-20 08:24:06,352 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 229 transitions. [2019-11-20 08:24:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 08:24:06,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:24:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:24:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 122 states and 235 transitions. [2019-11-20 08:24:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 235 transitions. [2019-11-20 08:24:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 08:24:07,430 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:24:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:24:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 141 states and 265 transitions. [2019-11-20 08:24:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 265 transitions. [2019-11-20 08:24:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 08:24:17,537 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:24:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:24:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 146 states and 274 transitions. [2019-11-20 08:24:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 274 transitions. [2019-11-20 08:24:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 08:24:21,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:24:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:24:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 153 states and 292 transitions. [2019-11-20 08:24:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 292 transitions. [2019-11-20 08:24:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 08:24:29,580 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:24:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:24:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 166 states and 336 transitions. [2019-11-20 08:24:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 336 transitions. [2019-11-20 08:24:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 08:24:39,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:24:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:24:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 178 states and 363 transitions. [2019-11-20 08:24:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 363 transitions. [2019-11-20 08:24:48,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 08:24:48,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:24:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:24:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 179 states and 366 transitions. [2019-11-20 08:24:50,245 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 366 transitions. [2019-11-20 08:24:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 08:24:50,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:24:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:24:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:24:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 189 states and 388 transitions. [2019-11-20 08:24:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 388 transitions. [2019-11-20 08:24:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 08:24:59,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:24:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:24:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:25:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:25:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 191 states and 396 transitions. [2019-11-20 08:25:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 396 transitions. [2019-11-20 08:25:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 08:25:00,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:25:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:25:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:25:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:25:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 199 states and 412 transitions. [2019-11-20 08:25:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 412 transitions. [2019-11-20 08:25:09,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 08:25:09,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:25:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:25:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:25:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:25:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 201 states and 422 transitions. [2019-11-20 08:25:11,107 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 422 transitions. [2019-11-20 08:25:11,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 08:25:11,108 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:25:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:25:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:25:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:25:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 203 states and 430 transitions. [2019-11-20 08:25:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 430 transitions. [2019-11-20 08:25:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 08:25:13,804 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:25:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:25:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:25:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:25:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 210 states and 452 transitions. [2019-11-20 08:25:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 452 transitions. [2019-11-20 08:25:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 08:25:25,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:25:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:25:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:25:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:25:26,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 211 states and 453 transitions. [2019-11-20 08:25:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 453 transitions. [2019-11-20 08:25:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 08:25:26,596 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:25:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:25:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:25:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:25:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 214 states and 466 transitions. [2019-11-20 08:25:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 466 transitions. [2019-11-20 08:25:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 08:25:29,942 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:25:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:25:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:25:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:25:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 217 states and 480 transitions. [2019-11-20 08:25:33,038 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 480 transitions. [2019-11-20 08:25:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:25:33,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:25:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:25:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:25:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:25:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 230 states and 512 transitions. [2019-11-20 08:25:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 512 transitions. [2019-11-20 08:25:48,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:25:48,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:25:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:25:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:25:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:25:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 235 states and 543 transitions. [2019-11-20 08:25:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 543 transitions. [2019-11-20 08:25:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:25:53,266 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:25:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:25:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:25:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:25:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 238 states and 560 transitions. [2019-11-20 08:25:56,351 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 560 transitions. [2019-11-20 08:25:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:25:56,352 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:25:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:25:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:25:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:25:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 239 states and 561 transitions. [2019-11-20 08:25:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 561 transitions. [2019-11-20 08:25:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:25:57,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:25:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:25:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:26:00,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:26:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 242 states and 574 transitions. [2019-11-20 08:26:00,883 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 574 transitions. [2019-11-20 08:26:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:26:00,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:26:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:26:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:26:05,392 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-20 08:26:06,495 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-11-20 08:26:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:26:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 248 states and 596 transitions. [2019-11-20 08:26:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 596 transitions. [2019-11-20 08:26:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:26:12,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:26:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:26:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:26:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:26:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 250 states and 599 transitions. [2019-11-20 08:26:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 599 transitions. [2019-11-20 08:26:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:26:15,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:26:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:26:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:26:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:26:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 253 states and 612 transitions. [2019-11-20 08:26:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 612 transitions. [2019-11-20 08:26:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:26:18,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:26:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:26:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:26:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:26:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 254 states and 613 transitions. [2019-11-20 08:26:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 613 transitions. [2019-11-20 08:26:20,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:26:20,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:26:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:26:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:26:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:26:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 255 states and 616 transitions. [2019-11-20 08:26:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 616 transitions. [2019-11-20 08:26:21,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:26:21,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:26:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:26:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:26:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:26:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 258 states and 627 transitions. [2019-11-20 08:26:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 627 transitions. [2019-11-20 08:26:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 08:26:24,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:26:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:26:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:26:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:26:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:26:29,001 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 46 iterations. [2019-11-20 08:26:29,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 08:26:29 ImpRootNode [2019-11-20 08:26:29,239 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 08:26:29,239 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 08:26:29,240 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 08:26:29,240 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 08:26:29,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:32" (3/4) ... [2019-11-20 08:26:29,243 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 08:26:29,494 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_50b9bdc0-5805-4f2f-abd4-9cddd5bc29a7/bin/ukojak/witness.graphml [2019-11-20 08:26:29,494 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 08:26:29,495 INFO L168 Benchmark]: Toolchain (without parser) took 180206.35 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 943.4 MB in the beginning and 1.4 GB in the end (delta: -420.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-20 08:26:29,496 INFO L168 Benchmark]: CDTParser took 1.65 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:26:29,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:26:29,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.87 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 08:26:29,497 INFO L168 Benchmark]: Boogie Preprocessor took 55.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:26:29,498 INFO L168 Benchmark]: RCFGBuilder took 2959.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.4 MB in the end (delta: 153.2 MB). Peak memory consumption was 256.9 MB. Max. memory is 11.5 GB. [2019-11-20 08:26:29,498 INFO L168 Benchmark]: CodeCheck took 176436.15 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 975.4 MB in the beginning and 1.4 GB in the end (delta: -438.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-20 08:26:29,498 INFO L168 Benchmark]: Witness Printer took 254.72 ms. Allocated memory is still 2.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2019-11-20 08:26:29,501 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Result: UNSAFE, OverallTime: 176.1s, OverallIterations: 46, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 0 SDtfs, -1357760876 SDslu, 0 SDs, 0 SdLazy, -128572048 SolverSat, 247526696 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 99.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13875 GetRequests, 12178 SyntacticMatches, 743 SemanticMatches, 954 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565364 ImplicationChecksByTransitivity, 153.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 1268 NumberOfCodeBlocks, 1268 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1178 ConstructedInterpolants, 0 QuantifiedInterpolants, 470976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 10 PerfectInterpolantSequences, 140/783 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L75] port_t p13 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L79] port_t p21 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L83] port_t p23 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L87] port_t p31 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L91] port_t p32 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] _Bool newmax1 ; [L103] char id2 ; [L104] unsigned char r2 ; [L105] char st2 ; [L106] char nl2 ; [L107] char m2 ; [L108] char max2 ; [L109] _Bool mode2 ; [L110] _Bool newmax2 ; [L111] char id3 ; [L112] unsigned char r3 ; [L113] char st3 ; [L114] char nl3 ; [L115] char m3 ; [L116] char max3 ; [L117] _Bool mode3 ; [L118] _Bool newmax3 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L571] int c1 ; [L572] int i2 ; [L575] c1 = 0 [L576] ep12 = __VERIFIER_nondet_bool() [L577] ep13 = __VERIFIER_nondet_bool() [L578] ep21 = __VERIFIER_nondet_bool() [L579] ep23 = __VERIFIER_nondet_bool() [L580] ep31 = __VERIFIER_nondet_bool() [L581] ep32 = __VERIFIER_nondet_bool() [L582] id1 = __VERIFIER_nondet_char() [L583] r1 = __VERIFIER_nondet_uchar() [L584] st1 = __VERIFIER_nondet_char() [L585] nl1 = __VERIFIER_nondet_char() [L586] m1 = __VERIFIER_nondet_char() [L587] max1 = __VERIFIER_nondet_char() [L588] mode1 = __VERIFIER_nondet_bool() [L589] newmax1 = __VERIFIER_nondet_bool() [L590] id2 = __VERIFIER_nondet_char() [L591] r2 = __VERIFIER_nondet_uchar() [L592] st2 = __VERIFIER_nondet_char() [L593] nl2 = __VERIFIER_nondet_char() [L594] m2 = __VERIFIER_nondet_char() [L595] max2 = __VERIFIER_nondet_char() [L596] mode2 = __VERIFIER_nondet_bool() [L597] newmax2 = __VERIFIER_nondet_bool() [L598] id3 = __VERIFIER_nondet_char() [L599] r3 = __VERIFIER_nondet_uchar() [L600] st3 = __VERIFIER_nondet_char() [L601] nl3 = __VERIFIER_nondet_char() [L602] m3 = __VERIFIER_nondet_char() [L603] max3 = __VERIFIER_nondet_char() [L604] mode3 = __VERIFIER_nondet_bool() [L605] newmax3 = __VERIFIER_nondet_bool() [L284] _Bool r121 ; [L285] _Bool r131 ; [L286] _Bool r211 ; [L287] _Bool r231 ; [L288] _Bool r311 ; [L289] _Bool r321 ; [L290] _Bool r122 ; [L291] int tmp ; [L292] _Bool r132 ; [L293] int tmp___0 ; [L294] _Bool r212 ; [L295] int tmp___1 ; [L296] _Bool r232 ; [L297] int tmp___2 ; [L298] _Bool r312 ; [L299] int tmp___3 ; [L300] _Bool r322 ; [L301] int tmp___4 ; [L302] int tmp___5 ; [L305] r121 = ep12 [L306] r131 = ep13 [L307] r211 = ep21 [L308] r231 = ep23 [L309] r311 = ep31 [L310] r321 = ep32 [L311] COND TRUE \read(r121) [L312] tmp = 1 [L323] r122 = (_Bool )tmp [L324] COND TRUE \read(r131) [L325] tmp___0 = 1 [L336] r132 = (_Bool )tmp___0 [L337] COND FALSE !(\read(r211)) [L340] COND TRUE \read(r231) [L341] COND TRUE \read(ep31) [L342] tmp___1 = 1 [L349] r212 = (_Bool )tmp___1 [L350] COND TRUE \read(r231) [L351] tmp___2 = 1 [L362] r232 = (_Bool )tmp___2 [L363] COND TRUE \read(r311) [L364] tmp___3 = 1 [L375] r312 = (_Bool )tmp___3 [L376] COND FALSE !(\read(r321)) [L379] COND TRUE \read(r311) [L380] COND TRUE \read(ep12) [L381] tmp___4 = 1 [L388] r322 = (_Bool )tmp___4 [L389] COND TRUE (int )id1 != (int )id2 [L390] COND TRUE (int )id1 != (int )id3 [L391] COND TRUE (int )id2 != (int )id3 [L392] COND TRUE (int )id1 >= 0 [L393] COND TRUE (int )id2 >= 0 [L394] COND TRUE (int )id3 >= 0 [L395] COND TRUE (int )r1 == 0 [L396] COND TRUE (int )r2 == 0 [L397] COND TRUE (int )r3 == 0 [L398] COND TRUE \read(r122) [L399] COND TRUE \read(r132) [L400] COND TRUE \read(r212) [L401] COND TRUE \read(r232) [L402] COND TRUE \read(r312) [L403] COND TRUE \read(r322) [L404] COND TRUE (int )max1 == (int )id1 [L405] COND TRUE (int )max2 == (int )id2 [L406] COND TRUE (int )max3 == (int )id3 [L407] COND TRUE (int )st1 == 0 [L408] COND TRUE (int )st2 == 0 [L409] COND TRUE (int )st3 == 0 [L410] COND TRUE (int )nl1 == 0 [L411] COND TRUE (int )nl2 == 0 [L412] COND TRUE (int )nl3 == 0 [L413] COND TRUE (int )mode1 == 0 [L414] COND TRUE (int )mode2 == 0 [L415] COND TRUE (int )mode3 == 0 [L416] COND TRUE \read(newmax1) [L417] COND TRUE \read(newmax2) [L418] COND TRUE \read(newmax3) [L419] tmp___5 = 1 [L510] return (tmp___5); [L606] i2 = init() [L608] p12_old = nomsg [L609] p12_new = nomsg [L610] p13_old = nomsg [L611] p13_new = nomsg [L612] p21_old = nomsg [L613] p21_new = nomsg [L614] p23_old = nomsg [L615] p23_new = nomsg [L616] p31_old = nomsg [L617] p31_new = nomsg [L618] p32_old = nomsg [L619] p32_new = nomsg [L620] i2 = 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 1 [L157] COND TRUE \read(ep12) [L158] COND TRUE \read(newmax1) [L159] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L159] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L162] COND TRUE \read(ep13) [L163] COND TRUE \read(newmax1) [L164] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND TRUE \read(ep23) [L217] COND TRUE \read(newmax2) [L218] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L218] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND TRUE \read(newmax3) [L267] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L267] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L270] COND FALSE !(\read(ep32)) [L276] mode3 = (_Bool)1 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, 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=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, 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=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, 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=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, 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=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, 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=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, 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=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, 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=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, 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=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, 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=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, 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=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, 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=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=1, m3=0, max1=0, max2=3, max3=4, 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=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND TRUE (int )m1 > (int )max1 [L142] max1 = m1 [L143] newmax = (_Bool)1 [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND TRUE \read(ep12) [L185] m2 = p12_old [L186] p12_old = nomsg [L187] COND FALSE !((int )m2 > (int )max2) [L192] COND FALSE !(\read(ep32)) [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND FALSE !((int )m3 > (int )max3) [L246] COND TRUE \read(ep23) [L247] m3 = p23_old [L248] p23_old = nomsg [L249] COND FALSE !((int )m3 > (int )max3) [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] mode3 = (_Bool)0 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND FALSE !((int )r1 < 1) [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND TRUE \read(ep23) [L217] COND FALSE !(\read(newmax2)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND FALSE !(\read(newmax3)) [L270] COND FALSE !(\read(ep32)) [L276] mode3 = (_Bool)1 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND FALSE !((int )m1 > (int )max1) [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND FALSE !((int )max1 == (int )id1) [L151] nl1 = (char)1 [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND TRUE \read(ep12) [L185] m2 = p12_old [L186] p12_old = nomsg [L187] COND FALSE !((int )m2 > (int )max2) [L192] COND FALSE !(\read(ep32)) [L200] newmax2 = newmax [L201] COND TRUE (int )r2 == 2 [L202] COND TRUE (int )max2 == (int )id2 [L203] st2 = (char)1 [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND FALSE !((int )m3 > (int )max3) [L246] COND TRUE \read(ep23) [L247] m3 = p23_old [L248] p23_old = nomsg [L249] COND FALSE !((int )m3 > (int )max3) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND TRUE (int )max3 == (int )id3 [L257] st3 = (char)1 [L262] mode3 = (_Bool)0 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=-1, m2=-1, m3=-1, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L518] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L564] tmp = 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=-1, m2=-1, m3=-1, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L566] return (tmp); [L638] c1 = check() [L650] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=-1, m2=-1, m3=-1, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L652] __VERIFIER_error() VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=-1, m2=-1, m3=-1, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.65 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 443.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.87 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2959.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.4 MB in the end (delta: 153.2 MB). Peak memory consumption was 256.9 MB. Max. memory is 11.5 GB. * CodeCheck took 176436.15 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 975.4 MB in the beginning and 1.4 GB in the end (delta: -438.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 254.72 ms. Allocated memory is still 2.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...