./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2969d4725852fd68e7759cdb7f1d1929ca0124c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:01:42,852 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:01:42,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:01:42,859 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:01:42,860 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:01:42,860 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:01:42,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:01:42,862 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:01:42,863 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:01:42,864 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:01:42,865 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:01:42,865 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:01:42,865 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:01:42,866 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:01:42,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:01:42,867 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:01:42,867 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:01:42,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:01:42,869 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:01:42,870 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:01:42,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:01:42,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:01:42,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:01:42,873 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:01:42,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:01:42,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:01:42,875 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:01:42,875 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:01:42,875 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:01:42,876 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:01:42,876 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:01:42,877 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:01:42,877 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:01:42,877 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:01:42,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:01:42,878 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:01:42,879 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 12:01:42,889 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:01:42,889 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:01:42,890 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:01:42,890 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:01:42,890 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:01:42,890 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:01:42,891 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:01:42,891 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:01:42,891 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:01:42,891 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:01:42,891 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:01:42,891 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:01:42,891 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:01:42,892 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:01:42,892 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:01:42,892 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:01:42,892 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:01:42,892 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 12:01:42,892 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 12:01:42,892 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:01:42,892 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:01:42,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 12:01:42,893 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:01:42,893 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:01:42,893 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:01:42,893 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 12:01:42,893 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:01:42,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:01:42,894 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> f2969d4725852fd68e7759cdb7f1d1929ca0124c [2018-11-10 12:01:42,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:01:42,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:01:42,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:01:42,931 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:01:42,931 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:01:42,932 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 12:01:42,975 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak/data/5f3a110c6/cc54c5971af14e32b43d19e0aa326277/FLAG745b84f33 [2018-11-10 12:01:43,393 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:01:43,394 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 12:01:43,398 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak/data/5f3a110c6/cc54c5971af14e32b43d19e0aa326277/FLAG745b84f33 [2018-11-10 12:01:43,408 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak/data/5f3a110c6/cc54c5971af14e32b43d19e0aa326277 [2018-11-10 12:01:43,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:01:43,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:01:43,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:01:43,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:01:43,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:01:43,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:01:43" (1/1) ... [2018-11-10 12:01:43,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3976356f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:43, skipping insertion in model container [2018-11-10 12:01:43,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:01:43" (1/1) ... [2018-11-10 12:01:43,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:01:43,443 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:01:43,594 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:01:43,600 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:01:43,634 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:01:43,648 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:01:43,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:43 WrapperNode [2018-11-10 12:01:43,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:01:43,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:01:43,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:01:43,649 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:01:43,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:43" (1/1) ... [2018-11-10 12:01:43,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:43" (1/1) ... [2018-11-10 12:01:43,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:01:43,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:01:43,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:01:43,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:01:43,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:43" (1/1) ... [2018-11-10 12:01:43,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:43" (1/1) ... [2018-11-10 12:01:43,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:43" (1/1) ... [2018-11-10 12:01:43,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:43" (1/1) ... [2018-11-10 12:01:43,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:43" (1/1) ... [2018-11-10 12:01:43,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:43" (1/1) ... [2018-11-10 12:01:43,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:43" (1/1) ... [2018-11-10 12:01:43,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:01:43,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:01:43,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:01:43,779 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:01:43,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:01:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 12:01:43,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:01:43,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:01:44,916 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:01:44,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:01:44 BoogieIcfgContainer [2018-11-10 12:01:44,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:01:44,918 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 12:01:44,918 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 12:01:44,928 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 12:01:44,928 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:01:44" (1/1) ... [2018-11-10 12:01:44,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:01:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:01:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2018-11-10 12:01:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-11-10 12:01:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-10 12:01:44,982 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:01:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:01:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 12 states and 15 transitions. [2018-11-10 12:01:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2018-11-10 12:01:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 12:01:45,416 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:01:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:45,805 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2018-11-10 12:01:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:01:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-11-10 12:01:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-11-10 12:01:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 12:01:46,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:01:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:01:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 26 states and 47 transitions. [2018-11-10 12:01:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 47 transitions. [2018-11-10 12:01:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 12:01:48,001 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:01:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:01:48,528 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2018-11-10 12:01:49,360 WARN L179 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 151 [2018-11-10 12:01:50,135 WARN L179 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 148 [2018-11-10 12:01:50,590 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 130 [2018-11-10 12:01:50,913 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 89 [2018-11-10 12:01:51,232 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 84 [2018-11-10 12:01:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:01:51,550 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2018-11-10 12:01:52,226 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 169 [2018-11-10 12:01:52,479 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-11-10 12:01:52,862 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 172 [2018-11-10 12:01:53,146 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-11-10 12:01:53,435 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2018-11-10 12:01:53,929 WARN L179 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 167 [2018-11-10 12:01:54,164 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 12:01:54,601 WARN L179 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 171 [2018-11-10 12:01:54,880 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2018-11-10 12:01:55,171 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2018-11-10 12:01:55,463 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 134 [2018-11-10 12:01:55,664 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-10 12:01:55,940 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 139 [2018-11-10 12:01:56,129 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-11-10 12:01:56,344 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 12:01:56,686 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 132 [2018-11-10 12:01:56,976 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 137 [2018-11-10 12:01:57,187 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-10 12:01:57,427 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-11-10 12:01:57,679 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 90 [2018-11-10 12:01:57,915 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2018-11-10 12:01:58,179 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 130 [2018-11-10 12:01:58,540 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-10 12:01:58,759 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 85 [2018-11-10 12:01:58,957 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2018-11-10 12:01:59,458 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-10 12:01:59,698 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-10 12:01:59,921 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-11-10 12:02:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:02:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 38 states and 77 transitions. [2018-11-10 12:02:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 77 transitions. [2018-11-10 12:02:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 12:02:00,049 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:02:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:02:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:02:01,310 WARN L179 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 144 [2018-11-10 12:02:01,529 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2018-11-10 12:02:01,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:02:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 40 states and 80 transitions. [2018-11-10 12:02:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 80 transitions. [2018-11-10 12:02:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:02:01,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:02:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:02:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:02:02,818 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2018-11-10 12:02:03,648 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-10 12:02:04,346 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 69 [2018-11-10 12:02:04,709 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 131 [2018-11-10 12:02:05,103 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-10 12:02:05,306 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 66 [2018-11-10 12:02:05,529 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-10 12:02:05,875 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-10 12:02:06,074 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 74 [2018-11-10 12:02:06,256 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-10 12:02:06,625 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 12:02:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:02:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 48 states and 101 transitions. [2018-11-10 12:02:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 101 transitions. [2018-11-10 12:02:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:02:06,697 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:02:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:02:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:02:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:02:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:02:08,544 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 7 iterations. [2018-11-10 12:02:08,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 12:02:08 ImpRootNode [2018-11-10 12:02:08,596 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 12:02:08,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:02:08,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:02:08,596 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:02:08,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:01:44" (3/4) ... [2018-11-10 12:02:08,598 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:02:08,678 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fd3c0148-8b18-4642-96c2-f7f3ac6b49ad/bin-2019/ukojak/witness.graphml [2018-11-10 12:02:08,679 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:02:08,679 INFO L168 Benchmark]: Toolchain (without parser) took 25268.82 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 514.3 MB). Free memory was 960.3 MB in the beginning and 712.0 MB in the end (delta: 248.4 MB). Peak memory consumption was 762.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:02:08,680 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:02:08,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.26 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:02:08,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.71 ms. Allocated memory is still 1.0 GB. Free memory was 944.2 MB in the beginning and 990.3 MB in the end (delta: -46.1 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:02:08,680 INFO L168 Benchmark]: Boogie Preprocessor took 78.53 ms. Allocated memory is still 1.0 GB. Free memory was 990.3 MB in the beginning and 1.0 GB in the end (delta: -14.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:02:08,681 INFO L168 Benchmark]: RCFGBuilder took 1138.41 ms. Allocated memory is still 1.0 GB. Free memory was 1.0 GB in the beginning and 850.6 MB in the end (delta: 154.4 MB). Peak memory consumption was 154.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:02:08,681 INFO L168 Benchmark]: CodeCheck took 23678.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 514.3 MB). Free memory was 850.6 MB in the beginning and 718.9 MB in the end (delta: 131.7 MB). Peak memory consumption was 646.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:02:08,681 INFO L168 Benchmark]: Witness Printer took 82.83 ms. Allocated memory is still 1.5 GB. Free memory was 718.9 MB in the beginning and 712.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:02:08,683 INFO L336 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, 75 locations, 1 error locations. UNSAFE Result, 23.5s OverallTime, 7 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 416 SDtfs, 796 SDslu, 1280 SDs, 0 SdLazy, 1936 SolverSat, 424 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 899 GetRequests, 746 SyntacticMatches, 35 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6828 ImplicationChecksByTransitivity, 19.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 136616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 11/91 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 352]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char r1 ; [L73] char p1_old ; [L74] char p1_new ; [L75] char id1 ; [L76] char st1 ; [L78] _Bool mode1 ; [L79] _Bool alive1 ; [L81] char p2_old ; [L82] char p2_new ; [L83] char id2 ; [L84] char st2 ; [L86] _Bool mode2 ; [L87] _Bool alive2 ; [L89] char p3_old ; [L90] char p3_new ; [L91] char id3 ; [L92] char st3 ; [L94] _Bool mode3 ; [L95] _Bool alive3 ; [L70] msg_t nomsg = (msg_t )-1; [L72] port_t p1 ; [L77] msg_t send1 ; [L80] port_t p2 ; [L85] msg_t send2 ; [L88] port_t p3 ; [L93] msg_t send3 ; [L196] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L296] int c1 ; [L297] int i2 ; [L300] c1 = 0 [L301] r1 = __VERIFIER_nondet_char() [L302] id1 = __VERIFIER_nondet_char() [L303] st1 = __VERIFIER_nondet_char() [L304] send1 = __VERIFIER_nondet_char() [L305] mode1 = __VERIFIER_nondet_bool() [L306] alive1 = __VERIFIER_nondet_bool() [L307] id2 = __VERIFIER_nondet_char() [L308] st2 = __VERIFIER_nondet_char() [L309] send2 = __VERIFIER_nondet_char() [L310] mode2 = __VERIFIER_nondet_bool() [L311] alive2 = __VERIFIER_nondet_bool() [L312] id3 = __VERIFIER_nondet_char() [L313] st3 = __VERIFIER_nondet_char() [L314] send3 = __VERIFIER_nondet_char() [L315] mode3 = __VERIFIER_nondet_bool() [L316] alive3 = __VERIFIER_nondet_bool() [L317] CALL, EXPR init() [L199] int tmp ; [L202] COND TRUE (int )r1 == 0 [L203] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 [L204] COND TRUE (int )id1 >= 0 [L205] COND TRUE (int )st1 == 0 [L206] COND TRUE (int )send1 == (int )id1 [L207] COND TRUE (int )mode1 == 0 [L208] COND TRUE (int )id2 >= 0 [L209] COND TRUE (int )st2 == 0 [L210] COND TRUE (int )send2 == (int )id2 [L211] COND TRUE (int )mode2 == 0 [L212] COND TRUE (int )id3 >= 0 [L213] COND TRUE (int )st3 == 0 [L214] COND TRUE (int )send3 == (int )id3 [L215] COND TRUE (int )mode3 == 0 [L216] COND TRUE (int )id1 != (int )id2 [L217] COND TRUE (int )id1 != (int )id3 [L218] COND TRUE (int )id2 != (int )id3 [L219] tmp = 1 [L271] RET return (tmp); [L317] EXPR init() [L317] i2 = init() [L319] p1_old = nomsg [L320] p1_new = nomsg [L321] p2_old = nomsg [L322] p2_new = nomsg [L323] p3_old = nomsg [L324] p3_new = nomsg [L325] i2 = 0 VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L328] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND FALSE !(\read(mode1)) [L120] COND FALSE !(\read(alive1)) [L123] RET mode1 = (_Bool)1 [L328] node1() [L329] CALL node2() [L130] msg_t m2 ; [L133] m2 = nomsg [L134] COND FALSE !(\read(mode2)) [L151] COND TRUE \read(alive2) [L152] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L152] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L157] RET mode2 = (_Bool)1 [L329] node2() [L330] CALL node3() [L164] msg_t m3 ; [L167] m3 = nomsg [L168] COND FALSE !(\read(mode3)) [L185] COND FALSE !(\read(alive3)) [L188] COND FALSE !((int )send3 != (int )id3) [L191] RET mode3 = (_Bool)1 [L330] node3() [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L337] CALL, EXPR check() [L276] int tmp ; [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 [L291] RET return (tmp); [L337] EXPR check() [L337] c1 = check() [L338] CALL assert(c1) [L350] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L328] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg [L106] COND FALSE !((int )m1 != (int )nomsg) [L118] RET mode1 = (_Bool)0 [L328] node1() [L329] CALL node2() [L130] msg_t m2 ; [L133] m2 = nomsg [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg [L137] COND FALSE !((int )m2 != (int )nomsg) [L149] RET mode2 = (_Bool)0 [L329] node2() [L330] CALL node3() [L164] msg_t m3 ; [L167] m3 = nomsg [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg [L171] COND TRUE (int )m3 != (int )nomsg [L172] COND FALSE !(\read(alive3)) [L180] send3 = m3 [L183] RET mode3 = (_Bool)0 [L330] node3() [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L337] CALL, EXPR check() [L276] int tmp ; [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 [L291] RET return (tmp); [L337] EXPR check() [L337] c1 = check() [L338] CALL assert(c1) [L350] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=2, send2=1, send3=1, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=2, send2=1, send3=1, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L328] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND FALSE !(\read(mode1)) [L120] COND FALSE !(\read(alive1)) [L123] RET mode1 = (_Bool)1 [L328] node1() [L329] CALL node2() [L130] msg_t m2 ; [L133] m2 = nomsg [L134] COND FALSE !(\read(mode2)) [L151] COND TRUE \read(alive2) [L152] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L152] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L157] RET mode2 = (_Bool)1 [L329] node2() [L330] CALL node3() [L164] msg_t m3 ; [L167] m3 = nomsg [L168] COND FALSE !(\read(mode3)) [L185] COND FALSE !(\read(alive3)) [L188] COND TRUE (int )send3 != (int )id3 [L189] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L189] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] RET mode3 = (_Bool)1 [L330] node3() [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L337] CALL, EXPR check() [L276] int tmp ; [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 [L291] RET return (tmp); [L337] EXPR check() [L337] c1 = check() [L338] CALL assert(c1) [L350] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=2, send2=1, send3=1, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=2, send2=1, send3=1, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L328] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg [L106] COND TRUE (int )m1 != (int )nomsg [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 [L118] RET mode1 = (_Bool)0 [L328] node1() [L329] CALL node2() [L130] msg_t m2 ; [L133] m2 = nomsg [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg [L137] COND FALSE !((int )m2 != (int )nomsg) [L149] RET mode2 = (_Bool)0 [L329] node2() [L330] CALL node3() [L164] msg_t m3 ; [L167] m3 = nomsg [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg [L171] COND TRUE (int )m3 != (int )nomsg [L172] COND FALSE !(\read(alive3)) [L180] send3 = m3 [L183] RET mode3 = (_Bool)0 [L330] node3() [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L337] CALL, EXPR check() [L276] int tmp ; [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 [L291] RET return (tmp); [L337] EXPR check() [L337] c1 = check() [L338] CALL assert(c1) [L350] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=1, send3=1, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=1, send3=1, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L328] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND FALSE !(\read(mode1)) [L120] COND FALSE !(\read(alive1)) [L123] RET mode1 = (_Bool)1 [L328] node1() [L329] CALL node2() [L130] msg_t m2 ; [L133] m2 = nomsg [L134] COND FALSE !(\read(mode2)) [L151] COND TRUE \read(alive2) [L152] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L152] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L157] RET mode2 = (_Bool)1 [L329] node2() [L330] CALL node3() [L164] msg_t m3 ; [L167] m3 = nomsg [L168] COND FALSE !(\read(mode3)) [L185] COND FALSE !(\read(alive3)) [L188] COND TRUE (int )send3 != (int )id3 [L189] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L189] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] RET mode3 = (_Bool)1 [L330] node3() [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L337] CALL, EXPR check() [L276] int tmp ; [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 [L291] RET return (tmp); [L337] EXPR check() [L337] c1 = check() [L338] CALL assert(c1) [L350] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=1, send3=1, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=1, send3=1, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L328] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg [L106] COND TRUE (int )m1 != (int )nomsg [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 [L118] RET mode1 = (_Bool)0 [L328] node1() [L329] CALL node2() [L130] msg_t m2 ; [L133] m2 = nomsg [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg [L137] COND FALSE !((int )m2 != (int )nomsg) [L149] RET mode2 = (_Bool)0 [L329] node2() [L330] CALL node3() [L164] msg_t m3 ; [L167] m3 = nomsg [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg [L171] COND TRUE (int )m3 != (int )nomsg [L172] COND FALSE !(\read(alive3)) [L180] send3 = m3 [L183] RET mode3 = (_Bool)0 [L330] node3() [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L337] CALL, EXPR check() [L276] int tmp ; [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L280] COND FALSE !((int )r1 < 3) [L283] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L286] tmp = 0 [L291] RET return (tmp); [L337] EXPR check() [L337] c1 = check() [L338] CALL assert(c1) [L350] COND TRUE ! arg VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=1, send3=1, st1=0, st2=0, st3=0] [L352] __VERIFIER_error() VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=1, 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 237.26 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.71 ms. Allocated memory is still 1.0 GB. Free memory was 944.2 MB in the beginning and 990.3 MB in the end (delta: -46.1 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.53 ms. Allocated memory is still 1.0 GB. Free memory was 990.3 MB in the beginning and 1.0 GB in the end (delta: -14.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1138.41 ms. Allocated memory is still 1.0 GB. Free memory was 1.0 GB in the beginning and 850.6 MB in the end (delta: 154.4 MB). Peak memory consumption was 154.4 MB. Max. memory is 11.5 GB. * CodeCheck took 23678.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 514.3 MB). Free memory was 850.6 MB in the beginning and 718.9 MB in the end (delta: 131.7 MB). Peak memory consumption was 646.0 MB. Max. memory is 11.5 GB. * Witness Printer took 82.83 ms. Allocated memory is still 1.5 GB. Free memory was 718.9 MB in the beginning and 712.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...