./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/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 60c504c9f40ccadb4975411e53cf63a02a16daf7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-5842f4b [2018-11-18 16:47:15,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:47:15,970 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:47:15,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:47:15,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:47:15,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:47:15,979 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:47:15,980 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:47:15,981 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:47:15,982 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:47:15,982 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:47:15,982 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:47:15,983 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:47:15,984 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:47:15,984 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:47:15,985 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:47:15,986 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:47:15,987 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:47:15,988 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:47:15,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:47:15,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:47:15,991 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:47:15,992 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:47:15,992 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:47:15,993 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:47:15,993 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:47:15,994 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:47:15,995 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:47:15,995 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:47:15,996 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:47:15,996 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:47:15,997 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:47:15,997 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:47:15,997 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:47:15,997 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:47:15,998 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:47:15,998 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 16:47:16,008 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:47:16,008 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:47:16,009 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:47:16,009 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 16:47:16,009 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:47:16,010 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:47:16,010 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:47:16,010 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:47:16,010 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:47:16,010 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:47:16,010 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:47:16,010 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:47:16,011 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:47:16,011 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:47:16,011 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:47:16,011 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:47:16,011 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:47:16,011 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:47:16,011 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 16:47:16,012 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 16:47:16,012 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:47:16,012 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:47:16,012 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 16:47:16,012 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:47:16,012 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:47:16,012 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:47:16,013 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 16:47:16,013 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:47:16,013 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:47:16,013 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_810f692a-0683-4ee5-870f-1903e7e4f757/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 -> 60c504c9f40ccadb4975411e53cf63a02a16daf7 [2018-11-18 16:47:16,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:47:16,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:47:16,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:47:16,045 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:47:16,045 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:47:16,045 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-11-18 16:47:16,079 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/bin-2019/ukojak/data/7dc2595a0/971ca985a5d447788822e5fc0ef6afa9/FLAGdc5464783 [2018-11-18 16:47:16,487 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:47:16,488 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-11-18 16:47:16,494 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/bin-2019/ukojak/data/7dc2595a0/971ca985a5d447788822e5fc0ef6afa9/FLAGdc5464783 [2018-11-18 16:47:16,503 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/bin-2019/ukojak/data/7dc2595a0/971ca985a5d447788822e5fc0ef6afa9 [2018-11-18 16:47:16,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:47:16,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:47:16,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:47:16,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:47:16,509 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:47:16,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:47:16" (1/1) ... [2018-11-18 16:47:16,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621c254e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:47:16, skipping insertion in model container [2018-11-18 16:47:16,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:47:16" (1/1) ... [2018-11-18 16:47:16,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:47:16,540 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:47:16,667 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:47:16,674 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:47:16,697 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:47:16,745 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:47:16,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:47:16 WrapperNode [2018-11-18 16:47:16,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:47:16,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:47:16,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:47:16,746 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:47:16,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:47:16" (1/1) ... [2018-11-18 16:47:16,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:47:16" (1/1) ... [2018-11-18 16:47:16,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:47:16,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:47:16,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:47:16,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:47:16,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:47:16" (1/1) ... [2018-11-18 16:47:16,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:47:16" (1/1) ... [2018-11-18 16:47:16,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:47:16" (1/1) ... [2018-11-18 16:47:16,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:47:16" (1/1) ... [2018-11-18 16:47:16,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:47:16" (1/1) ... [2018-11-18 16:47:16,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:47:16" (1/1) ... [2018-11-18 16:47:16,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:47:16" (1/1) ... [2018-11-18 16:47:16,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:47:16,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:47:16,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:47:16,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:47:16,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:47:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/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-18 16:47:16,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:47:16,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:47:17,748 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:47:17,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:47:17 BoogieIcfgContainer [2018-11-18 16:47:17,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:47:17,749 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 16:47:17,749 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 16:47:17,755 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 16:47:17,756 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:47:17" (1/1) ... [2018-11-18 16:47:17,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:47:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 16:47:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2018-11-18 16:47:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-11-18 16:47:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-18 16:47:17,798 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 16:47:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:47:18,134 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-18 16:47:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 16:47:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 10 states and 12 transitions. [2018-11-18 16:47:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-11-18 16:47:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 16:47:18,192 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 16:47:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:47:18,549 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-11-18 16:47:18,711 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 82 [2018-11-18 16:47:18,917 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 80 [2018-11-18 16:47:18,920 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-18 16:47:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 16:47:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 16 states and 23 transitions. [2018-11-18 16:47:19,787 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2018-11-18 16:47:19,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 16:47:19,788 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 16:47:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:47:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:47:20,866 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2018-11-18 16:47:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 16:47:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 23 states and 37 transitions. [2018-11-18 16:47:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 37 transitions. [2018-11-18 16:47:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 16:47:21,630 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 16:47:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:47:22,591 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2018-11-18 16:47:24,230 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 310 DAG size of output: 178 [2018-11-18 16:47:25,718 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 306 DAG size of output: 174 [2018-11-18 16:47:26,934 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 283 DAG size of output: 170 [2018-11-18 16:47:27,752 WARN L180 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 126 [2018-11-18 16:47:28,529 WARN L180 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 121 [2018-11-18 16:47:28,556 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-18 16:47:28,784 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2018-11-18 16:47:29,392 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 181 [2018-11-18 16:47:29,698 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2018-11-18 16:47:30,215 WARN L180 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 185 [2018-11-18 16:47:30,529 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2018-11-18 16:47:30,841 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2018-11-18 16:47:31,455 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 178 [2018-11-18 16:47:31,767 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-11-18 16:47:32,263 WARN L180 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 183 [2018-11-18 16:47:32,595 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-11-18 16:47:32,908 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-11-18 16:47:33,343 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 157 [2018-11-18 16:47:33,626 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-11-18 16:47:34,038 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 168 [2018-11-18 16:47:34,323 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2018-11-18 16:47:34,596 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-11-18 16:47:35,051 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 153 [2018-11-18 16:47:35,461 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 164 [2018-11-18 16:47:35,738 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-11-18 16:47:36,009 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-11-18 16:47:36,343 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 114 [2018-11-18 16:47:36,571 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-11-18 16:47:37,024 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 165 [2018-11-18 16:47:37,240 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-18 16:47:37,575 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2018-11-18 16:47:37,832 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-18 16:47:38,079 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2018-11-18 16:47:38,400 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2018-11-18 16:47:38,676 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-11-18 16:47:39,009 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2018-11-18 16:47:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 16:47:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 35 states and 64 transitions. [2018-11-18 16:47:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 64 transitions. [2018-11-18 16:47:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 16:47:39,091 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 16:47:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:47:39,711 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-18 16:47:40,454 WARN L180 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 167 [2018-11-18 16:47:40,747 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2018-11-18 16:47:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 16:47:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 37 states and 66 transitions. [2018-11-18 16:47:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 66 transitions. [2018-11-18 16:47:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 16:47:40,887 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 16:47:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:47:41,838 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-18 16:47:42,295 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 116 [2018-11-18 16:47:42,627 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 117 [2018-11-18 16:47:42,873 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-11-18 16:47:43,121 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-11-18 16:47:43,418 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 114 [2018-11-18 16:47:43,687 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 115 [2018-11-18 16:47:43,920 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-18 16:47:44,164 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-18 16:47:44,979 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 169 [2018-11-18 16:47:45,427 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-11-18 16:47:45,933 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-11-18 16:47:46,411 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2018-11-18 16:47:46,824 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-11-18 16:47:47,309 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2018-11-18 16:47:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 16:47:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 44 states and 84 transitions. [2018-11-18 16:47:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 84 transitions. [2018-11-18 16:47:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 16:47:47,382 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 16:47:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:47:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:47:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:47:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:47:52,792 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 7 iterations. [2018-11-18 16:47:52,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 04:47:52 ImpRootNode [2018-11-18 16:47:52,844 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 16:47:52,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:47:52,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:47:52,845 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:47:52,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:47:17" (3/4) ... [2018-11-18 16:47:52,848 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 16:47:52,930 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_810f692a-0683-4ee5-870f-1903e7e4f757/bin-2019/ukojak/witness.graphml [2018-11-18 16:47:52,930 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:47:52,931 INFO L168 Benchmark]: Toolchain (without parser) took 36425.21 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 605.6 MB). Free memory was 959.2 MB in the beginning and 898.2 MB in the end (delta: 61.1 MB). Peak memory consumption was 666.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:47:52,932 INFO L168 Benchmark]: CDTParser took 0.10 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-18 16:47:52,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:47:52,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:47:52,933 INFO L168 Benchmark]: Boogie Preprocessor took 20.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:47:52,933 INFO L168 Benchmark]: RCFGBuilder took 951.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 964.2 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:47:52,933 INFO L168 Benchmark]: CodeCheck took 35095.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 458.2 MB). Free memory was 964.2 MB in the beginning and 898.2 MB in the end (delta: 66.0 MB). Peak memory consumption was 524.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:47:52,933 INFO L168 Benchmark]: Witness Printer took 85.52 ms. Allocated memory is still 1.6 GB. Free memory is still 898.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:47:52,935 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, 80 locations, 1 error locations. UNSAFE Result, 35.0s OverallTime, 7 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 96 SDtfs, 800 SDslu, 1284 SDs, 0 SdLazy, 1862 SolverSat, 414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 867 GetRequests, 715 SyntacticMatches, 36 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6348 ImplicationChecksByTransitivity, 26.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 206568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 13/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: 359]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] unsigned 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 ; [L204] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L304] int c1 ; [L305] int i2 ; [L308] c1 = 0 [L309] r1 = __VERIFIER_nondet_uchar() [L310] id1 = __VERIFIER_nondet_char() [L311] st1 = __VERIFIER_nondet_char() [L312] send1 = __VERIFIER_nondet_char() [L313] mode1 = __VERIFIER_nondet_bool() [L314] alive1 = __VERIFIER_nondet_bool() [L315] id2 = __VERIFIER_nondet_char() [L316] st2 = __VERIFIER_nondet_char() [L317] send2 = __VERIFIER_nondet_char() [L318] mode2 = __VERIFIER_nondet_bool() [L319] alive2 = __VERIFIER_nondet_bool() [L320] id3 = __VERIFIER_nondet_char() [L321] st3 = __VERIFIER_nondet_char() [L322] send3 = __VERIFIER_nondet_char() [L323] mode3 = __VERIFIER_nondet_bool() [L324] alive3 = __VERIFIER_nondet_bool() [L325] CALL, EXPR init() [L207] int tmp ; [L210] COND TRUE (int )r1 == 0 [L211] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 [L212] COND TRUE (int )id1 >= 0 [L213] COND TRUE (int )st1 == 0 [L214] COND TRUE (int )send1 == (int )id1 [L215] COND TRUE (int )mode1 == 0 [L216] COND TRUE (int )id2 >= 0 [L217] COND TRUE (int )st2 == 0 [L218] COND TRUE (int )send2 == (int )id2 [L219] COND TRUE (int )mode2 == 0 [L220] COND TRUE (int )id3 >= 0 [L221] COND TRUE (int )st3 == 0 [L222] COND TRUE (int )send3 == (int )id3 [L223] COND TRUE (int )mode3 == 0 [L224] COND TRUE (int )id1 != (int )id2 [L225] COND TRUE (int )id1 != (int )id3 [L226] COND TRUE (int )id2 != (int )id3 [L227] tmp = 1 [L279] RET return (tmp); [L325] EXPR init() [L325] i2 = init() [L327] p1_old = nomsg [L328] p1_new = nomsg [L329] p2_old = nomsg [L330] p2_new = nomsg [L331] p3_old = nomsg [L332] p3_new = nomsg [L333] i2 = 0 VAL [alive1=1, alive2=1, alive3=1, id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=3, send2=1, send3=2, st1=0, st2=0, st3=0] [L334] COND TRUE 1 [L336] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND FALSE !(\read(mode1)) [L125] COND TRUE \read(alive1) [L126] COND TRUE, EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L126] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L131] RET mode1 = (_Bool)1 [L336] node1() [L337] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND FALSE !(\read(mode2)) [L159] COND TRUE \read(alive2) [L160] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L160] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L165] RET mode2 = (_Bool)1 [L337] node2() [L338] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND FALSE !(\read(mode3)) [L193] COND TRUE \read(alive3) [L194] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L199] RET mode3 = (_Bool)1 [L338] node3() [L339] p1_old = p1_new [L340] p1_new = nomsg [L341] p2_old = p2_new [L342] p2_new = nomsg [L343] p3_old = p3_new [L344] p3_new = nomsg [L345] CALL, EXPR check() [L284] int tmp ; [L287] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L288] COND TRUE (int )r1 < 3 [L289] tmp = 1 [L299] RET return (tmp); [L345] EXPR check() [L345] c1 = check() [L346] CALL assert(c1) [L357] COND FALSE, RET !(! arg) VAL [alive1=1, alive2=1, alive3=1, id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=3, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=0, send1=3, send2=1, send3=2, st1=0, st2=0, st3=0] [L346] assert(c1) [L334] COND TRUE 1 [L336] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND TRUE \read(mode1) [L103] COND FALSE !(r1 == 255) [L106] r1 = r1 + 1 [L107] m1 = p3_old [L108] p3_old = nomsg [L109] COND TRUE (int )m1 != (int )nomsg [L110] COND TRUE \read(alive1) [L111] COND FALSE !((int )m1 > (int )id1) [L114] COND FALSE !((int )m1 == (int )id1) [L117] send1 = m1 [L123] RET mode1 = (_Bool)0 [L336] node1() [L337] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND TRUE \read(mode2) [L143] m2 = p1_old [L144] p1_old = nomsg [L145] COND TRUE (int )m2 != (int )nomsg [L146] COND TRUE \read(alive2) [L147] COND TRUE (int )m2 > (int )id2 [L148] send2 = m2 [L157] RET mode2 = (_Bool)0 [L337] node2() [L338] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND TRUE \read(mode3) [L177] m3 = p2_old [L178] p2_old = nomsg [L179] COND TRUE (int )m3 != (int )nomsg [L180] COND TRUE \read(alive3) [L181] COND FALSE !((int )m3 > (int )id3) [L184] COND FALSE !((int )m3 == (int )id3) [L191] RET mode3 = (_Bool)0 [L338] node3() [L339] p1_old = p1_new [L340] p1_new = nomsg [L341] p2_old = p2_new [L342] p2_new = nomsg [L343] p3_old = p3_new [L344] p3_new = nomsg [L345] CALL, EXPR check() [L284] int tmp ; [L287] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L288] COND TRUE (int )r1 < 3 [L289] tmp = 1 [L299] RET return (tmp); [L345] EXPR check() [L345] c1 = check() [L346] CALL assert(c1) [L357] COND FALSE, RET !(! arg) VAL [alive1=1, alive2=1, alive3=1, id1=3, id2=1, id3=2, 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=3, send3=2, st1=0, st2=0, st3=0] [L346] assert(c1) [L334] COND TRUE 1 [L336] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND FALSE !(\read(mode1)) [L125] COND TRUE \read(alive1) [L126] COND TRUE, EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L126] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L131] RET mode1 = (_Bool)1 [L336] node1() [L337] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND FALSE !(\read(mode2)) [L159] COND TRUE \read(alive2) [L160] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L160] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L165] RET mode2 = (_Bool)1 [L337] node2() [L338] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND FALSE !(\read(mode3)) [L193] COND TRUE \read(alive3) [L194] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L199] RET mode3 = (_Bool)1 [L338] node3() [L339] p1_old = p1_new [L340] p1_new = nomsg [L341] p2_old = p2_new [L342] p2_new = nomsg [L343] p3_old = p3_new [L344] p3_new = nomsg [L345] CALL, EXPR check() [L284] int tmp ; [L287] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L288] COND TRUE (int )r1 < 3 [L289] tmp = 1 [L299] RET return (tmp); [L345] EXPR check() [L345] c1 = check() [L346] CALL assert(c1) [L357] COND FALSE, RET !(! arg) VAL [alive1=1, alive2=1, alive3=1, id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=3, p3=0, p3_new=-1, p3_old=2, r1=1, send1=2, send2=3, send3=2, st1=0, st2=0, st3=0] [L346] assert(c1) [L334] COND TRUE 1 [L336] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND TRUE \read(mode1) [L103] COND FALSE !(r1 == 255) [L106] r1 = r1 + 1 [L107] m1 = p3_old [L108] p3_old = nomsg [L109] COND TRUE (int )m1 != (int )nomsg [L110] COND TRUE \read(alive1) [L111] COND FALSE !((int )m1 > (int )id1) [L114] COND FALSE !((int )m1 == (int )id1) [L117] send1 = m1 [L123] RET mode1 = (_Bool)0 [L336] node1() [L337] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND TRUE \read(mode2) [L143] m2 = p1_old [L144] p1_old = nomsg [L145] COND TRUE (int )m2 != (int )nomsg [L146] COND TRUE \read(alive2) [L147] COND TRUE (int )m2 > (int )id2 [L148] send2 = m2 [L157] RET mode2 = (_Bool)0 [L337] node2() [L338] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND TRUE \read(mode3) [L177] m3 = p2_old [L178] p2_old = nomsg [L179] COND TRUE (int )m3 != (int )nomsg [L180] COND TRUE \read(alive3) [L181] COND TRUE (int )m3 > (int )id3 [L182] send3 = m3 [L191] RET mode3 = (_Bool)0 [L338] node3() [L339] p1_old = p1_new [L340] p1_new = nomsg [L341] p2_old = p2_new [L342] p2_new = nomsg [L343] p3_old = p3_new [L344] p3_new = nomsg [L345] CALL, EXPR check() [L284] int tmp ; [L287] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L288] COND TRUE (int )r1 < 3 [L289] tmp = 1 [L299] RET return (tmp); [L345] EXPR check() [L345] c1 = check() [L346] CALL assert(c1) [L357] COND FALSE, RET !(! arg) VAL [alive1=1, alive2=1, alive3=1, id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0] [L346] assert(c1) [L334] COND TRUE 1 [L336] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND FALSE !(\read(mode1)) [L125] COND TRUE \read(alive1) [L126] COND TRUE, EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L126] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L131] RET mode1 = (_Bool)1 [L336] node1() [L337] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND FALSE !(\read(mode2)) [L159] COND TRUE \read(alive2) [L160] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L160] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L165] RET mode2 = (_Bool)1 [L337] node2() [L338] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND FALSE !(\read(mode3)) [L193] COND TRUE \read(alive3) [L194] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L199] RET mode3 = (_Bool)1 [L338] node3() [L339] p1_old = p1_new [L340] p1_new = nomsg [L341] p2_old = p2_new [L342] p2_new = nomsg [L343] p3_old = p3_new [L344] p3_new = nomsg [L345] CALL, EXPR check() [L284] int tmp ; [L287] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L288] COND TRUE (int )r1 < 3 [L289] tmp = 1 [L299] RET return (tmp); [L345] EXPR check() [L345] c1 = check() [L346] CALL assert(c1) [L357] COND FALSE, RET !(! arg) VAL [alive1=1, alive2=1, alive3=1, id1=3, id2=1, id3=2, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=3, r1=2, send1=2, send2=2, send3=3, st1=0, st2=0, st3=0] [L346] assert(c1) [L334] COND TRUE 1 [L336] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND TRUE \read(mode1) [L103] COND FALSE !(r1 == 255) [L106] r1 = r1 + 1 [L107] m1 = p3_old [L108] p3_old = nomsg [L109] COND TRUE (int )m1 != (int )nomsg [L110] COND TRUE \read(alive1) [L111] COND FALSE !((int )m1 > (int )id1) [L114] COND TRUE (int )m1 == (int )id1 [L115] st1 = (char)1 [L123] RET mode1 = (_Bool)0 [L336] node1() [L337] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND TRUE \read(mode2) [L143] m2 = p1_old [L144] p1_old = nomsg [L145] COND TRUE (int )m2 != (int )nomsg [L146] COND TRUE \read(alive2) [L147] COND TRUE (int )m2 > (int )id2 [L148] send2 = m2 [L157] RET mode2 = (_Bool)0 [L337] node2() [L338] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND TRUE \read(mode3) [L177] m3 = p2_old [L178] p2_old = nomsg [L179] COND TRUE (int )m3 != (int )nomsg [L180] COND TRUE \read(alive3) [L181] COND FALSE !((int )m3 > (int )id3) [L184] COND TRUE (int )m3 == (int )id3 [L185] st3 = (char)1 [L191] RET mode3 = (_Bool)0 [L338] node3() [L339] p1_old = p1_new [L340] p1_new = nomsg [L341] p2_old = p2_new [L342] p2_new = nomsg [L343] p3_old = p3_new [L344] p3_new = nomsg [L345] CALL, EXPR check() [L284] int tmp ; [L287] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L297] tmp = 0 [L299] RET return (tmp); [L345] EXPR check() [L345] c1 = check() [L346] CALL assert(c1) [L357] COND TRUE ! arg VAL [alive1=1, alive2=1, alive3=1, id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=2, send2=2, send3=3, st1=1, st2=0, st3=1] [L359] __VERIFIER_error() VAL [alive1=1, alive2=1, alive3=1, id1=3, id2=1, id3=2, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=2, send2=2, send3=3, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 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 239.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 951.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 964.2 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * CodeCheck took 35095.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 458.2 MB). Free memory was 964.2 MB in the beginning and 898.2 MB in the end (delta: 66.0 MB). Peak memory consumption was 524.3 MB. Max. memory is 11.5 GB. * Witness Printer took 85.52 ms. Allocated memory is still 1.6 GB. Free memory is still 898.2 MB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...