./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4 --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 d0cee5b1964cd71f7406ad577c9568bfea84778de80728dfc08113baa4a027fc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-15 00:40:49,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-15 00:40:49,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-15 00:40:49,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-15 00:40:49,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-15 00:40:49,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-15 00:40:49,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-15 00:40:49,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-15 00:40:49,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-15 00:40:49,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-15 00:40:49,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-15 00:40:49,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-15 00:40:49,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-15 00:40:49,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-15 00:40:49,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-15 00:40:49,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-15 00:40:49,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-15 00:40:49,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-15 00:40:49,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-15 00:40:49,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-15 00:40:49,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-15 00:40:49,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-15 00:40:49,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-15 00:40:49,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-15 00:40:49,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-15 00:40:49,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-15 00:40:49,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-15 00:40:49,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-15 00:40:49,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-15 00:40:49,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-15 00:40:49,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-15 00:40:49,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-15 00:40:49,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-15 00:40:49,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-15 00:40:49,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-15 00:40:49,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-15 00:40:49,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-15 00:40:49,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-15 00:40:49,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-15 00:40:49,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-15 00:40:49,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-15 00:40:49,486 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-15 00:40:49,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-15 00:40:49,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-15 00:40:49,506 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-15 00:40:49,506 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-15 00:40:49,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-15 00:40:49,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-15 00:40:49,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-15 00:40:49,512 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-15 00:40:49,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-15 00:40:49,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-15 00:40:49,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-15 00:40:49,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-15 00:40:49,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-15 00:40:49,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-15 00:40:49,513 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-15 00:40:49,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-15 00:40:49,514 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-15 00:40:49,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-15 00:40:49,514 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-15 00:40:49,514 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-15 00:40:49,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-15 00:40:49,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 00:40:49,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-15 00:40:49,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-15 00:40:49,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-15 00:40:49,515 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-15 00:40:49,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-15 00:40:49,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-15 00:40:49,516 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_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/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_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4 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 -> d0cee5b1964cd71f7406ad577c9568bfea84778de80728dfc08113baa4a027fc [2022-12-15 00:40:49,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-15 00:40:49,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-15 00:40:49,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-15 00:40:49,711 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-15 00:40:49,711 INFO L275 PluginConnector]: CDTParser initialized [2022-12-15 00:40:49,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2022-12-15 00:40:52,323 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-15 00:40:52,492 INFO L351 CDTParser]: Found 1 translation units. [2022-12-15 00:40:52,492 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2022-12-15 00:40:52,498 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/data/404d07d1b/4fb54629aaa54f94aeb490b0b871b3dc/FLAG3ef7f15b0 [2022-12-15 00:40:52,513 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/data/404d07d1b/4fb54629aaa54f94aeb490b0b871b3dc [2022-12-15 00:40:52,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-15 00:40:52,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-15 00:40:52,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-15 00:40:52,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-15 00:40:52,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-15 00:40:52,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af95f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52, skipping insertion in model container [2022-12-15 00:40:52,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-15 00:40:52,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-15 00:40:52,693 WARN L237 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_fd8ec720-7203-430f-816d-6aa060982f35/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c[6940,6953] [2022-12-15 00:40:52,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 00:40:52,707 INFO L203 MainTranslator]: Completed pre-run [2022-12-15 00:40:52,745 WARN L237 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_fd8ec720-7203-430f-816d-6aa060982f35/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c[6940,6953] [2022-12-15 00:40:52,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 00:40:52,758 INFO L208 MainTranslator]: Completed translation [2022-12-15 00:40:52,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52 WrapperNode [2022-12-15 00:40:52,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-15 00:40:52,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-15 00:40:52,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-15 00:40:52,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-15 00:40:52,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,795 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 229 [2022-12-15 00:40:52,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-15 00:40:52,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-15 00:40:52,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-15 00:40:52,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-15 00:40:52,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,822 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-15 00:40:52,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-15 00:40:52,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-15 00:40:52,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-15 00:40:52,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:40:52" (1/1) ... [2022-12-15 00:40:52,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 00:40:52,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/z3 [2022-12-15 00:40:52,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-15 00:40:52,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-15 00:40:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-15 00:40:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-15 00:40:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-15 00:40:52,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-15 00:40:52,949 INFO L235 CfgBuilder]: Building ICFG [2022-12-15 00:40:52,951 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-15 00:40:53,209 INFO L276 CfgBuilder]: Performing block encoding [2022-12-15 00:40:53,427 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-15 00:40:53,427 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-15 00:40:53,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:40:53 BoogieIcfgContainer [2022-12-15 00:40:53,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-15 00:40:53,430 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-15 00:40:53,430 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-15 00:40:53,437 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-15 00:40:53,437 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:40:53" (1/1) ... [2022-12-15 00:40:53,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-15 00:40:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:40:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2022-12-15 00:40:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2022-12-15 00:40:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-15 00:40:53,483 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:40:53,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:40:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:40:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:40:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:40:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 8 states and 10 transitions. [2022-12-15 00:40:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2022-12-15 00:40:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-15 00:40:54,288 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:40:54,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:40:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:40:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:40:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:40:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 12 states and 18 transitions. [2022-12-15 00:40:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. [2022-12-15 00:40:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-15 00:40:57,311 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:40:57,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:40:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:40:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:41:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:41:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 17 states and 29 transitions. [2022-12-15 00:41:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 29 transitions. [2022-12-15 00:41:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-15 00:41:00,637 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:41:00,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:41:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:41:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:41:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:41:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 26 states and 52 transitions. [2022-12-15 00:41:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 52 transitions. [2022-12-15 00:41:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-15 00:41:24,911 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:41:24,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:41:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:41:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:42:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:42:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 36 states and 80 transitions. [2022-12-15 00:42:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 80 transitions. [2022-12-15 00:42:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-15 00:42:17,667 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:42:17,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:42:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:42:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:42:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:42:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 38 states and 82 transitions. [2022-12-15 00:42:22,231 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 82 transitions. [2022-12-15 00:42:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-15 00:42:22,232 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:42:22,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:42:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:42:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:42:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:42:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 40 states and 84 transitions. [2022-12-15 00:42:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 84 transitions. [2022-12-15 00:42:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-15 00:42:28,443 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:42:28,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:42:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:42:28,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 00:42:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:42:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:42:29,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 00:42:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:42:29,993 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 8 iterations. [2022-12-15 00:42:30,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 15.12 12:42:30 ImpRootNode [2022-12-15 00:42:30,039 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-15 00:42:30,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-15 00:42:30,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-15 00:42:30,040 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-15 00:42:30,040 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:40:53" (3/4) ... [2022-12-15 00:42:30,041 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-15 00:42:30,126 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-15 00:42:30,126 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-15 00:42:30,127 INFO L158 Benchmark]: Toolchain (without parser) took 97610.73ms. Allocated memory was 144.7MB in the beginning and 545.3MB in the end (delta: 400.6MB). Free memory was 108.8MB in the beginning and 414.1MB in the end (delta: -305.2MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2022-12-15 00:42:30,127 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-15 00:42:30,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.81ms. Allocated memory is still 144.7MB. Free memory was 108.8MB in the beginning and 95.4MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-15 00:42:30,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.03ms. Allocated memory is still 144.7MB. Free memory was 95.4MB in the beginning and 93.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-15 00:42:30,128 INFO L158 Benchmark]: Boogie Preprocessor took 30.83ms. Allocated memory is still 144.7MB. Free memory was 93.3MB in the beginning and 91.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-15 00:42:30,128 INFO L158 Benchmark]: RCFGBuilder took 601.29ms. Allocated memory is still 144.7MB. Free memory was 91.2MB in the beginning and 71.7MB in the end (delta: 19.5MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2022-12-15 00:42:30,128 INFO L158 Benchmark]: CodeCheck took 96609.19ms. Allocated memory was 144.7MB in the beginning and 545.3MB in the end (delta: 400.6MB). Free memory was 70.9MB in the beginning and 422.4MB in the end (delta: -351.6MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2022-12-15 00:42:30,128 INFO L158 Benchmark]: Witness Printer took 87.23ms. Allocated memory is still 545.3MB. Free memory was 422.4MB in the beginning and 414.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-15 00:42:30,129 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, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 96.5s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 287 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 280 mSDsCounter, 194 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 756 IncrementalHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 194 mSolverCounterUnsat, 7 mSDtfsCounter, 756 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 959 GetRequests, 781 SyntacticMatches, 30 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11267 ImplicationChecksByTransitivity, 59.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 39.4s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 12234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 15/91 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: 316]: 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] _Bool alive1 ; [L38] port_t p2 ; [L39] char p2_old ; [L40] char p2_new ; [L41] char id2 ; [L42] char st2 ; [L43] msg_t send2 ; [L44] _Bool mode2 ; [L45] _Bool alive2 ; [L46] port_t p3 ; [L47] char p3_old ; [L48] char p3_new ; [L49] char id3 ; [L50] char st3 ; [L51] msg_t send3 ; [L52] _Bool mode3 ; [L53] _Bool alive3 ; [L261] int c1 ; [L262] int i2 ; [L265] c1 = 0 [L266] r1 = __VERIFIER_nondet_uchar() [L267] id1 = __VERIFIER_nondet_char() [L268] st1 = __VERIFIER_nondet_char() [L269] send1 = __VERIFIER_nondet_char() [L270] mode1 = __VERIFIER_nondet_bool() [L271] alive1 = __VERIFIER_nondet_bool() [L272] id2 = __VERIFIER_nondet_char() [L273] st2 = __VERIFIER_nondet_char() [L274] send2 = __VERIFIER_nondet_char() [L275] mode2 = __VERIFIER_nondet_bool() [L276] alive2 = __VERIFIER_nondet_bool() [L277] id3 = __VERIFIER_nondet_char() [L278] st3 = __VERIFIER_nondet_char() [L279] send3 = __VERIFIER_nondet_char() [L280] mode3 = __VERIFIER_nondet_bool() [L281] alive3 = __VERIFIER_nondet_bool() [L282] CALL, EXPR init() [L164] int tmp ; [L167] COND TRUE (int )r1 == 0 [L168] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 [L169] COND TRUE (int )id1 >= 0 [L170] COND TRUE (int )st1 == 0 [L171] COND TRUE (int )send1 == (int )id1 [L172] COND TRUE (int )mode1 == 0 [L173] COND TRUE (int )id2 >= 0 [L174] COND TRUE (int )st2 == 0 [L175] COND TRUE (int )send2 == (int )id2 [L176] COND TRUE (int )mode2 == 0 [L177] COND TRUE (int )id3 >= 0 [L178] COND TRUE (int )st3 == 0 [L179] COND TRUE (int )send3 == (int )id3 [L180] COND TRUE (int )mode3 == 0 [L181] COND TRUE (int )id1 != (int )id2 [L182] COND TRUE (int )id1 != (int )id3 [L183] COND TRUE (int )id2 != (int )id3 [L184] tmp = 1 [L236] return (tmp); [L282] RET, EXPR init() [L282] i2 = init() [L283] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L283] RET assume_abort_if_not(i2) [L284] p1_old = nomsg [L285] p1_new = nomsg [L286] p2_old = nomsg [L287] p2_new = nomsg [L288] p3_old = nomsg [L289] p3_new = nomsg [L290] i2 = 0 VAL [alive1=1, alive2=1, alive3=255, c1=0, i2=0, id1=3, id2=2, id3=1, 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=3, send2=2, send3=1, st1=0, st2=0, st3=0] [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND FALSE !(\read(mode1)) [L83] COND TRUE \read(alive1) [L84] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L89] mode1 = (_Bool)1 [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg [L100] COND FALSE !(\read(mode2)) [L117] COND TRUE \read(alive2) [L118] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L123] mode2 = (_Bool)1 [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg [L134] COND FALSE !(\read(mode3)) [L151] COND TRUE \read(alive3) [L152] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L157] mode3 = (_Bool)1 [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=1, alive2=1, alive3=255, arg=1, id1=3, id2=2, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=3, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=0, send1=3, send2=2, send3=1, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND TRUE \read(mode1) [L61] COND FALSE !(r1 == 255) [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg [L67] COND TRUE (int )m1 != (int )nomsg [L68] COND TRUE \read(alive1) [L69] COND FALSE !((int )m1 > (int )id1) [L72] COND FALSE !((int )m1 == (int )id1) [L75] send1 = m1 [L81] mode1 = (_Bool)0 [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg [L100] COND TRUE \read(mode2) [L101] m2 = p1_old [L102] p1_old = nomsg [L103] COND TRUE (int )m2 != (int )nomsg [L104] COND TRUE \read(alive2) [L105] COND TRUE (int )m2 > (int )id2 [L106] send2 = m2 [L115] mode2 = (_Bool)0 [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg [L134] COND TRUE \read(mode3) [L135] m3 = p2_old [L136] p2_old = nomsg [L137] COND TRUE (int )m3 != (int )nomsg [L138] COND TRUE \read(alive3) [L139] COND TRUE (int )m3 > (int )id3 [L140] send3 = m3 [L149] mode3 = (_Bool)0 [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=1, alive2=1, alive3=255, arg=1, id1=3, id2=2, id3=1, 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=1, send2=3, send3=2, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND FALSE !(\read(mode1)) [L83] COND TRUE \read(alive1) [L84] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L89] mode1 = (_Bool)1 [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg [L100] COND FALSE !(\read(mode2)) [L117] COND TRUE \read(alive2) [L118] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L123] mode2 = (_Bool)1 [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg [L134] COND FALSE !(\read(mode3)) [L151] COND TRUE \read(alive3) [L152] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L157] mode3 = (_Bool)1 [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=1, alive2=1, alive3=255, arg=1, id1=3, id2=2, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=3, p3=0, p3_new=-1, p3_old=2, r1=1, send1=1, send2=3, send3=2, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND TRUE \read(mode1) [L61] COND FALSE !(r1 == 255) [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg [L67] COND TRUE (int )m1 != (int )nomsg [L68] COND TRUE \read(alive1) [L69] COND FALSE !((int )m1 > (int )id1) [L72] COND FALSE !((int )m1 == (int )id1) [L75] send1 = m1 [L81] mode1 = (_Bool)0 [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg [L100] COND TRUE \read(mode2) [L101] m2 = p1_old [L102] p1_old = nomsg [L103] COND TRUE (int )m2 != (int )nomsg [L104] COND TRUE \read(alive2) [L105] COND FALSE !((int )m2 > (int )id2) [L108] COND FALSE !((int )m2 == (int )id2) [L115] mode2 = (_Bool)0 [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg [L134] COND TRUE \read(mode3) [L135] m3 = p2_old [L136] p2_old = nomsg [L137] COND TRUE (int )m3 != (int )nomsg [L138] COND TRUE \read(alive3) [L139] COND TRUE (int )m3 > (int )id3 [L140] send3 = m3 [L149] mode3 = (_Bool)0 [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=1, alive2=1, alive3=255, arg=1, id1=3, id2=2, id3=1, 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=2, send2=3, send3=3, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND FALSE !(\read(mode1)) [L83] COND TRUE \read(alive1) [L84] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L89] mode1 = (_Bool)1 [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg [L100] COND FALSE !(\read(mode2)) [L117] COND TRUE \read(alive2) [L118] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L123] mode2 = (_Bool)1 [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg [L134] COND FALSE !(\read(mode3)) [L151] COND TRUE \read(alive3) [L152] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L157] mode3 = (_Bool)1 [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=1, alive2=1, alive3=255, arg=1, id1=3, id2=2, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=3, p3=0, p3_new=-1, p3_old=3, r1=2, send1=2, send2=3, send3=3, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND TRUE \read(mode1) [L61] COND FALSE !(r1 == 255) [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg [L67] COND TRUE (int )m1 != (int )nomsg [L68] COND TRUE \read(alive1) [L69] COND FALSE !((int )m1 > (int )id1) [L72] COND TRUE (int )m1 == (int )id1 [L73] st1 = (char)1 [L81] mode1 = (_Bool)0 [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg [L100] COND TRUE \read(mode2) [L101] m2 = p1_old [L102] p1_old = nomsg [L103] COND TRUE (int )m2 != (int )nomsg [L104] COND TRUE \read(alive2) [L105] COND FALSE !((int )m2 > (int )id2) [L108] COND TRUE (int )m2 == (int )id2 [L109] st2 = (char)1 [L115] mode2 = (_Bool)0 [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg [L134] COND TRUE \read(mode3) [L135] m3 = p2_old [L136] p2_old = nomsg [L137] COND TRUE (int )m3 != (int )nomsg [L138] COND TRUE \read(alive3) [L139] COND TRUE (int )m3 > (int )id3 [L140] send3 = m3 [L149] mode3 = (_Bool)0 [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; [L244] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L254] tmp = 0 [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND TRUE ! arg VAL [\old(arg)=0, alive1=1, alive2=1, alive3=255, arg=0, id1=3, id2=2, id3=1, 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=2, send2=3, send3=3, st1=1, st2=1, st3=0] [L316] reach_error() VAL [\old(arg)=0, alive1=1, alive2=1, alive3=255, arg=0, id1=3, id2=2, id3=1, 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=2, send2=3, send3=3, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.81ms. Allocated memory is still 144.7MB. Free memory was 108.8MB in the beginning and 95.4MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.03ms. Allocated memory is still 144.7MB. Free memory was 95.4MB in the beginning and 93.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.83ms. Allocated memory is still 144.7MB. Free memory was 93.3MB in the beginning and 91.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 601.29ms. Allocated memory is still 144.7MB. Free memory was 91.2MB in the beginning and 71.7MB in the end (delta: 19.5MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * CodeCheck took 96609.19ms. Allocated memory was 144.7MB in the beginning and 545.3MB in the end (delta: 400.6MB). Free memory was 70.9MB in the beginning and 422.4MB in the end (delta: -351.6MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * Witness Printer took 87.23ms. Allocated memory is still 545.3MB. Free memory was 422.4MB in the beginning and 414.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-15 00:42:30,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8ec720-7203-430f-816d-6aa060982f35/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE