./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --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 a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:11:11,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:11:11,828 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:11:11,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:11:11,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:11:11,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:11:11,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:11:11,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:11:11,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:11:11,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:11:11,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:11:11,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:11:11,886 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:11:11,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:11:11,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:11:11,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:11:11,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:11:11,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:11:11,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:11:11,892 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:11:11,892 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:11:11,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:11:11,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:11:11,893 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:11:11,897 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:11:11,898 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:11:11,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:11:11,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:11:11,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:11:11,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:11:11,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:11:11,900 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:11:11,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:11:11,900 INFO L153 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_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/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_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b [2024-11-09 00:11:12,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:11:12,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:11:12,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:11:12,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:11:12,223 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:11:12,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-09 00:11:14,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:11:14,610 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:11:14,610 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2024-11-09 00:11:14,620 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/data/4ea729917/f80dcd15ce8b4119a07200ff7488b54b/FLAGfcd489f4d [2024-11-09 00:11:14,636 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/data/4ea729917/f80dcd15ce8b4119a07200ff7488b54b [2024-11-09 00:11:14,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:11:14,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:11:14,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:11:14,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:11:14,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:11:14,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:11:14" (1/1) ... [2024-11-09 00:11:14,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456c9a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:14, skipping insertion in model container [2024-11-09 00:11:14,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:11:14" (1/1) ... [2024-11-09 00:11:14,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:11:14,937 WARN L250 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_d0b6e597-a795-4694-9dac-3019d19e6908/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2024-11-09 00:11:14,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:11:14,961 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:11:15,028 WARN L250 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_d0b6e597-a795-4694-9dac-3019d19e6908/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2024-11-09 00:11:15,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:11:15,049 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:11:15,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15 WrapperNode [2024-11-09 00:11:15,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:11:15,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:11:15,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:11:15,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:11:15,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,103 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-11-09 00:11:15,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:11:15,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:11:15,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:11:15,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:11:15,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,129 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:11:15,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:11:15,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:11:15,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:11:15,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:11:15" (1/1) ... [2024-11-09 00:11:15,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:11:15,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:11:15,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:11:15,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:11:15,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:11:15,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:11:15,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:11:15,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:11:15,309 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:11:15,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:11:15,782 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-09 00:11:15,783 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:11:16,266 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:11:16,267 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 00:11:16,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:11:16 BoogieIcfgContainer [2024-11-09 00:11:16,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:11:16,269 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:11:16,270 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:11:16,281 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:11:16,281 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:11:16" (1/1) ... [2024-11-09 00:11:16,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:11:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2024-11-09 00:11:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2024-11-09 00:11:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 00:11:16,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:11:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2024-11-09 00:11:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2024-11-09 00:11:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:11:18,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:11:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 18 states and 31 transitions. [2024-11-09 00:11:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 31 transitions. [2024-11-09 00:11:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:11:23,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:11:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 26 states and 52 transitions. [2024-11-09 00:11:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 52 transitions. [2024-11-09 00:11:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:11:28,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:11:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 40 states and 96 transitions. [2024-11-09 00:11:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 96 transitions. [2024-11-09 00:11:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:11:56,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:12:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:12:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:12:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 52 states and 140 transitions. [2024-11-09 00:12:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 140 transitions. [2024-11-09 00:12:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 00:12:30,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:12:30,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:12:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:12:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 68 states and 211 transitions. [2024-11-09 00:13:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 211 transitions. [2024-11-09 00:13:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 00:13:12,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 77 states and 249 transitions. [2024-11-09 00:13:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 249 transitions. [2024-11-09 00:13:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 00:13:31,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:31,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 81 states and 263 transitions. [2024-11-09 00:13:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 263 transitions. [2024-11-09 00:13:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 00:13:40,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:13:41,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:13:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:13:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:13:42,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:13:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:13:43,388 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 9 iterations. [2024-11-09 00:13:43,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:13:43 ImpRootNode [2024-11-09 00:13:43,494 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:13:43,494 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:13:43,494 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:13:43,495 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:13:43,495 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:11:16" (3/4) ... [2024-11-09 00:13:43,496 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 00:13:43,638 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:13:43,641 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:13:43,642 INFO L158 Benchmark]: Toolchain (without parser) took 149000.81ms. Allocated memory was 159.4MB in the beginning and 973.1MB in the end (delta: 813.7MB). Free memory was 125.5MB in the beginning and 429.1MB in the end (delta: -303.5MB). Peak memory consumption was 512.2MB. Max. memory is 16.1GB. [2024-11-09 00:13:43,642 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 113.2MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:13:43,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.43ms. Allocated memory is still 159.4MB. Free memory was 125.1MB in the beginning and 109.6MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:13:43,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.52ms. Allocated memory is still 159.4MB. Free memory was 109.2MB in the beginning and 106.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:13:43,643 INFO L158 Benchmark]: Boogie Preprocessor took 48.51ms. Allocated memory is still 159.4MB. Free memory was 106.8MB in the beginning and 105.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:13:43,643 INFO L158 Benchmark]: RCFGBuilder took 1114.08ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 105.1MB in the beginning and 151.5MB in the end (delta: -46.4MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2024-11-09 00:13:43,644 INFO L158 Benchmark]: CodeCheck took 147224.47ms. Allocated memory was 222.3MB in the beginning and 973.1MB in the end (delta: 750.8MB). Free memory was 151.5MB in the beginning and 438.5MB in the end (delta: -287.0MB). Peak memory consumption was 463.8MB. Max. memory is 16.1GB. [2024-11-09 00:13:43,644 INFO L158 Benchmark]: Witness Printer took 146.94ms. Allocated memory is still 973.1MB. Free memory was 438.5MB in the beginning and 429.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 00:13:43,646 INFO L338 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, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 147.1s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 533 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 480 mSDsluCounter, 1226 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 862 mSDsCounter, 290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1514 IncrementalHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 290 mSolverCounterUnsat, 364 mSDtfsCounter, 1514 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1769 GetRequests, 1498 SyntacticMatches, 39 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28853 ImplicationChecksByTransitivity, 90.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 56.6s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 10613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/163 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: 311]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 ; [L27] port_t p1 ; [L28] char p1_old ; [L29] char p1_new ; [L30] char id1 ; [L31] char st1 ; [L32] msg_t send1 ; [L33] _Bool mode1 ; [L34] _Bool alive1 ; [L35] port_t p2 ; [L36] char p2_old ; [L37] char p2_new ; [L38] char id2 ; [L39] char st2 ; [L40] msg_t send2 ; [L41] _Bool mode2 ; [L42] _Bool alive2 ; [L43] port_t p3 ; [L44] char p3_old ; [L45] char p3_new ; [L46] char id3 ; [L47] char st3 ; [L48] msg_t send3 ; [L49] _Bool mode3 ; [L50] _Bool alive3 ; [L255] int c1 ; [L256] int i2 ; [L259] c1 = 0 [L260] r1 = __VERIFIER_nondet_char() [L261] id1 = __VERIFIER_nondet_char() [L262] st1 = __VERIFIER_nondet_char() [L263] send1 = __VERIFIER_nondet_char() [L264] mode1 = __VERIFIER_nondet_bool() [L265] alive1 = __VERIFIER_nondet_bool() [L266] id2 = __VERIFIER_nondet_char() [L267] st2 = __VERIFIER_nondet_char() [L268] send2 = __VERIFIER_nondet_char() [L269] mode2 = __VERIFIER_nondet_bool() [L270] alive2 = __VERIFIER_nondet_bool() [L271] id3 = __VERIFIER_nondet_char() [L272] st3 = __VERIFIER_nondet_char() [L273] send3 = __VERIFIER_nondet_char() [L274] mode3 = __VERIFIER_nondet_bool() [L275] alive3 = __VERIFIER_nondet_bool() [L276] CALL, EXPR init() [L158] int tmp ; [L161] COND TRUE (int )r1 == 0 [L162] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 [L163] COND TRUE (int )id1 >= 0 [L164] COND TRUE (int )st1 == 0 [L165] COND TRUE (int )send1 == (int )id1 [L166] COND TRUE (int )mode1 == 0 [L167] COND TRUE (int )id2 >= 0 [L168] COND TRUE (int )st2 == 0 [L169] COND TRUE (int )send2 == (int )id2 [L170] COND TRUE (int )mode2 == 0 [L171] COND TRUE (int )id3 >= 0 [L172] COND TRUE (int )st3 == 0 [L173] COND TRUE (int )send3 == (int )id3 [L174] COND TRUE (int )mode3 == 0 [L175] COND TRUE (int )id1 != (int )id2 [L176] COND TRUE (int )id1 != (int )id3 [L177] COND TRUE (int )id2 != (int )id3 [L178] tmp = 1 [L230] return (tmp); [L276] RET, EXPR init() [L276] i2 = init() [L277] COND FALSE !(!(i2)) [L278] p1_old = nomsg [L279] p1_new = nomsg [L280] p2_old = nomsg [L281] p2_new = nomsg [L282] p3_old = nomsg [L283] p3_new = nomsg [L284] i2 = 0 VAL [alive1=1, alive2=0, alive3=1, i2=0, id1=127, id2=0, id3=126, 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=0, send3=126, st1=0, st2=0, st3=0] [L285] COND FALSE !(i2 < 6) VAL [alive1=1, alive2=0, alive3=1, i2=0, id1=127, id2=0, id3=126, 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=0, send3=126, st1=0, st2=0, st3=0] [L285] COND TRUE i2 < 6 [L287] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L77] COND TRUE \read(alive1) [L78] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L83] mode1 = (_Bool)1 [L287] RET node1() [L288] CALL node2() [L90] msg_t m2 ; [L93] m2 = nomsg [L94] COND FALSE !(\read(mode2)) [L111] COND FALSE !(\read(alive2)) [L114] COND FALSE !((int )send2 != (int )id2) [L117] mode2 = (_Bool)1 [L288] RET node2() [L289] CALL node3() [L124] msg_t m3 ; [L127] m3 = nomsg [L128] COND FALSE !(\read(mode3)) [L145] COND TRUE \read(alive3) [L146] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L151] mode3 = (_Bool)1 [L289] RET node3() [L290] p1_old = p1_new [L291] p1_new = nomsg [L292] p2_old = p2_new [L293] p2_new = nomsg [L294] p3_old = p3_new [L295] p3_new = nomsg [L296] CALL, EXPR check() [L235] int tmp ; [L238] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L239] COND TRUE (int )r1 < 3 [L240] tmp = 1 [L250] return (tmp); [L296] RET, EXPR check() [L296] c1 = check() [L297] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=1, alive2=0, alive3=1, id1=127, id2=0, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=0, send3=126, st1=0, st2=0, st3=0] [L297] RET assert(c1) [L298] i2 ++ VAL [alive1=1, alive2=0, alive3=1, i2=1, id1=127, id2=0, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=0, send3=126, st1=0, st2=0, st3=0] [L285] COND FALSE !(i2 < 6) VAL [alive1=1, alive2=0, alive3=1, i2=1, id1=127, id2=0, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=126, r1=0, send1=127, send2=0, send3=126, st1=0, st2=0, st3=0] [L285] COND TRUE i2 < 6 [L287] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg [L61] COND TRUE (int )m1 != (int )nomsg [L62] COND TRUE \read(alive1) [L63] COND FALSE !((int )m1 > (int )id1) [L66] COND FALSE !((int )m1 == (int )id1) [L69] send1 = m1 [L75] mode1 = (_Bool)0 [L287] RET node1() [L288] CALL node2() [L90] msg_t m2 ; [L93] m2 = nomsg [L94] COND TRUE \read(mode2) [L95] m2 = p1_old [L96] p1_old = nomsg [L97] COND TRUE (int )m2 != (int )nomsg [L98] COND FALSE !(\read(alive2)) [L106] send2 = m2 [L109] mode2 = (_Bool)0 [L288] RET node2() [L289] CALL node3() [L124] msg_t m3 ; [L127] m3 = nomsg [L128] COND TRUE \read(mode3) [L129] m3 = p2_old [L130] p2_old = nomsg [L131] COND FALSE !((int )m3 != (int )nomsg) [L143] mode3 = (_Bool)0 [L289] RET node3() [L290] p1_old = p1_new [L291] p1_new = nomsg [L292] p2_old = p2_new [L293] p2_new = nomsg [L294] p3_old = p3_new [L295] p3_new = nomsg [L296] CALL, EXPR check() [L235] int tmp ; [L238] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L239] COND TRUE (int )r1 < 3 [L240] tmp = 1 [L250] return (tmp); [L296] RET, EXPR check() [L296] c1 = check() [L297] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=1, alive2=0, alive3=1, id1=127, id2=0, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L297] RET assert(c1) [L298] i2 ++ VAL [alive1=1, alive2=0, alive3=1, i2=2, id1=127, id2=0, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L285] COND FALSE !(i2 < 6) VAL [alive1=1, alive2=0, alive3=1, i2=2, id1=127, id2=0, id3=126, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L285] COND TRUE i2 < 6 [L287] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L77] COND TRUE \read(alive1) [L78] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L83] mode1 = (_Bool)1 [L287] RET node1() [L288] CALL node2() [L90] msg_t m2 ; [L93] m2 = nomsg [L94] COND FALSE !(\read(mode2)) [L111] COND FALSE !(\read(alive2)) [L114] COND TRUE (int )send2 != (int )id2 [L115] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L117] mode2 = (_Bool)1 [L288] RET node2() [L289] CALL node3() [L124] msg_t m3 ; [L127] m3 = nomsg [L128] COND FALSE !(\read(mode3)) [L145] COND TRUE \read(alive3) [L146] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L151] mode3 = (_Bool)1 [L289] RET node3() [L290] p1_old = p1_new [L291] p1_new = nomsg [L292] p2_old = p2_new [L293] p2_new = nomsg [L294] p3_old = p3_new [L295] p3_new = nomsg [L296] CALL, EXPR check() [L235] int tmp ; [L238] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L239] COND TRUE (int )r1 < 3 [L240] tmp = 1 [L250] return (tmp); [L296] RET, EXPR check() [L296] c1 = check() [L297] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=1, alive2=0, alive3=1, id1=127, id2=0, id3=126, 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=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L297] RET assert(c1) [L298] i2 ++ VAL [alive1=1, alive2=0, alive3=1, i2=3, id1=127, id2=0, id3=126, 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=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L285] COND FALSE !(i2 < 6) VAL [alive1=1, alive2=0, alive3=1, i2=3, id1=127, id2=0, id3=126, 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=126, r1=1, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L285] COND TRUE i2 < 6 [L287] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg [L61] COND TRUE (int )m1 != (int )nomsg [L62] COND TRUE \read(alive1) [L63] COND FALSE !((int )m1 > (int )id1) [L66] COND FALSE !((int )m1 == (int )id1) [L69] send1 = m1 [L75] mode1 = (_Bool)0 [L287] RET node1() [L288] CALL node2() [L90] msg_t m2 ; [L93] m2 = nomsg [L94] COND TRUE \read(mode2) [L95] m2 = p1_old [L96] p1_old = nomsg [L97] COND TRUE (int )m2 != (int )nomsg [L98] COND FALSE !(\read(alive2)) [L106] send2 = m2 [L109] mode2 = (_Bool)0 [L288] RET node2() [L289] CALL node3() [L124] msg_t m3 ; [L127] m3 = nomsg [L128] COND TRUE \read(mode3) [L129] m3 = p2_old [L130] p2_old = nomsg [L131] COND TRUE (int )m3 != (int )nomsg [L132] COND TRUE \read(alive3) [L133] COND TRUE (int )m3 > (int )id3 [L134] send3 = m3 [L143] mode3 = (_Bool)0 [L289] RET node3() [L290] p1_old = p1_new [L291] p1_new = nomsg [L292] p2_old = p2_new [L293] p2_new = nomsg [L294] p3_old = p3_new [L295] p3_new = nomsg [L296] CALL, EXPR check() [L235] int tmp ; [L238] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L239] COND TRUE (int )r1 < 3 [L240] tmp = 1 [L250] return (tmp); [L296] RET, EXPR check() [L296] c1 = check() [L297] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=1, alive2=0, alive3=1, id1=127, id2=0, id3=126, 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=126, send3=127, st1=0, st2=0, st3=0] [L297] RET assert(c1) [L298] i2 ++ VAL [alive1=1, alive2=0, alive3=1, i2=4, id1=127, id2=0, id3=126, 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=126, send3=127, st1=0, st2=0, st3=0] [L285] COND FALSE !(i2 < 6) VAL [alive1=1, alive2=0, alive3=1, i2=4, id1=127, id2=0, id3=126, 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=126, send3=127, st1=0, st2=0, st3=0] [L285] COND TRUE i2 < 6 [L287] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L77] COND TRUE \read(alive1) [L78] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L83] mode1 = (_Bool)1 [L287] RET node1() [L288] CALL node2() [L90] msg_t m2 ; [L93] m2 = nomsg [L94] COND FALSE !(\read(mode2)) [L111] COND FALSE !(\read(alive2)) [L114] COND TRUE (int )send2 != (int )id2 [L115] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L117] mode2 = (_Bool)1 [L288] RET node2() [L289] CALL node3() [L124] msg_t m3 ; [L127] m3 = nomsg [L128] COND FALSE !(\read(mode3)) [L145] COND TRUE \read(alive3) [L146] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L151] mode3 = (_Bool)1 [L289] RET node3() [L290] p1_old = p1_new [L291] p1_new = nomsg [L292] p2_old = p2_new [L293] p2_new = nomsg [L294] p3_old = p3_new [L295] p3_new = nomsg [L296] CALL, EXPR check() [L235] int tmp ; [L238] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L239] COND TRUE (int )r1 < 3 [L240] tmp = 1 [L250] return (tmp); [L296] RET, EXPR check() [L296] c1 = check() [L297] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=1, alive2=0, alive3=1, id1=127, id2=0, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L297] RET assert(c1) [L298] i2 ++ VAL [alive1=1, alive2=0, alive3=1, i2=5, id1=127, id2=0, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L285] COND FALSE !(i2 < 6) VAL [alive1=1, alive2=0, alive3=1, i2=5, id1=127, id2=0, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=126, send3=127, st1=0, st2=0, st3=0] [L285] COND TRUE i2 < 6 [L287] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg [L61] COND TRUE (int )m1 != (int )nomsg [L62] COND TRUE \read(alive1) [L63] COND FALSE !((int )m1 > (int )id1) [L66] COND TRUE (int )m1 == (int )id1 [L67] st1 = (char)1 [L75] mode1 = (_Bool)0 [L287] RET node1() [L288] CALL node2() [L90] msg_t m2 ; [L93] m2 = nomsg [L94] COND TRUE \read(mode2) [L95] m2 = p1_old [L96] p1_old = nomsg [L97] COND TRUE (int )m2 != (int )nomsg [L98] COND FALSE !(\read(alive2)) [L106] send2 = m2 [L109] mode2 = (_Bool)0 [L288] RET node2() [L289] CALL node3() [L124] msg_t m3 ; [L127] m3 = nomsg [L128] COND TRUE \read(mode3) [L129] m3 = p2_old [L130] p2_old = nomsg [L131] COND TRUE (int )m3 != (int )nomsg [L132] COND TRUE \read(alive3) [L133] COND FALSE !((int )m3 > (int )id3) [L136] COND TRUE (int )m3 == (int )id3 [L137] st3 = (char)1 [L143] mode3 = (_Bool)0 [L289] RET node3() [L290] p1_old = p1_new [L291] p1_new = nomsg [L292] p2_old = p2_new [L293] p2_new = nomsg [L294] p3_old = p3_new [L295] p3_new = nomsg [L296] CALL, EXPR check() [L235] int tmp ; [L238] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L248] tmp = 0 [L250] return (tmp); [L296] RET, EXPR check() [L296] c1 = check() [L297] CALL assert(c1) [L309] COND TRUE ! arg VAL [alive1=1, alive2=0, alive3=1, id1=127, id2=0, id3=126, 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=126, send3=127, st1=1, st2=0, st3=1] [L311] reach_error() VAL [alive1=1, alive2=0, alive3=1, id1=127, id2=0, id3=126, 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=126, send3=127, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 113.2MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.43ms. Allocated memory is still 159.4MB. Free memory was 125.1MB in the beginning and 109.6MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.52ms. Allocated memory is still 159.4MB. Free memory was 109.2MB in the beginning and 106.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.51ms. Allocated memory is still 159.4MB. Free memory was 106.8MB in the beginning and 105.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1114.08ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 105.1MB in the beginning and 151.5MB in the end (delta: -46.4MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * CodeCheck took 147224.47ms. Allocated memory was 222.3MB in the beginning and 973.1MB in the end (delta: 750.8MB). Free memory was 151.5MB in the beginning and 438.5MB in the end (delta: -287.0MB). Peak memory consumption was 463.8MB. Max. memory is 16.1GB. * Witness Printer took 146.94ms. Allocated memory is still 973.1MB. Free memory was 438.5MB in the beginning and 429.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 00:13:43,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0b6e597-a795-4694-9dac-3019d19e6908/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with 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