./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.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_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/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_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/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_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/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 850d02aa9cb18294f9975f6e4e447a197934bcfd77c20fda5c55e9f9e3e0a979 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:27:15,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:27:15,572 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:27:15,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:27:15,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:27:15,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:27:15,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:27:15,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:27:15,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:27:15,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:27:15,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:27:15,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:27:15,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:27:15,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:27:15,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:27:15,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:27:15,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:27:15,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:27:15,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:27:15,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:27:15,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:27:15,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:27:15,621 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:27:15,621 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:27:15,621 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:27:15,622 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:27:15,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:27:15,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:27:15,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:27:15,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:27:15,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:27:15,623 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:27:15,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:27:15,628 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_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/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_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/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 -> 850d02aa9cb18294f9975f6e4e447a197934bcfd77c20fda5c55e9f9e3e0a979 [2024-11-08 23:27:15,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:27:15,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:27:15,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:27:15,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:27:15,973 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:27:15,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-08 23:27:18,010 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:27:18,212 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:27:18,213 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2024-11-08 23:27:18,224 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/bin/ukojak-verify-ImItNfHLgk/data/c3d0c35a3/ded35a9ebff4409cad1d67973b3c0183/FLAGa4ba33e77 [2024-11-08 23:27:18,238 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/bin/ukojak-verify-ImItNfHLgk/data/c3d0c35a3/ded35a9ebff4409cad1d67973b3c0183 [2024-11-08 23:27:18,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:27:18,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:27:18,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:27:18,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:27:18,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:27:18,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a73da54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18, skipping insertion in model container [2024-11-08 23:27:18,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:27:18,529 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_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c[6787,6800] [2024-11-08 23:27:18,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:27:18,543 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:27:18,593 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_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c[6787,6800] [2024-11-08 23:27:18,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:27:18,613 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:27:18,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18 WrapperNode [2024-11-08 23:27:18,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:27:18,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:27:18,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:27:18,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:27:18,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,664 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 246 [2024-11-08 23:27:18,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:27:18,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:27:18,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:27:18,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:27:18,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:27:18,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:27:18,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:27:18,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:27:18,707 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:27:18,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:27:18,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:27:18,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:27:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:27:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:27:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:27:18,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:27:18,872 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:27:18,874 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:27:19,256 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-08 23:27:19,257 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:27:19,674 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:27:19,675 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:27:19,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:19 BoogieIcfgContainer [2024-11-08 23:27:19,675 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:27:19,676 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:27:19,676 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:27:19,687 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:27:19,687 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:19" (1/1) ... [2024-11-08 23:27:19,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2024-11-08 23:27:19,752 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2024-11-08 23:27:19,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 23:27:19,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:19,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,442 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-08 23:27:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 8 states and 10 transitions. [2024-11-08 23:27:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2024-11-08 23:27:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:27:21,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:21,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:27:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 12 states and 18 transitions. [2024-11-08 23:27:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. [2024-11-08 23:27:30,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:27:30,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:27:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:27:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 17 states and 29 transitions. [2024-11-08 23:27:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 29 transitions. [2024-11-08 23:27:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:27:37,217 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:27:37,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:28:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:28:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 26 states and 52 transitions. [2024-11-08 23:28:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 52 transitions. [2024-11-08 23:28:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:28:22,341 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:28:22,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:29:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:29:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 35 states and 75 transitions. [2024-11-08 23:29:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 75 transitions. [2024-11-08 23:29:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:29:14,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:29:14,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:29:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:29:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 41 states and 98 transitions. [2024-11-08 23:29:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 98 transitions. [2024-11-08 23:29:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:29:29,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:29:29,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:29:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:29:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 43 states and 100 transitions. [2024-11-08 23:29:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 100 transitions. [2024-11-08 23:29:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 23:29:37,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:29:37,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:29:38,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:29:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:29:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:29:39,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:29:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:29:39,445 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 8 iterations. [2024-11-08 23:29:39,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:29:39 ImpRootNode [2024-11-08 23:29:39,509 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:29:39,510 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:29:39,510 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:29:39,510 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:29:39,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:19" (3/4) ... [2024-11-08 23:29:39,512 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 23:29:39,649 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:29:39,652 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:29:39,653 INFO L158 Benchmark]: Toolchain (without parser) took 141411.13ms. Allocated memory was 153.1MB in the beginning and 973.1MB in the end (delta: 820.0MB). Free memory was 116.2MB in the beginning and 472.8MB in the end (delta: -356.6MB). Peak memory consumption was 466.5MB. Max. memory is 16.1GB. [2024-11-08 23:29:39,654 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 111.1MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:29:39,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.09ms. Allocated memory is still 153.1MB. Free memory was 115.6MB in the beginning and 99.6MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:29:39,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.71ms. Allocated memory is still 153.1MB. Free memory was 99.6MB in the beginning and 97.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:29:39,656 INFO L158 Benchmark]: Boogie Preprocessor took 40.64ms. Allocated memory is still 153.1MB. Free memory was 97.5MB in the beginning and 95.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:29:39,656 INFO L158 Benchmark]: RCFGBuilder took 969.52ms. Allocated memory is still 153.1MB. Free memory was 95.4MB in the beginning and 95.8MB in the end (delta: -389.6kB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2024-11-08 23:29:39,657 INFO L158 Benchmark]: CodeCheck took 139832.87ms. Allocated memory was 153.1MB in the beginning and 973.1MB in the end (delta: 820.0MB). Free memory was 95.8MB in the beginning and 482.3MB in the end (delta: -386.5MB). Peak memory consumption was 432.2MB. Max. memory is 16.1GB. [2024-11-08 23:29:39,658 INFO L158 Benchmark]: Witness Printer took 143.05ms. Allocated memory is still 973.1MB. Free memory was 481.2MB in the beginning and 472.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 23:29:39,660 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, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 139.7s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 285 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 818 IncrementalHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 7 mSDtfsCounter, 818 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 978 GetRequests, 787 SyntacticMatches, 27 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13686 ImplicationChecksByTransitivity, 82.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 56.0s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 9883 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: 311]: 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 ; [L256] int c1 ; [L257] int i2 ; [L260] c1 = 0 [L261] r1 = __VERIFIER_nondet_uchar() [L262] id1 = __VERIFIER_nondet_char() [L263] st1 = __VERIFIER_nondet_char() [L264] send1 = __VERIFIER_nondet_char() [L265] mode1 = __VERIFIER_nondet_bool() [L266] alive1 = __VERIFIER_nondet_bool() [L267] id2 = __VERIFIER_nondet_char() [L268] st2 = __VERIFIER_nondet_char() [L269] send2 = __VERIFIER_nondet_char() [L270] mode2 = __VERIFIER_nondet_bool() [L271] alive2 = __VERIFIER_nondet_bool() [L272] id3 = __VERIFIER_nondet_char() [L273] st3 = __VERIFIER_nondet_char() [L274] send3 = __VERIFIER_nondet_char() [L275] mode3 = __VERIFIER_nondet_bool() [L276] alive3 = __VERIFIER_nondet_bool() [L277] CALL, EXPR init() [L159] int tmp ; [L162] COND TRUE (int )r1 == 0 [L163] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 [L164] COND TRUE (int )id1 >= 0 [L165] COND TRUE (int )st1 == 0 [L166] COND TRUE (int )send1 == (int )id1 [L167] COND TRUE (int )mode1 == 0 [L168] COND TRUE (int )id2 >= 0 [L169] COND TRUE (int )st2 == 0 [L170] COND TRUE (int )send2 == (int )id2 [L171] COND TRUE (int )mode2 == 0 [L172] COND TRUE (int )id3 >= 0 [L173] COND TRUE (int )st3 == 0 [L174] COND TRUE (int )send3 == (int )id3 [L175] COND TRUE (int )mode3 == 0 [L176] COND TRUE (int )id1 != (int )id2 [L177] COND TRUE (int )id1 != (int )id3 [L178] COND TRUE (int )id2 != (int )id3 [L179] tmp = 1 [L231] return (tmp); [L277] RET, EXPR init() [L277] i2 = init() [L278] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L278] RET assume_abort_if_not(i2) [L279] p1_old = nomsg [L280] p1_new = nomsg [L281] p2_old = nomsg [L282] p2_new = nomsg [L283] p3_old = nomsg [L284] p3_new = nomsg [L285] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, 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=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND FALSE !(\read(mode1)) [L81] COND FALSE !(\read(alive1)) [L84] mode1 = (_Bool)1 [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg [L95] COND FALSE !(\read(mode2)) [L112] COND FALSE !(\read(alive2)) [L115] COND FALSE !((int )send2 != (int )id2) [L118] mode2 = (_Bool)1 [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg [L129] COND FALSE !(\read(mode3)) [L146] COND TRUE \read(alive3) [L147] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L152] mode3 = (_Bool)1 [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, 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=-1, p3=0, p3_new=-1, p3_old=1, r1=0, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] 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 FALSE !(\read(alive1)) [L76] send1 = m1 [L79] mode1 = (_Bool)0 [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg [L95] COND TRUE \read(mode2) [L96] m2 = p1_old [L97] p1_old = nomsg [L98] COND FALSE !((int )m2 != (int )nomsg) [L110] mode2 = (_Bool)0 [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg [L129] COND TRUE \read(mode3) [L130] m3 = p2_old [L131] p2_old = nomsg [L132] COND FALSE !((int )m3 != (int )nomsg) [L144] mode3 = (_Bool)0 [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, 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=127, send3=1, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND FALSE !(\read(mode1)) [L81] COND FALSE !(\read(alive1)) [L84] mode1 = (_Bool)1 [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg [L95] COND FALSE !(\read(mode2)) [L112] COND FALSE !(\read(alive2)) [L115] COND FALSE !((int )send2 != (int )id2) [L118] mode2 = (_Bool)1 [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg [L129] COND FALSE !(\read(mode3)) [L146] COND TRUE \read(alive3) [L147] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L152] mode3 = (_Bool)1 [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, 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=-1, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] 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 FALSE !(\read(alive1)) [L76] send1 = m1 [L79] mode1 = (_Bool)0 [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg [L95] COND TRUE \read(mode2) [L96] m2 = p1_old [L97] p1_old = nomsg [L98] COND FALSE !((int )m2 != (int )nomsg) [L110] mode2 = (_Bool)0 [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg [L129] COND TRUE \read(mode3) [L130] m3 = p2_old [L131] p2_old = nomsg [L132] COND FALSE !((int )m3 != (int )nomsg) [L144] mode3 = (_Bool)0 [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, 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=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND FALSE !(\read(mode1)) [L81] COND FALSE !(\read(alive1)) [L84] mode1 = (_Bool)1 [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg [L95] COND FALSE !(\read(mode2)) [L112] COND FALSE !(\read(alive2)) [L115] COND FALSE !((int )send2 != (int )id2) [L118] mode2 = (_Bool)1 [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg [L129] COND FALSE !(\read(mode3)) [L146] COND TRUE \read(alive3) [L147] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L152] mode3 = (_Bool)1 [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L240] COND TRUE (int )r1 < 3 [L241] tmp = 1 [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, 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=-1, p3=0, p3_new=-1, p3_old=1, r1=2, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L298] RET assert(c1) [L286] COND TRUE 1 [L288] 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 FALSE !(\read(alive1)) [L76] send1 = m1 [L79] mode1 = (_Bool)0 [L288] RET node1() [L289] CALL node2() [L91] msg_t m2 ; [L94] m2 = nomsg [L95] COND TRUE \read(mode2) [L96] m2 = p1_old [L97] p1_old = nomsg [L98] COND FALSE !((int )m2 != (int )nomsg) [L110] mode2 = (_Bool)0 [L289] RET node2() [L290] CALL node3() [L125] msg_t m3 ; [L128] m3 = nomsg [L129] COND TRUE \read(mode3) [L130] m3 = p2_old [L131] p2_old = nomsg [L132] COND FALSE !((int )m3 != (int )nomsg) [L144] mode3 = (_Bool)0 [L290] RET node3() [L291] p1_old = p1_new [L292] p1_new = nomsg [L293] p2_old = p2_new [L294] p2_new = nomsg [L295] p3_old = p3_new [L296] p3_new = nomsg [L297] CALL, EXPR check() [L236] int tmp ; [L239] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L240] COND FALSE !((int )r1 < 3) [L243] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L246] tmp = 0 [L251] return (tmp); [L297] RET, EXPR check() [L297] c1 = check() [L298] CALL assert(c1) [L309] COND TRUE ! arg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, 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=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L311] reach_error() VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, 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=1, send2=127, send3=1, st1=0, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 111.1MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.09ms. Allocated memory is still 153.1MB. Free memory was 115.6MB in the beginning and 99.6MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.71ms. Allocated memory is still 153.1MB. Free memory was 99.6MB in the beginning and 97.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.64ms. Allocated memory is still 153.1MB. Free memory was 97.5MB in the beginning and 95.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 969.52ms. Allocated memory is still 153.1MB. Free memory was 95.4MB in the beginning and 95.8MB in the end (delta: -389.6kB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * CodeCheck took 139832.87ms. Allocated memory was 153.1MB in the beginning and 973.1MB in the end (delta: 820.0MB). Free memory was 95.8MB in the beginning and 482.3MB in the end (delta: -386.5MB). Peak memory consumption was 432.2MB. Max. memory is 16.1GB. * Witness Printer took 143.05ms. Allocated memory is still 973.1MB. Free memory was 481.2MB in the beginning and 472.8MB 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! [2024-11-08 23:29:39,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfbd73f6-b669-49e8-a8f0-9ac8cd3f20fc/bin/ukojak-verify-ImItNfHLgk/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