./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.1-dev-b2eff8b [2021-10-29 04:10:38,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 04:10:38,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 04:10:38,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 04:10:38,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 04:10:38,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 04:10:38,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 04:10:38,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 04:10:38,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 04:10:38,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 04:10:38,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 04:10:38,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 04:10:38,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 04:10:38,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 04:10:38,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 04:10:38,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 04:10:38,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 04:10:38,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 04:10:38,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 04:10:38,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 04:10:38,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 04:10:38,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 04:10:38,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 04:10:38,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 04:10:38,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 04:10:38,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 04:10:38,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 04:10:38,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 04:10:38,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 04:10:38,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 04:10:38,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 04:10:38,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 04:10:38,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 04:10:38,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 04:10:38,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 04:10:38,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 04:10:38,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 04:10:38,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 04:10:38,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 04:10:38,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 04:10:38,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 04:10:38,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-10-29 04:10:38,501 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 04:10:38,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 04:10:38,506 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 04:10:38,506 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-10-29 04:10:38,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 04:10:38,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 04:10:38,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 04:10:38,508 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 04:10:38,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 04:10:38,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 04:10:38,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 04:10:38,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 04:10:38,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 04:10:38,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 04:10:38,516 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 04:10:38,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 04:10:38,517 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 04:10:38,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 04:10:38,517 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-10-29 04:10:38,517 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-10-29 04:10:38,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 04:10:38,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 04:10:38,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 04:10:38,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 04:10:38,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 04:10:38,519 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-10-29 04:10:38,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 04:10:38,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 04:10:38,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI 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(reach_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 -> 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 [2021-10-29 04:10:38,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 04:10:38,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 04:10:38,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 04:10:38,903 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 04:10:38,904 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 04:10:38,906 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2021-10-29 04:10:38,972 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/data/571ed95b0/6de3d7c992a847ab81ae5d49d750093e/FLAG451dea7e4 [2021-10-29 04:10:39,602 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 04:10:39,606 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2021-10-29 04:10:39,629 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/data/571ed95b0/6de3d7c992a847ab81ae5d49d750093e/FLAG451dea7e4 [2021-10-29 04:10:39,874 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/data/571ed95b0/6de3d7c992a847ab81ae5d49d750093e [2021-10-29 04:10:39,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 04:10:39,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 04:10:39,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 04:10:39,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 04:10:39,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 04:10:39,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:10:39" (1/1) ... [2021-10-29 04:10:39,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5632d8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:10:39, skipping insertion in model container [2021-10-29 04:10:39,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:10:39" (1/1) ... [2021-10-29 04:10:39,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 04:10:39,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 04:10:40,204 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2021-10-29 04:10:40,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:10:40,218 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 04:10:40,331 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2021-10-29 04:10:40,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:10:40,364 INFO L208 MainTranslator]: Completed translation [2021-10-29 04:10:40,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:10:40 WrapperNode [2021-10-29 04:10:40,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 04:10:40,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 04:10:40,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 04:10:40,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 04:10:40,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:10:40" (1/1) ... [2021-10-29 04:10:40,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:10:40" (1/1) ... [2021-10-29 04:10:40,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 04:10:40,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 04:10:40,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 04:10:40,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 04:10:40,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:10:40" (1/1) ... [2021-10-29 04:10:40,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:10:40" (1/1) ... [2021-10-29 04:10:40,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:10:40" (1/1) ... [2021-10-29 04:10:40,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:10:40" (1/1) ... [2021-10-29 04:10:40,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:10:40" (1/1) ... [2021-10-29 04:10:40,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:10:40" (1/1) ... [2021-10-29 04:10:40,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:10:40" (1/1) ... [2021-10-29 04:10:40,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 04:10:40,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 04:10:40,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 04:10:40,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 04:10:40,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:10:40" (1/1) ... [2021-10-29 04:10:40,567 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 04:10:40,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/z3 [2021-10-29 04:10:40,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-10-29 04:10:40,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-10-29 04:10:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 04:10:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 04:10:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 04:10:40,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 04:10:43,652 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 04:10:43,652 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-10-29 04:10:43,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:10:43 BoogieIcfgContainer [2021-10-29 04:10:43,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 04:10:43,656 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-10-29 04:10:43,656 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-10-29 04:10:43,668 INFO L275 PluginConnector]: CodeCheck initialized [2021-10-29 04:10:43,668 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:10:43" (1/1) ... [2021-10-29 04:10:43,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:10:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:10:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2021-10-29 04:10:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2021-10-29 04:10:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 04:10:43,727 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:10:43,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:10:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:10:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:10:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:10:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2021-10-29 04:10:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2021-10-29 04:10:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-29 04:10:44,625 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:10:44,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:10:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:10:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:10:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:10:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2021-10-29 04:10:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2021-10-29 04:10:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 04:10:45,339 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:10:45,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:10:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:10:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:10:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:10:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2021-10-29 04:10:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2021-10-29 04:10:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 04:10:46,126 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:10:46,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:10:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:10:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:10:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:10:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2021-10-29 04:10:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2021-10-29 04:10:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 04:10:47,156 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:10:47,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:10:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:10:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:10:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:10:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2021-10-29 04:10:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2021-10-29 04:10:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 04:10:48,438 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:10:48,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:10:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:10:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:10:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:10:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2021-10-29 04:10:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2021-10-29 04:10:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 04:10:49,820 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:10:49,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:10:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:10:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:10:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:10:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2021-10-29 04:10:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2021-10-29 04:10:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 04:10:50,179 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:10:50,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:10:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:10:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:10:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:10:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2021-10-29 04:10:50,277 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2021-10-29 04:10:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 04:10:50,278 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:10:50,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:10:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:10:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:10:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:10:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2021-10-29 04:10:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2021-10-29 04:10:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 04:10:52,375 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:10:52,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:10:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:10:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:10:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:10:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2021-10-29 04:10:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2021-10-29 04:10:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 04:10:52,814 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:10:52,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:10:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:10:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:10:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:10:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 74 states and 136 transitions. [2021-10-29 04:10:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 136 transitions. [2021-10-29 04:10:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 04:10:58,099 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:10:58,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:10:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:10:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 87 states and 159 transitions. [2021-10-29 04:11:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2021-10-29 04:11:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 04:11:02,495 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:02,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:11:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 104 states and 188 transitions. [2021-10-29 04:11:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2021-10-29 04:11:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 04:11:08,324 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:08,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:11:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 122 states and 218 transitions. [2021-10-29 04:11:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 218 transitions. [2021-10-29 04:11:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 04:11:13,798 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:13,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:11:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 129 states and 231 transitions. [2021-10-29 04:11:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 231 transitions. [2021-10-29 04:11:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 04:11:19,712 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:19,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:11:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 134 states and 240 transitions. [2021-10-29 04:11:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 240 transitions. [2021-10-29 04:11:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 04:11:21,912 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:21,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:11:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 141 states and 255 transitions. [2021-10-29 04:11:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 255 transitions. [2021-10-29 04:11:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 04:11:27,008 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:27,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:11:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:33,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 153 states and 283 transitions. [2021-10-29 04:11:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 283 transitions. [2021-10-29 04:11:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-29 04:11:33,128 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:33,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:11:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 163 states and 300 transitions. [2021-10-29 04:11:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 300 transitions. [2021-10-29 04:11:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 04:11:39,403 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:39,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:11:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 174 states and 322 transitions. [2021-10-29 04:11:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 322 transitions. [2021-10-29 04:11:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 04:11:45,663 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:45,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:11:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 175 states and 325 transitions. [2021-10-29 04:11:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 325 transitions. [2021-10-29 04:11:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 04:11:46,794 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:46,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:11:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 183 states and 340 transitions. [2021-10-29 04:11:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 340 transitions. [2021-10-29 04:11:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 04:11:52,515 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:52,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:11:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 187 states and 352 transitions. [2021-10-29 04:11:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 352 transitions. [2021-10-29 04:11:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 04:11:55,357 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:55,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:11:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:11:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:11:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 190 states and 361 transitions. [2021-10-29 04:11:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 361 transitions. [2021-10-29 04:11:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 04:11:57,430 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:11:57,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:11:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:12:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:12:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:12:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 197 states and 381 transitions. [2021-10-29 04:12:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 381 transitions. [2021-10-29 04:12:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 04:12:07,196 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:12:07,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:12:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:12:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:12:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:12:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 200 states and 392 transitions. [2021-10-29 04:12:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 392 transitions. [2021-10-29 04:12:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 04:12:10,289 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:12:10,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:12:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:12:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:12:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:12:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 201 states and 393 transitions. [2021-10-29 04:12:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 393 transitions. [2021-10-29 04:12:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 04:12:12,359 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:12:12,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:12:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:12:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:12:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:12:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 204 states and 403 transitions. [2021-10-29 04:12:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 403 transitions. [2021-10-29 04:12:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 04:12:15,773 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:12:15,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:12:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:12:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:12:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:12:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 212 states and 418 transitions. [2021-10-29 04:12:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 418 transitions. [2021-10-29 04:12:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 04:12:21,088 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:12:21,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:12:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:12:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:12:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:12:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 217 states and 432 transitions. [2021-10-29 04:12:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 432 transitions. [2021-10-29 04:12:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 04:12:24,899 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:12:24,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:12:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:12:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:12:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:12:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 220 states and 439 transitions. [2021-10-29 04:12:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 439 transitions. [2021-10-29 04:12:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 04:12:27,132 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:12:27,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:12:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:12:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:12:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:12:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 224 states and 447 transitions. [2021-10-29 04:12:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 447 transitions. [2021-10-29 04:12:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 04:12:30,233 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:12:30,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:12:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:12:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:12:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:12:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 226 states and 454 transitions. [2021-10-29 04:12:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 454 transitions. [2021-10-29 04:12:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 04:12:36,730 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:12:36,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:12:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:12:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:12:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:12:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 231 states and 466 transitions. [2021-10-29 04:12:40,803 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 466 transitions. [2021-10-29 04:12:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 04:12:40,804 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:12:40,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:12:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:12:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:12:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:12:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 235 states and 477 transitions. [2021-10-29 04:12:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 477 transitions. [2021-10-29 04:12:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 04:12:44,046 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:12:44,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:12:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:12:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:12:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:12:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 238 states and 486 transitions. [2021-10-29 04:12:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 486 transitions. [2021-10-29 04:12:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-29 04:12:46,400 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:12:46,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:12:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:12:47,228 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 04:12:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:12:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:12:48,767 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 04:12:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:12:49,203 WARN L480 CodeCheckObserver]: This program is UNSAFE, Check terminated with 37 iterations. [2021-10-29 04:12:49,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.10 04:12:49 ImpRootNode [2021-10-29 04:12:49,432 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-10-29 04:12:49,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 04:12:49,433 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 04:12:49,433 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 04:12:49,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:10:43" (3/4) ... [2021-10-29 04:12:49,435 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 04:12:49,637 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/witness.graphml [2021-10-29 04:12:49,637 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 04:12:49,639 INFO L168 Benchmark]: Toolchain (without parser) took 129759.48 ms. Allocated memory was 117.4 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 78.8 MB in the beginning and 468.3 MB in the end (delta: -389.5 MB). Peak memory consumption was 617.9 MB. Max. memory is 16.1 GB. [2021-10-29 04:12:49,639 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 117.4 MB. Free memory is still 95.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:12:49,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.53 ms. Allocated memory is still 117.4 MB. Free memory was 78.5 MB in the beginning and 85.8 MB in the end (delta: -7.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-29 04:12:49,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.79 ms. Allocated memory is still 117.4 MB. Free memory was 85.8 MB in the beginning and 83.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:12:49,641 INFO L168 Benchmark]: Boogie Preprocessor took 88.08 ms. Allocated memory is still 117.4 MB. Free memory was 83.1 MB in the beginning and 80.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:12:49,641 INFO L168 Benchmark]: RCFGBuilder took 3110.61 ms. Allocated memory was 117.4 MB in the beginning and 159.4 MB in the end (delta: 41.9 MB). Free memory was 80.4 MB in the beginning and 114.3 MB in the end (delta: -33.9 MB). Peak memory consumption was 83.4 MB. Max. memory is 16.1 GB. [2021-10-29 04:12:49,642 INFO L168 Benchmark]: CodeCheck took 125775.85 ms. Allocated memory was 159.4 MB in the beginning and 1.1 GB in the end (delta: 964.7 MB). Free memory was 114.3 MB in the beginning and 490.3 MB in the end (delta: -376.0 MB). Peak memory consumption was 587.7 MB. Max. memory is 16.1 GB. [2021-10-29 04:12:49,642 INFO L168 Benchmark]: Witness Printer took 204.63 ms. Allocated memory is still 1.1 GB. Free memory was 490.3 MB in the beginning and 468.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:12:49,645 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 125.5s, OverallIterations: 37, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: -1610612736 SDtfs, -364158324 SDslu, -2147483648 SDs, 0 SdLazy, 587843092 SolverSat, 2089815980 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 81.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10506 GetRequests, 9225 SyntacticMatches, 457 SemanticMatches, 824 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404496 ImplicationChecksByTransitivity, 99.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 12.4s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 1010 NumberOfCodeBlocks, 1010 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 929 ConstructedInterpolants, 0 QuantifiedInterpolants, 14976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 10 PerfectInterpolantSequences, 118/623 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 609]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND FALSE !(\read(r121)) [L271] COND TRUE \read(r131) [L272] COND TRUE \read(ep32) [L273] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND TRUE \read(r211) [L295] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND TRUE \read(r211) [L311] COND TRUE \read(ep13) [L312] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND TRUE \read(r321) [L324] COND TRUE \read(ep21) [L325] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND TRUE \read(r321) [L334] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] i2 = init() [L22] COND FALSE !(!cond) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=1, newmax3=255, 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] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND TRUE \read(newmax2) [L171] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L171] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND TRUE \read(newmax3) [L230] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L230] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L234] mode3 = (_Bool)1 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, 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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, 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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, 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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, 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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, 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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, 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] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, 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] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, 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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, 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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, 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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, 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] [L523] return (tmp); [L595] c1 = check() [L607] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=3, m2=3, m3=1, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, 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] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND TRUE (int )m1 > (int )max1 [L92] max1 = m1 [L93] newmax = (_Bool)1 [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] return (tmp); [L595] c1 = check() [L607] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND FALSE !(\read(newmax2)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND FALSE !(\read(newmax3)) [L234] mode3 = (_Bool)1 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] return (tmp); [L595] c1 = check() [L607] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND FALSE !((int )m1 > (int )max1) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] st1 = (char)1 [L112] mode1 = (_Bool)0 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND TRUE (int )m3 > (int )max3 [L200] max3 = m3 [L201] newmax = (_Bool)1 [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND FALSE !((int )max3 == (int )id3) [L217] nl3 = (char)1 [L220] mode3 = (_Bool)0 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=-1, m2=-1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=-1, m2=-1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L523] return (tmp); [L595] c1 = check() [L607] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=-1, m2=-1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L609] reach_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=0, id2=2, id3=1, m1=-1, m2=-1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 117.4 MB. Free memory is still 95.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 473.53 ms. Allocated memory is still 117.4 MB. Free memory was 78.5 MB in the beginning and 85.8 MB in the end (delta: -7.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 89.79 ms. Allocated memory is still 117.4 MB. Free memory was 85.8 MB in the beginning and 83.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 88.08 ms. Allocated memory is still 117.4 MB. Free memory was 83.1 MB in the beginning and 80.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3110.61 ms. Allocated memory was 117.4 MB in the beginning and 159.4 MB in the end (delta: 41.9 MB). Free memory was 80.4 MB in the beginning and 114.3 MB in the end (delta: -33.9 MB). Peak memory consumption was 83.4 MB. Max. memory is 16.1 GB. * CodeCheck took 125775.85 ms. Allocated memory was 159.4 MB in the beginning and 1.1 GB in the end (delta: 964.7 MB). Free memory was 114.3 MB in the beginning and 490.3 MB in the end (delta: -376.0 MB). Peak memory consumption was 587.7 MB. Max. memory is 16.1 GB. * Witness Printer took 204.63 ms. Allocated memory is still 1.1 GB. Free memory was 490.3 MB in the beginning and 468.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! [2021-10-29 04:12:49,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b50593-46c4-4a68-87c5-153f89f83a12/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...