./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3efd85eaecafa9f5850339d4919cc79d62d9539 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 12:31:46,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:31:46,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:31:46,330 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:31:46,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:31:46,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:31:46,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:31:46,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:31:46,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:31:46,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:31:46,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:31:46,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:31:46,337 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:31:46,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:31:46,338 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:31:46,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:31:46,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:31:46,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:31:46,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:31:46,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:31:46,344 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:31:46,345 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:31:46,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:31:46,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:31:46,347 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:31:46,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:31:46,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:31:46,349 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:31:46,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:31:46,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:31:46,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:31:46,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:31:46,351 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:31:46,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:31:46,351 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:31:46,352 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:31:46,352 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 12:31:46,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:31:46,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:31:46,364 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:31:46,364 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 12:31:46,364 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 12:31:46,364 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 12:31:46,364 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:31:46,365 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:31:46,365 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:31:46,365 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:31:46,365 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:31:46,365 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:31:46,365 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:31:46,365 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:31:46,365 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:31:46,365 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:31:46,366 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 12:31:46,366 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:31:46,366 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 12:31:46,366 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 12:31:46,366 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:31:46,366 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:31:46,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 12:31:46,366 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:31:46,367 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:31:46,367 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:31:46,367 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 12:31:46,367 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:31:46,367 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:31:46,367 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3efd85eaecafa9f5850339d4919cc79d62d9539 [2018-12-09 12:31:46,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:31:46,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:31:46,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:31:46,402 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:31:46,402 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:31:46,403 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-12-09 12:31:46,440 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak/data/65215e68e/2e539c5c9791467d8bae61f7ae8a95f7/FLAG4073b3c92 [2018-12-09 12:31:46,782 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:31:46,782 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-12-09 12:31:46,787 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak/data/65215e68e/2e539c5c9791467d8bae61f7ae8a95f7/FLAG4073b3c92 [2018-12-09 12:31:47,171 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak/data/65215e68e/2e539c5c9791467d8bae61f7ae8a95f7 [2018-12-09 12:31:47,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:31:47,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:31:47,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:31:47,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:31:47,179 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:31:47,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:31:47" (1/1) ... [2018-12-09 12:31:47,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@509d5fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:47, skipping insertion in model container [2018-12-09 12:31:47,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:31:47" (1/1) ... [2018-12-09 12:31:47,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:31:47,207 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:31:47,331 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:31:47,336 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:31:47,399 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:31:47,409 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:31:47,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:47 WrapperNode [2018-12-09 12:31:47,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:31:47,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:31:47,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:31:47,410 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:31:47,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:47" (1/1) ... [2018-12-09 12:31:47,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:47" (1/1) ... [2018-12-09 12:31:47,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:31:47,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:31:47,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:31:47,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:31:47,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:47" (1/1) ... [2018-12-09 12:31:47,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:47" (1/1) ... [2018-12-09 12:31:47,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:47" (1/1) ... [2018-12-09 12:31:47,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:47" (1/1) ... [2018-12-09 12:31:47,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:47" (1/1) ... [2018-12-09 12:31:47,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:47" (1/1) ... [2018-12-09 12:31:47,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:47" (1/1) ... [2018-12-09 12:31:47,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:31:47,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:31:47,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:31:47,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:31:47,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 12:31:47,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:31:47,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:31:48,797 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:31:48,798 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-09 12:31:48,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:31:48 BoogieIcfgContainer [2018-12-09 12:31:48,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:31:48,798 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 12:31:48,798 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 12:31:48,805 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 12:31:48,805 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:31:48" (1/1) ... [2018-12-09 12:31:48,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:31:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:31:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2018-12-09 12:31:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2018-12-09 12:31:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-09 12:31:48,838 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:31:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:31:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:31:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2018-12-09 12:31:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2018-12-09 12:31:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 12:31:49,095 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:31:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:31:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:31:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2018-12-09 12:31:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2018-12-09 12:31:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 12:31:49,326 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:31:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:31:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:31:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2018-12-09 12:31:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2018-12-09 12:31:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 12:31:49,653 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:31:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:31:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:31:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2018-12-09 12:31:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2018-12-09 12:31:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 12:31:50,119 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:31:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:31:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:31:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2018-12-09 12:31:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2018-12-09 12:31:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 12:31:50,747 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:31:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:31:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:31:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2018-12-09 12:31:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2018-12-09 12:31:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 12:31:51,722 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:31:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:31:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:31:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2018-12-09 12:31:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2018-12-09 12:31:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 12:31:51,923 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:31:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:31:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:31:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-12-09 12:31:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-12-09 12:31:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 12:31:51,957 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:31:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:31:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:31:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2018-12-09 12:31:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2018-12-09 12:31:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 12:31:53,376 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:31:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:31:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:31:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2018-12-09 12:31:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2018-12-09 12:31:53,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 12:31:53,619 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:31:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:31:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:31:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 77 states and 143 transitions. [2018-12-09 12:31:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 143 transitions. [2018-12-09 12:31:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 12:31:57,585 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:31:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 94 states and 178 transitions. [2018-12-09 12:32:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 178 transitions. [2018-12-09 12:32:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 12:32:02,905 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 112 states and 215 transitions. [2018-12-09 12:32:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 215 transitions. [2018-12-09 12:32:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 12:32:06,692 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 114 states and 220 transitions. [2018-12-09 12:32:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 220 transitions. [2018-12-09 12:32:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 12:32:07,212 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 128 states and 249 transitions. [2018-12-09 12:32:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 249 transitions. [2018-12-09 12:32:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 12:32:12,503 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 129 states and 251 transitions. [2018-12-09 12:32:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 251 transitions. [2018-12-09 12:32:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 12:32:12,776 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 130 states and 252 transitions. [2018-12-09 12:32:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 252 transitions. [2018-12-09 12:32:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 12:32:13,093 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 131 states and 253 transitions. [2018-12-09 12:32:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 253 transitions. [2018-12-09 12:32:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 12:32:13,395 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 132 states and 258 transitions. [2018-12-09 12:32:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 258 transitions. [2018-12-09 12:32:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 12:32:13,747 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:20,011 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-12-09 12:32:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 152 states and 297 transitions. [2018-12-09 12:32:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 297 transitions. [2018-12-09 12:32:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 12:32:23,039 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 157 states and 306 transitions. [2018-12-09 12:32:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 306 transitions. [2018-12-09 12:32:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 12:32:24,441 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 160 states and 314 transitions. [2018-12-09 12:32:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 314 transitions. [2018-12-09 12:32:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 12:32:29,217 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 165 states and 326 transitions. [2018-12-09 12:32:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 326 transitions. [2018-12-09 12:32:30,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 12:32:30,653 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:38,135 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-12-09 12:32:38,899 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2018-12-09 12:32:50,278 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-09 12:32:53,347 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2018-12-09 12:32:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 193 states and 402 transitions. [2018-12-09 12:32:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 402 transitions. [2018-12-09 12:32:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 12:32:54,693 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:32:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:32:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 198 states and 413 transitions. [2018-12-09 12:32:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 413 transitions. [2018-12-09 12:32:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 12:32:57,419 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:32:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:33:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:33:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 210 states and 434 transitions. [2018-12-09 12:33:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 434 transitions. [2018-12-09 12:33:08,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 12:33:08,491 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:33:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:33:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:33:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:33:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 218 states and 469 transitions. [2018-12-09 12:33:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 469 transitions. [2018-12-09 12:33:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 12:33:14,142 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:33:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:33:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:33:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:33:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 219 states and 472 transitions. [2018-12-09 12:33:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 472 transitions. [2018-12-09 12:33:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 12:33:14,690 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:33:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:33:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:33:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:33:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 230 states and 497 transitions. [2018-12-09 12:33:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 497 transitions. [2018-12-09 12:33:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 12:33:27,281 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:33:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:33:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:33:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:33:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 232 states and 499 transitions. [2018-12-09 12:33:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 499 transitions. [2018-12-09 12:33:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 12:33:28,963 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:33:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:33:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:33:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:33:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 233 states and 503 transitions. [2018-12-09 12:33:29,515 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 503 transitions. [2018-12-09 12:33:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 12:33:29,516 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:33:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:33:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:33:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:33:44,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 248 states and 545 transitions. [2018-12-09 12:33:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 545 transitions. [2018-12-09 12:33:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 12:33:44,569 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:33:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:33:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:33:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:33:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 254 states and 557 transitions. [2018-12-09 12:33:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 557 transitions. [2018-12-09 12:33:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 12:33:48,674 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:33:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:33:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:33:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:33:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 256 states and 567 transitions. [2018-12-09 12:33:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 567 transitions. [2018-12-09 12:33:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 12:33:49,772 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:33:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:33:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:33:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:33:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 259 states and 575 transitions. [2018-12-09 12:33:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 575 transitions. [2018-12-09 12:33:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 12:33:58,744 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:33:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:33:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:34:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:34:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 262 states and 588 transitions. [2018-12-09 12:34:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 588 transitions. [2018-12-09 12:34:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 12:34:01,443 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:34:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:34:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:34:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:34:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 263 states and 590 transitions. [2018-12-09 12:34:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 590 transitions. [2018-12-09 12:34:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 12:34:02,106 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:34:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:34:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:34:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:34:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 265 states and 603 transitions. [2018-12-09 12:34:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 603 transitions. [2018-12-09 12:34:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 12:34:04,538 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:34:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:34:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:34:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:34:07,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 268 states and 615 transitions. [2018-12-09 12:34:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 615 transitions. [2018-12-09 12:34:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 12:34:07,640 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:34:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:34:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:34:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:34:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 276 states and 636 transitions. [2018-12-09 12:34:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 636 transitions. [2018-12-09 12:34:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 12:34:13,749 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:34:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:34:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:34:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:34:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 280 states and 648 transitions. [2018-12-09 12:34:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 648 transitions. [2018-12-09 12:34:15,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 12:34:15,413 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:34:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:34:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:34:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:34:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 281 states and 653 transitions. [2018-12-09 12:34:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 653 transitions. [2018-12-09 12:34:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 12:34:16,056 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:34:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:34:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:34:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:34:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 284 states and 663 transitions. [2018-12-09 12:34:17,224 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 663 transitions. [2018-12-09 12:34:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 12:34:17,225 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:34:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:34:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:34:22,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:34:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 291 states and 686 transitions. [2018-12-09 12:34:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 686 transitions. [2018-12-09 12:34:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 12:34:22,266 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:34:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:34:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:34:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:34:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 295 states and 701 transitions. [2018-12-09 12:34:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 701 transitions. [2018-12-09 12:34:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 12:34:24,894 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:34:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:34:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:34:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:34:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 298 states and 712 transitions. [2018-12-09 12:34:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 712 transitions. [2018-12-09 12:34:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 12:34:26,567 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:34:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:34:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:34:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:34:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 299 states and 715 transitions. [2018-12-09 12:34:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 715 transitions. [2018-12-09 12:34:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 12:34:27,377 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:34:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:34:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:34:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:34:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:34:29,482 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 48 iterations. [2018-12-09 12:34:29,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 12:34:29 ImpRootNode [2018-12-09 12:34:29,566 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 12:34:29,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:34:29,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:34:29,567 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:34:29,567 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:31:48" (3/4) ... [2018-12-09 12:34:29,568 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:34:29,653 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_73906b5a-396e-43e6-baa2-295f35f4b4a9/bin-2019/ukojak/witness.graphml [2018-12-09 12:34:29,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:34:29,653 INFO L168 Benchmark]: Toolchain (without parser) took 162479.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.6 MB). Free memory was 956.0 MB in the beginning and 686.1 MB in the end (delta: 269.8 MB). Peak memory consumption was 531.5 MB. Max. memory is 11.5 GB. [2018-12-09 12:34:29,654 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:34:29,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 12:34:29,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:34:29,654 INFO L168 Benchmark]: Boogie Preprocessor took 20.69 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: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-12-09 12:34:29,655 INFO L168 Benchmark]: RCFGBuilder took 1336.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.5 MB). Peak memory consumption was 320.2 MB. Max. memory is 11.5 GB. [2018-12-09 12:34:29,655 INFO L168 Benchmark]: CodeCheck took 160767.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 48.2 MB). Free memory was 1.2 GB in the beginning and 704.0 MB in the end (delta: 487.3 MB). Peak memory consumption was 535.6 MB. Max. memory is 11.5 GB. [2018-12-09 12:34:29,655 INFO L168 Benchmark]: Witness Printer took 86.58 ms. Allocated memory is still 1.3 GB. Free memory was 704.0 MB in the beginning and 686.1 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:34:29,656 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 129 locations, 1 error locations. UNSAFE Result, 160.6s OverallTime, 48 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1283436540 SDtfs, -2038642286 SDslu, -1840302694 SDs, 0 SdLazy, 391375338 SolverSat, 114519674 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 84.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14331 GetRequests, 12584 SyntacticMatches, 757 SemanticMatches, 990 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590167 ImplicationChecksByTransitivity, 151.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 1379 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1284 ConstructedInterpolants, 0 QuantifiedInterpolants, 492828 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 10 PerfectInterpolantSequences, 153/816 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 601]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L74] port_t p13 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L78] port_t p21 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L82] port_t p23 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L86] port_t p31 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L90] port_t p32 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] ep12 = __VERIFIER_nondet_bool() [L528] ep13 = __VERIFIER_nondet_bool() [L529] ep21 = __VERIFIER_nondet_bool() [L530] ep23 = __VERIFIER_nondet_bool() [L531] ep31 = __VERIFIER_nondet_bool() [L532] ep32 = __VERIFIER_nondet_bool() [L533] id1 = __VERIFIER_nondet_char() [L534] r1 = __VERIFIER_nondet_char() [L535] st1 = __VERIFIER_nondet_char() [L536] nl1 = __VERIFIER_nondet_char() [L537] m1 = __VERIFIER_nondet_char() [L538] max1 = __VERIFIER_nondet_char() [L539] mode1 = __VERIFIER_nondet_bool() [L540] id2 = __VERIFIER_nondet_char() [L541] r2 = __VERIFIER_nondet_char() [L542] st2 = __VERIFIER_nondet_char() [L543] nl2 = __VERIFIER_nondet_char() [L544] m2 = __VERIFIER_nondet_char() [L545] max2 = __VERIFIER_nondet_char() [L546] mode2 = __VERIFIER_nondet_bool() [L547] id3 = __VERIFIER_nondet_char() [L548] r3 = __VERIFIER_nondet_char() [L549] st3 = __VERIFIER_nondet_char() [L550] nl3 = __VERIFIER_nondet_char() [L551] m3 = __VERIFIER_nondet_char() [L552] max3 = __VERIFIER_nondet_char() [L553] mode3 = __VERIFIER_nondet_bool() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND FALSE !(\read(r121)) [L277] COND TRUE \read(r131) [L278] COND TRUE \read(ep32) [L279] tmp = 1 [L286] r122 = (_Bool )tmp [L287] COND TRUE \read(r131) [L288] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND TRUE \read(r211) [L301] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND FALSE !(\read(r231)) [L316] COND TRUE \read(r211) [L317] COND TRUE \read(ep13) [L318] tmp___2 = 1 [L325] r232 = (_Bool )tmp___2 [L326] COND FALSE !(\read(r311)) [L329] COND TRUE \read(r321) [L330] COND TRUE \read(ep21) [L331] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND TRUE \read(r321) [L340] tmp___4 = 1 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE \read(r122) [L362] COND TRUE \read(r132) [L363] COND TRUE \read(r212) [L364] COND TRUE \read(r232) [L365] COND TRUE \read(r312) [L366] COND TRUE \read(r322) [L367] COND TRUE (int )max1 == (int )id1 [L368] COND TRUE (int )max2 == (int )id2 [L369] COND TRUE (int )max3 == (int )id3 [L370] COND TRUE (int )st1 == 0 [L371] COND TRUE (int )st2 == 0 [L372] COND TRUE (int )st3 == 0 [L373] COND TRUE (int )nl1 == 0 [L374] COND TRUE (int )nl2 == 0 [L375] COND TRUE (int )nl3 == 0 [L376] COND TRUE (int )mode1 == 0 [L377] COND TRUE (int )mode2 == 0 [L378] COND TRUE (int )mode3 == 0 [L379] tmp___5 = 1 [L461] return (tmp___5); [L554] i2 = init() [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 1 [L146] COND FALSE !(\read(ep12)) [L149] COND TRUE \read(ep13) [L150] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L150] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND FALSE !(\read(ep23)) [L196] mode2 = (_Bool)1 [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND FALSE !(\read(ep31)) [L235] COND TRUE \read(ep32) [L236] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] mode3 = (_Bool)1 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L588] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=2, m2=-128, m3=-128, max1=2, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND TRUE (int )m1 > (int )max1 [L126] max1 = m1 [L129] COND FALSE !(\read(ep31)) [L136] COND FALSE !((int )r1 == 2) [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND FALSE !((int )r2 == 2) [L186] mode2 = (_Bool)0 [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND TRUE \read(ep13) [L209] m3 = p13_old [L210] p13_old = nomsg [L211] COND FALSE !((int )m3 > (int )max3) [L215] COND FALSE !(\read(ep23)) [L222] COND FALSE !((int )r3 == 2) [L229] mode3 = (_Bool)0 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L588] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND FALSE !((int )r1 < 1) [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND FALSE !(\read(ep23)) [L196] mode2 = (_Bool)1 [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND FALSE !(\read(ep31)) [L235] COND TRUE \read(ep32) [L236] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] mode3 = (_Bool)1 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L588] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=2, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND FALSE !((int )m1 > (int )max1) [L129] COND FALSE !(\read(ep31)) [L136] COND TRUE (int )r1 == 2 [L137] COND FALSE !((int )max1 == (int )id1) [L140] nl1 = (char)1 [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND TRUE (int )r2 == 2 [L180] COND TRUE (int )max2 == (int )id2 [L181] st2 = (char)1 [L186] mode2 = (_Bool)0 [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND TRUE \read(ep13) [L209] m3 = p13_old [L210] p13_old = nomsg [L211] COND FALSE !((int )m3 > (int )max3) [L215] COND FALSE !(\read(ep23)) [L222] COND TRUE (int )r3 == 2 [L223] COND TRUE (int )max3 == (int )id3 [L224] st3 = (char)1 [L229] mode3 = (_Bool)0 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=-1, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=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] [L469] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L515] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=-1, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=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] [L517] return (tmp); [L586] c1 = check() [L599] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=-1, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=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] [L601] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=127, id3=125, m1=127, m2=125, m3=-1, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 234.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.12 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. * Boogie Preprocessor took 20.69 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: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1336.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.5 MB). Peak memory consumption was 320.2 MB. Max. memory is 11.5 GB. * CodeCheck took 160767.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 48.2 MB). Free memory was 1.2 GB in the beginning and 704.0 MB in the end (delta: 487.3 MB). Peak memory consumption was 535.6 MB. Max. memory is 11.5 GB. * Witness Printer took 86.58 ms. Allocated memory is still 1.3 GB. Free memory was 704.0 MB in the beginning and 686.1 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...