./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.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_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/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_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/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_86ece0d4-dabb-4124-92d7-97aa9f9ca187/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 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:57:41,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 02:57:41,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 02:57:41,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 02:57:41,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 02:57:41,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 02:57:41,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 02:57:41,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 02:57:41,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 02:57:41,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 02:57:41,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 02:57:41,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 02:57:41,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 02:57:41,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 02:57:41,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 02:57:41,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 02:57:41,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 02:57:41,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 02:57:41,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 02:57:41,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 02:57:41,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 02:57:41,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 02:57:41,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 02:57:41,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 02:57:41,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 02:57:41,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 02:57:41,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 02:57:41,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 02:57:41,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 02:57:41,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 02:57:41,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 02:57:41,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 02:57:41,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 02:57:41,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 02:57:41,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 02:57:41,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 02:57:41,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 02:57:41,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 02:57:41,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 02:57:41,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 02:57:41,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 02:57:41,446 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-10-29 02:57:41,491 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 02:57:41,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 02:57:41,493 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 02:57:41,494 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-10-29 02:57:41,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 02:57:41,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 02:57:41,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 02:57:41,496 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 02:57:41,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 02:57:41,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 02:57:41,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 02:57:41,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 02:57:41,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 02:57:41,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 02:57:41,498 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 02:57:41,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 02:57:41,499 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 02:57:41,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 02:57:41,499 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-10-29 02:57:41,499 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-10-29 02:57:41,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 02:57:41,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 02:57:41,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 02:57:41,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 02:57:41,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 02:57:41,501 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-10-29 02:57:41,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 02:57:41,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 02:57:41,502 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_86ece0d4-dabb-4124-92d7-97aa9f9ca187/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_86ece0d4-dabb-4124-92d7-97aa9f9ca187/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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2021-10-29 02:57:41,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 02:57:41,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 02:57:41,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 02:57:41,909 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 02:57:41,911 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 02:57:41,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2021-10-29 02:57:41,991 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/data/983ab4bcd/6d6e078d4f3c42489ef636719bce6929/FLAGc7f95c8b3 [2021-10-29 02:57:42,531 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 02:57:42,534 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2021-10-29 02:57:42,542 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/data/983ab4bcd/6d6e078d4f3c42489ef636719bce6929/FLAGc7f95c8b3 [2021-10-29 02:57:42,892 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/data/983ab4bcd/6d6e078d4f3c42489ef636719bce6929 [2021-10-29 02:57:42,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 02:57:42,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 02:57:42,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 02:57:42,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 02:57:42,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 02:57:42,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 02:57:42" (1/1) ... [2021-10-29 02:57:42,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e669e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:57:42, skipping insertion in model container [2021-10-29 02:57:42,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 02:57:42" (1/1) ... [2021-10-29 02:57:42,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 02:57:42,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 02:57:43,200 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_86ece0d4-dabb-4124-92d7-97aa9f9ca187/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2021-10-29 02:57:43,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 02:57:43,214 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 02:57:43,251 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_86ece0d4-dabb-4124-92d7-97aa9f9ca187/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2021-10-29 02:57:43,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 02:57:43,268 INFO L208 MainTranslator]: Completed translation [2021-10-29 02:57:43,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:57:43 WrapperNode [2021-10-29 02:57:43,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 02:57:43,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 02:57:43,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 02:57:43,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 02:57:43,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:57:43" (1/1) ... [2021-10-29 02:57:43,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:57:43" (1/1) ... [2021-10-29 02:57:43,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 02:57:43,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 02:57:43,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 02:57:43,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 02:57:43,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:57:43" (1/1) ... [2021-10-29 02:57:43,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:57:43" (1/1) ... [2021-10-29 02:57:43,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:57:43" (1/1) ... [2021-10-29 02:57:43,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:57:43" (1/1) ... [2021-10-29 02:57:43,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:57:43" (1/1) ... [2021-10-29 02:57:43,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:57:43" (1/1) ... [2021-10-29 02:57:43,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:57:43" (1/1) ... [2021-10-29 02:57:43,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 02:57:43,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 02:57:43,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 02:57:43,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 02:57:43,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 02:57:43" (1/1) ... [2021-10-29 02:57:43,385 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 02:57:43,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/z3 [2021-10-29 02:57:43,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-10-29 02:57:43,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-10-29 02:57:43,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 02:57:43,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 02:57:43,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 02:57:43,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 02:57:44,968 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 02:57:44,968 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-10-29 02:57:44,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 02:57:44 BoogieIcfgContainer [2021-10-29 02:57:44,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 02:57:44,973 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-10-29 02:57:44,973 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-10-29 02:57:44,985 INFO L275 PluginConnector]: CodeCheck initialized [2021-10-29 02:57:44,985 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 02:57:44" (1/1) ... [2021-10-29 02:57:44,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 02:57:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:57:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 11 states and 15 transitions. [2021-10-29 02:57:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2021-10-29 02:57:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 02:57:45,065 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:57:45,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:57:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:57:45,506 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 02:57:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:57:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2021-10-29 02:57:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2021-10-29 02:57:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 02:57:45,590 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:57:45,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:57:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:57:45,819 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 02:57:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:57:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 15 states and 24 transitions. [2021-10-29 02:57:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2021-10-29 02:57:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 02:57:46,099 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:57:46,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:57:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:57:46,390 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 02:57:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:57:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 19 states and 32 transitions. [2021-10-29 02:57:46,879 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. [2021-10-29 02:57:46,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 02:57:46,880 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:57:46,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:57:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:57:46,999 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 02:57:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:57:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 22 states and 41 transitions. [2021-10-29 02:57:47,282 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 41 transitions. [2021-10-29 02:57:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 02:57:47,283 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:57:47,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:57:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:57:48,106 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 02:57:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:57:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 31 states and 68 transitions. [2021-10-29 02:57:51,575 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 68 transitions. [2021-10-29 02:57:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 02:57:51,577 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:57:51,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:57:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:57:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:57:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:57:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 38 states and 82 transitions. [2021-10-29 02:57:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 82 transitions. [2021-10-29 02:57:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 02:57:54,226 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:57:54,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:57:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:57:55,385 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 02:58:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 49 states and 106 transitions. [2021-10-29 02:58:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 106 transitions. [2021-10-29 02:58:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 02:58:00,532 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:00,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 57 states and 133 transitions. [2021-10-29 02:58:05,141 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 133 transitions. [2021-10-29 02:58:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 02:58:05,143 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:05,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 63 states and 147 transitions. [2021-10-29 02:58:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 147 transitions. [2021-10-29 02:58:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 02:58:08,513 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:08,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:10,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 64 states and 150 transitions. [2021-10-29 02:58:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 150 transitions. [2021-10-29 02:58:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 02:58:10,539 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:10,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 69 states and 163 transitions. [2021-10-29 02:58:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 163 transitions. [2021-10-29 02:58:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 02:58:14,111 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:14,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 75 states and 179 transitions. [2021-10-29 02:58:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 179 transitions. [2021-10-29 02:58:18,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 02:58:18,380 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:18,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 76 states and 182 transitions. [2021-10-29 02:58:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 182 transitions. [2021-10-29 02:58:19,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 02:58:19,112 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:19,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 77 states and 184 transitions. [2021-10-29 02:58:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 184 transitions. [2021-10-29 02:58:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 02:58:19,771 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:19,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 78 states and 186 transitions. [2021-10-29 02:58:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 186 transitions. [2021-10-29 02:58:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 02:58:20,488 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:20,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:21,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 79 states and 188 transitions. [2021-10-29 02:58:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 188 transitions. [2021-10-29 02:58:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 02:58:21,188 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:21,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-29 02:58:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 79 states and 187 transitions. [2021-10-29 02:58:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 187 transitions. [2021-10-29 02:58:21,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 02:58:21,721 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:21,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 102 states and 251 transitions. [2021-10-29 02:58:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 251 transitions. [2021-10-29 02:58:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 02:58:50,570 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:50,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:58:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:58:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:58:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 108 states and 262 transitions. [2021-10-29 02:58:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 262 transitions. [2021-10-29 02:58:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 02:58:58,751 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:58:58,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:58:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:59:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 02:59:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 02:59:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 129 states and 309 transitions. [2021-10-29 02:59:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 309 transitions. [2021-10-29 02:59:38,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 02:59:38,904 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 02:59:38,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 02:59:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 02:59:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:00:05,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 142 states and 342 transitions. [2021-10-29 03:00:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 342 transitions. [2021-10-29 03:00:05,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 03:00:05,243 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:05,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:00:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:00:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 143 states and 344 transitions. [2021-10-29 03:00:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 344 transitions. [2021-10-29 03:00:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 03:00:09,750 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:09,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:00:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:00:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 152 states and 374 transitions. [2021-10-29 03:00:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 374 transitions. [2021-10-29 03:00:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 03:00:22,307 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:22,307 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:00:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:00:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 154 states and 382 transitions. [2021-10-29 03:00:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 382 transitions. [2021-10-29 03:00:26,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 03:00:26,779 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:26,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:00:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:00:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 159 states and 388 transitions. [2021-10-29 03:00:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 388 transitions. [2021-10-29 03:00:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 03:00:32,678 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:32,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:00:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:00:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 168 states and 431 transitions. [2021-10-29 03:00:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 431 transitions. [2021-10-29 03:00:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 03:00:53,340 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:53,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:00:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:00:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:00:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 170 states and 434 transitions. [2021-10-29 03:00:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 434 transitions. [2021-10-29 03:00:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 03:00:58,693 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:00:58,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:00:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:00:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-29 03:01:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:01:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 175 states and 447 transitions. [2021-10-29 03:01:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 447 transitions. [2021-10-29 03:01:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 03:01:03,438 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:01:03,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:01:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:01:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:01:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:01:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 180 states and 454 transitions. [2021-10-29 03:01:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 454 transitions. [2021-10-29 03:01:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 03:01:10,682 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:01:10,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:01:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:01:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:01:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:01:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 184 states and 460 transitions. [2021-10-29 03:01:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 460 transitions. [2021-10-29 03:01:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 03:01:17,598 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:01:17,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:01:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:01:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-29 03:01:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:01:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 185 states and 463 transitions. [2021-10-29 03:01:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 463 transitions. [2021-10-29 03:01:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 03:01:19,000 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:01:19,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:01:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:01:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:01:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:01:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 187 states and 469 transitions. [2021-10-29 03:01:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 469 transitions. [2021-10-29 03:01:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 03:01:22,168 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:01:22,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:01:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:01:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:01:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:01:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 188 states and 472 transitions. [2021-10-29 03:01:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 472 transitions. [2021-10-29 03:01:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 03:01:24,668 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:01:24,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:01:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:01:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-29 03:01:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:01:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 189 states and 474 transitions. [2021-10-29 03:01:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 474 transitions. [2021-10-29 03:01:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-29 03:01:26,021 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:01:26,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:01:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:01:26,254 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:01:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:01:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:01:27,222 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:01:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:01:27,539 WARN L480 CodeCheckObserver]: This program is UNSAFE, Check terminated with 35 iterations. [2021-10-29 03:01:27,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.10 03:01:27 ImpRootNode [2021-10-29 03:01:27,714 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-10-29 03:01:27,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 03:01:27,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 03:01:27,725 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 03:01:27,726 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 02:57:44" (3/4) ... [2021-10-29 03:01:27,736 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 03:01:27,976 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/witness.graphml [2021-10-29 03:01:27,977 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 03:01:27,979 INFO L168 Benchmark]: Toolchain (without parser) took 225082.34 ms. Allocated memory was 96.5 MB in the beginning and 1.1 GB in the end (delta: 966.8 MB). Free memory was 60.5 MB in the beginning and 538.1 MB in the end (delta: -477.6 MB). Peak memory consumption was 488.7 MB. Max. memory is 16.1 GB. [2021-10-29 03:01:27,980 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 96.5 MB. Free memory was 77.4 MB in the beginning and 77.3 MB in the end (delta: 68.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 03:01:27,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.47 ms. Allocated memory is still 96.5 MB. Free memory was 60.3 MB in the beginning and 70.4 MB in the end (delta: -10.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 03:01:27,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.80 ms. Allocated memory is still 96.5 MB. Free memory was 70.4 MB in the beginning and 68.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 03:01:27,981 INFO L168 Benchmark]: Boogie Preprocessor took 49.26 ms. Allocated memory is still 96.5 MB. Free memory was 68.4 MB in the beginning and 66.8 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 03:01:27,982 INFO L168 Benchmark]: RCFGBuilder took 1607.10 ms. Allocated memory was 96.5 MB in the beginning and 125.8 MB in the end (delta: 29.4 MB). Free memory was 66.8 MB in the beginning and 64.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2021-10-29 03:01:27,982 INFO L168 Benchmark]: CodeCheck took 222741.77 ms. Allocated memory was 125.8 MB in the beginning and 1.1 GB in the end (delta: 937.4 MB). Free memory was 63.8 MB in the beginning and 550.7 MB in the end (delta: -486.8 MB). Peak memory consumption was 452.6 MB. Max. memory is 16.1 GB. [2021-10-29 03:01:27,983 INFO L168 Benchmark]: Witness Printer took 258.21 ms. Allocated memory is still 1.1 GB. Free memory was 550.7 MB in the beginning and 538.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-29 03:01:27,985 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, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 222.5s, OverallIterations: 35, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 SDtfs, 2020027108 SDslu, 0 SDs, 0 SdLazy, 1769894320 SolverSat, -1990462484 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 88.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10692 GetRequests, 9520 SyntacticMatches, 528 SemanticMatches, 644 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236022 ImplicationChecksByTransitivity, 190.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 35.2s InterpolantComputationTime, 882 NumberOfCodeBlocks, 882 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 807 ConstructedInterpolants, 0 QuantifiedInterpolants, 33358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 5 PerfectInterpolantSequences, 298/1082 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: 287]: 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] unsigned char r1 ; [L30] port_t p1 ; [L31] char p1_old ; [L32] char p1_new ; [L33] char id1 ; [L34] char st1 ; [L35] msg_t send1 ; [L36] _Bool mode1 ; [L37] port_t p2 ; [L38] char p2_old ; [L39] char p2_new ; [L40] char id2 ; [L41] char st2 ; [L42] msg_t send2 ; [L43] _Bool mode2 ; [L44] port_t p3 ; [L45] char p3_old ; [L46] char p3_new ; [L47] char id3 ; [L48] char st3 ; [L49] msg_t send3 ; [L50] _Bool mode3 ; [L235] int c1 ; [L236] int i2 ; [L239] c1 = 0 [L240] r1 = __VERIFIER_nondet_uchar() [L241] id1 = __VERIFIER_nondet_char() [L242] st1 = __VERIFIER_nondet_char() [L243] send1 = __VERIFIER_nondet_char() [L244] mode1 = __VERIFIER_nondet_bool() [L245] id2 = __VERIFIER_nondet_char() [L246] st2 = __VERIFIER_nondet_char() [L247] send2 = __VERIFIER_nondet_char() [L248] mode2 = __VERIFIER_nondet_bool() [L249] id3 = __VERIFIER_nondet_char() [L250] st3 = __VERIFIER_nondet_char() [L251] send3 = __VERIFIER_nondet_char() [L252] mode3 = __VERIFIER_nondet_bool() [L134] int tmp ; [L137] COND TRUE (int )r1 == 0 [L138] COND TRUE (int )id1 >= 0 [L139] COND TRUE (int )st1 == 0 [L140] COND TRUE (int )send1 == (int )id1 [L141] COND TRUE (int )mode1 == 0 [L142] COND TRUE (int )id2 >= 0 [L143] COND TRUE (int )st2 == 0 [L144] COND TRUE (int )send2 == (int )id2 [L145] COND TRUE (int )mode2 == 0 [L146] COND TRUE (int )id3 >= 0 [L147] COND TRUE (int )st3 == 0 [L148] COND TRUE (int )send3 == (int )id3 [L149] COND TRUE (int )mode3 == 0 [L150] COND TRUE (int )id1 != (int )id2 [L151] COND TRUE (int )id1 != (int )id3 [L152] COND TRUE (int )id2 != (int )id3 [L153] tmp = 1 [L202] return (tmp); [L253] i2 = init() [L22] COND FALSE !(!cond) [L255] p1_old = nomsg [L256] p1_new = nomsg [L257] p2_old = nomsg [L258] p2_new = nomsg [L259] p3_old = nomsg [L260] p3_new = nomsg [L261] i2 = 0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L262] COND TRUE 1 [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L207] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L230] return (tmp); [L273] c1 = check() [L285] COND FALSE !(! arg) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L262] COND TRUE 1 [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND FALSE !((int )m1 == (int )id1) [L71] send1 = m1 [L74] mode1 = (_Bool)0 [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND TRUE (int )m2 > (int )id2 [L93] send2 = m2 [L99] mode2 = (_Bool)0 [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND TRUE (int )m3 > (int )id3 [L118] send3 = m3 [L124] mode3 = (_Bool)0 [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L207] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L230] return (tmp); [L273] c1 = check() [L285] COND FALSE !(! arg) VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L262] COND TRUE 1 [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L207] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L230] return (tmp); [L273] c1 = check() [L285] COND FALSE !(! arg) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L262] COND TRUE 1 [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND FALSE !((int )m1 == (int )id1) [L71] send1 = m1 [L74] mode1 = (_Bool)0 [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND FALSE !((int )m2 > (int )id2) [L95] COND FALSE !((int )m2 == (int )id2) [L99] mode2 = (_Bool)0 [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND TRUE (int )m3 > (int )id3 [L118] send3 = m3 [L124] mode3 = (_Bool)0 [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L207] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L230] return (tmp); [L273] c1 = check() [L285] COND FALSE !(! arg) VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L262] COND TRUE 1 [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L207] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L230] return (tmp); [L273] c1 = check() [L285] COND FALSE !(! arg) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L262] COND TRUE 1 [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND TRUE (int )m1 == (int )id1 [L69] st1 = (char)1 [L74] mode1 = (_Bool)0 [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND FALSE !((int )m2 > (int )id2) [L95] COND TRUE (int )m2 == (int )id2 [L96] st2 = (char)1 [L99] mode2 = (_Bool)0 [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND TRUE (int )m3 > (int )id3 [L118] send3 = m3 [L124] mode3 = (_Bool)0 [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L207] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L210] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L228] tmp = 0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L230] return (tmp); [L273] c1 = check() [L285] COND TRUE ! arg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L287] reach_error() VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 96.5 MB. Free memory was 77.4 MB in the beginning and 77.3 MB in the end (delta: 68.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 360.47 ms. Allocated memory is still 96.5 MB. Free memory was 60.3 MB in the beginning and 70.4 MB in the end (delta: -10.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.80 ms. Allocated memory is still 96.5 MB. Free memory was 70.4 MB in the beginning and 68.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.26 ms. Allocated memory is still 96.5 MB. Free memory was 68.4 MB in the beginning and 66.8 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 1607.10 ms. Allocated memory was 96.5 MB in the beginning and 125.8 MB in the end (delta: 29.4 MB). Free memory was 66.8 MB in the beginning and 64.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. * CodeCheck took 222741.77 ms. Allocated memory was 125.8 MB in the beginning and 1.1 GB in the end (delta: 937.4 MB). Free memory was 63.8 MB in the beginning and 550.7 MB in the end (delta: -486.8 MB). Peak memory consumption was 452.6 MB. Max. memory is 16.1 GB. * Witness Printer took 258.21 ms. Allocated memory is still 1.1 GB. Free memory was 550.7 MB in the beginning and 538.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! [2021-10-29 03:01:28,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ece0d4-dabb-4124-92d7-97aa9f9ca187/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...