./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/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 d52e74df0654e1f032e9591db582096a56c19f5c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-635dfa2 [2018-12-08 14:32:33,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:32:33,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:32:33,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:32:33,369 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:32:33,370 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:32:33,371 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:32:33,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:32:33,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:32:33,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:32:33,374 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:32:33,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:32:33,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:32:33,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:32:33,377 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:32:33,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:32:33,378 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:32:33,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:32:33,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:32:33,381 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:32:33,382 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:32:33,383 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:32:33,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:32:33,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:32:33,385 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:32:33,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:32:33,386 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:32:33,387 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:32:33,387 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:32:33,388 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:32:33,388 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:32:33,389 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:32:33,389 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:32:33,389 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:32:33,390 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:32:33,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:32:33,390 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 14:32:33,401 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:32:33,401 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:32:33,402 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 14:32:33,402 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 14:32:33,402 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 14:32:33,402 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 14:32:33,402 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:32:33,402 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 14:32:33,403 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:32:33,403 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 14:32:33,403 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:32:33,403 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 14:32:33,403 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 14:32:33,403 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 14:32:33,403 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 14:32:33,403 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 14:32:33,403 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 14:32:33,403 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 14:32:33,404 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 14:32:33,404 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 14:32:33,404 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:32:33,404 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 14:32:33,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 14:32:33,404 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:32:33,404 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 14:32:33,404 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 14:32:33,404 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 14:32:33,405 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 14:32:33,405 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 14:32:33,405 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_653378a6-26b8-4a7c-b2b4-2b22039662aa/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 -> d52e74df0654e1f032e9591db582096a56c19f5c [2018-12-08 14:32:33,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:32:33,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:32:33,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:32:33,440 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:32:33,441 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:32:33,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c [2018-12-08 14:32:33,476 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/bin-2019/ukojak/data/296359a02/3afa45bc47094af881ff9ced3d8c2e08/FLAG2a61c3ffc [2018-12-08 14:32:33,785 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:32:33,785 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c [2018-12-08 14:32:33,789 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/bin-2019/ukojak/data/296359a02/3afa45bc47094af881ff9ced3d8c2e08/FLAG2a61c3ffc [2018-12-08 14:32:34,202 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/bin-2019/ukojak/data/296359a02/3afa45bc47094af881ff9ced3d8c2e08 [2018-12-08 14:32:34,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:32:34,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 14:32:34,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:32:34,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:32:34,207 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:32:34,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:32:34" (1/1) ... [2018-12-08 14:32:34,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75186abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:32:34, skipping insertion in model container [2018-12-08 14:32:34,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:32:34" (1/1) ... [2018-12-08 14:32:34,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:32:34,238 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:32:34,352 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:32:34,357 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:32:34,379 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:32:34,418 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:32:34,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:32:34 WrapperNode [2018-12-08 14:32:34,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:32:34,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 14:32:34,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 14:32:34,419 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 14:32:34,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:32:34" (1/1) ... [2018-12-08 14:32:34,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:32:34" (1/1) ... [2018-12-08 14:32:34,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 14:32:34,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:32:34,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:32:34,443 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:32:34,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:32:34" (1/1) ... [2018-12-08 14:32:34,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:32:34" (1/1) ... [2018-12-08 14:32:34,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:32:34" (1/1) ... [2018-12-08 14:32:34,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:32:34" (1/1) ... [2018-12-08 14:32:34,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:32:34" (1/1) ... [2018-12-08 14:32:34,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:32:34" (1/1) ... [2018-12-08 14:32:34,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:32:34" (1/1) ... [2018-12-08 14:32:34,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:32:34,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:32:34,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:32:34,459 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:32:34,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:32:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/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-12-08 14:32:34,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:32:34,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:32:35,175 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:32:35,175 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-08 14:32:35,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:32:35 BoogieIcfgContainer [2018-12-08 14:32:35,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:32:35,176 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 14:32:35,176 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 14:32:35,183 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 14:32:35,183 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:32:35" (1/1) ... [2018-12-08 14:32:35,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:32:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:32:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 6 states and 7 transitions. [2018-12-08 14:32:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-08 14:32:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-08 14:32:35,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:32:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:32:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:32:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:32:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 7 states and 10 transitions. [2018-12-08 14:32:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2018-12-08 14:32:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-08 14:32:35,507 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:32:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:32:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:32:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:32:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 10 states and 18 transitions. [2018-12-08 14:32:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2018-12-08 14:32:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 14:32:36,735 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:32:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:32:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:32:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:32:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 14 states and 30 transitions. [2018-12-08 14:32:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 30 transitions. [2018-12-08 14:32:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 14:32:38,123 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:32:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:32:38,966 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 72 [2018-12-08 14:32:40,777 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 304 DAG size of output: 185 [2018-12-08 14:32:41,920 WARN L180 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 179 [2018-12-08 14:32:43,414 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 321 DAG size of output: 170 [2018-12-08 14:32:44,537 WARN L180 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 177 [2018-12-08 14:32:45,802 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 272 DAG size of output: 142 [2018-12-08 14:32:46,792 WARN L180 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 143 [2018-12-08 14:32:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:32:47,151 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2018-12-08 14:32:48,122 WARN L180 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 180 [2018-12-08 14:32:48,684 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 178 [2018-12-08 14:32:49,562 WARN L180 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 180 [2018-12-08 14:32:50,143 WARN L180 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 177 [2018-12-08 14:32:51,124 WARN L180 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 173 [2018-12-08 14:32:52,027 WARN L180 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 177 [2018-12-08 14:32:52,586 WARN L180 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 172 [2018-12-08 14:32:53,494 WARN L180 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 179 [2018-12-08 14:32:54,236 WARN L180 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2018-12-08 14:32:55,299 WARN L180 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 166 [2018-12-08 14:32:57,232 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 169 DAG size of output: 147 [2018-12-08 14:32:58,576 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 162 DAG size of output: 154 [2018-12-08 14:32:59,405 WARN L180 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 155 [2018-12-08 14:33:00,395 WARN L180 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 145 [2018-12-08 14:33:01,291 WARN L180 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-08 14:33:02,246 WARN L180 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 161 [2018-12-08 14:33:02,619 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 136 [2018-12-08 14:33:03,041 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 136 [2018-12-08 14:33:03,507 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 164 [2018-12-08 14:33:03,765 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-12-08 14:33:04,118 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2018-12-08 14:33:04,654 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 150 [2018-12-08 14:33:05,104 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2018-12-08 14:33:05,459 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-12-08 14:33:05,917 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-12-08 14:33:06,290 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2018-12-08 14:33:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:33:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 20 states and 60 transitions. [2018-12-08 14:33:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 60 transitions. [2018-12-08 14:33:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 14:33:06,398 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:33:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:33:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:33:07,459 WARN L180 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 144 [2018-12-08 14:33:08,087 WARN L180 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 158 [2018-12-08 14:33:08,525 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 142 [2018-12-08 14:33:08,835 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-12-08 14:33:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:33:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 21 states and 62 transitions. [2018-12-08 14:33:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 62 transitions. [2018-12-08 14:33:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 14:33:08,953 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:33:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:33:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:33:10,458 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 130 [2018-12-08 14:33:10,760 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2018-12-08 14:33:11,202 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 130 [2018-12-08 14:33:12,039 WARN L180 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2018-12-08 14:33:12,317 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 40 [2018-12-08 14:33:12,941 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 169 [2018-12-08 14:33:13,451 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-12-08 14:33:13,692 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 47 [2018-12-08 14:33:14,189 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-12-08 14:33:14,761 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-08 14:33:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:33:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 24 states and 77 transitions. [2018-12-08 14:33:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 77 transitions. [2018-12-08 14:33:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 14:33:14,871 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:33:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:33:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:33:15,596 WARN L180 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 133 [2018-12-08 14:33:15,887 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-08 14:33:16,346 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 129 [2018-12-08 14:33:16,733 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2018-12-08 14:33:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:33:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 25 states and 80 transitions. [2018-12-08 14:33:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2018-12-08 14:33:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 14:33:16,840 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:33:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:33:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:33:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:33:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:33:17,972 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 8 iterations. [2018-12-08 14:33:18,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 02:33:18 ImpRootNode [2018-12-08 14:33:18,014 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 14:33:18,014 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 14:33:18,014 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 14:33:18,014 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 14:33:18,015 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:32:35" (3/4) ... [2018-12-08 14:33:18,016 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 14:33:18,069 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_653378a6-26b8-4a7c-b2b4-2b22039662aa/bin-2019/ukojak/witness.graphml [2018-12-08 14:33:18,069 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 14:33:18,070 INFO L168 Benchmark]: Toolchain (without parser) took 43865.68 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 434.6 MB). Free memory was 956.0 MB in the beginning and 805.5 MB in the end (delta: 150.4 MB). Peak memory consumption was 585.1 MB. Max. memory is 11.5 GB. [2018-12-08 14:33:18,070 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:33:18,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2018-12-08 14:33:18,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:33:18,070 INFO L168 Benchmark]: Boogie Preprocessor took 15.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:33:18,071 INFO L168 Benchmark]: RCFGBuilder took 716.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 943.3 MB in the end (delta: 163.0 MB). Peak memory consumption was 163.0 MB. Max. memory is 11.5 GB. [2018-12-08 14:33:18,071 INFO L168 Benchmark]: CodeCheck took 42837.87 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 323.5 MB). Free memory was 943.3 MB in the beginning and 818.1 MB in the end (delta: 125.2 MB). Peak memory consumption was 448.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:33:18,071 INFO L168 Benchmark]: Witness Printer took 54.97 ms. Allocated memory is still 1.5 GB. Free memory was 818.1 MB in the beginning and 805.5 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2018-12-08 14:33:18,073 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, 42.7s OverallTime, 8 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 532 SDslu, 128 SDs, 0 SdLazy, 5694 SolverSat, 970 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 923 GetRequests, 780 SyntacticMatches, 27 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 38.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 84061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 5/72 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: 354]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] unsigned char r1 ; [L72] port_t p1 ; [L73] char p1_old ; [L74] char p1_new ; [L75] char id1 ; [L76] char st1 ; [L77] msg_t send1 ; [L78] _Bool mode1 ; [L79] _Bool alive1 ; [L80] port_t p2 ; [L81] char p2_old ; [L82] char p2_new ; [L83] char id2 ; [L84] char st2 ; [L85] msg_t send2 ; [L86] _Bool mode2 ; [L87] _Bool alive2 ; [L88] port_t p3 ; [L89] char p3_old ; [L90] char p3_new ; [L91] char id3 ; [L92] char st3 ; [L93] msg_t send3 ; [L94] _Bool mode3 ; [L95] _Bool alive3 ; [L199] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L299] int c1 ; [L300] int i2 ; [L303] c1 = 0 [L304] r1 = __VERIFIER_nondet_uchar() [L305] id1 = __VERIFIER_nondet_char() [L306] st1 = __VERIFIER_nondet_char() [L307] send1 = __VERIFIER_nondet_char() [L308] mode1 = __VERIFIER_nondet_bool() [L309] alive1 = __VERIFIER_nondet_bool() [L310] id2 = __VERIFIER_nondet_char() [L311] st2 = __VERIFIER_nondet_char() [L312] send2 = __VERIFIER_nondet_char() [L313] mode2 = __VERIFIER_nondet_bool() [L314] alive2 = __VERIFIER_nondet_bool() [L315] id3 = __VERIFIER_nondet_char() [L316] st3 = __VERIFIER_nondet_char() [L317] send3 = __VERIFIER_nondet_char() [L318] mode3 = __VERIFIER_nondet_bool() [L319] alive3 = __VERIFIER_nondet_bool() [L202] int tmp ; [L205] COND TRUE (int )r1 == 0 [L206] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 [L207] COND TRUE (int )id1 >= 0 [L208] COND TRUE (int )st1 == 0 [L209] COND TRUE (int )send1 == (int )id1 [L210] COND TRUE (int )mode1 == 0 [L211] COND TRUE (int )id2 >= 0 [L212] COND TRUE (int )st2 == 0 [L213] COND TRUE (int )send2 == (int )id2 [L214] COND TRUE (int )mode2 == 0 [L215] COND TRUE (int )id3 >= 0 [L216] COND TRUE (int )st3 == 0 [L217] COND TRUE (int )send3 == (int )id3 [L218] COND TRUE (int )mode3 == 0 [L219] COND TRUE (int )id1 != (int )id2 [L220] COND TRUE (int )id1 != (int )id3 [L221] COND TRUE (int )id2 != (int )id3 [L222] tmp = 1 [L274] return (tmp); [L320] i2 = init() [L322] p1_old = nomsg [L323] p1_new = nomsg [L324] p2_old = nomsg [L325] p2_new = nomsg [L326] p3_old = nomsg [L327] p3_new = nomsg [L328] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L329] COND TRUE 1 [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND FALSE !(\read(mode1)) [L123] COND FALSE !(\read(alive1)) [L126] mode1 = (_Bool)1 [L133] msg_t m2 ; [L136] m2 = nomsg [L137] COND FALSE !(\read(mode2)) [L154] COND FALSE !(\read(alive2)) [L157] COND FALSE !((int )send2 != (int )id2) [L160] mode2 = (_Bool)1 [L167] msg_t m3 ; [L170] m3 = nomsg [L171] COND FALSE !(\read(mode3)) [L188] COND TRUE \read(alive3) [L189] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L189] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] mode3 = (_Bool)1 [L334] p1_old = p1_new [L335] p1_new = nomsg [L336] p2_old = p2_new [L337] p2_new = nomsg [L338] p3_old = p3_new [L339] p3_new = nomsg [L279] int tmp ; [L282] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L283] COND TRUE (int )r1 < 3 [L284] tmp = 1 [L294] return (tmp); [L340] c1 = check() [L352] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=1, r1=0, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L329] COND TRUE 1 [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 FALSE !(\read(alive1)) [L118] send1 = m1 [L121] mode1 = (_Bool)0 [L133] msg_t m2 ; [L136] m2 = nomsg [L137] COND TRUE \read(mode2) [L138] m2 = p1_old [L139] p1_old = nomsg [L140] COND FALSE !((int )m2 != (int )nomsg) [L152] mode2 = (_Bool)0 [L167] msg_t m3 ; [L170] m3 = nomsg [L171] COND TRUE \read(mode3) [L172] m3 = p2_old [L173] p2_old = nomsg [L174] COND FALSE !((int )m3 != (int )nomsg) [L186] mode3 = (_Bool)0 [L334] p1_old = p1_new [L335] p1_new = nomsg [L336] p2_old = p2_new [L337] p2_new = nomsg [L338] p3_old = p3_new [L339] p3_new = nomsg [L279] int tmp ; [L282] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L283] COND TRUE (int )r1 < 3 [L284] tmp = 1 [L294] return (tmp); [L340] c1 = check() [L352] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L329] COND TRUE 1 [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND FALSE !(\read(mode1)) [L123] COND FALSE !(\read(alive1)) [L126] mode1 = (_Bool)1 [L133] msg_t m2 ; [L136] m2 = nomsg [L137] COND FALSE !(\read(mode2)) [L154] COND FALSE !(\read(alive2)) [L157] COND FALSE !((int )send2 != (int )id2) [L160] mode2 = (_Bool)1 [L167] msg_t m3 ; [L170] m3 = nomsg [L171] COND FALSE !(\read(mode3)) [L188] COND TRUE \read(alive3) [L189] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L189] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] mode3 = (_Bool)1 [L334] p1_old = p1_new [L335] p1_new = nomsg [L336] p2_old = p2_new [L337] p2_new = nomsg [L338] p3_old = p3_new [L339] p3_new = nomsg [L279] int tmp ; [L282] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L283] COND TRUE (int )r1 < 3 [L284] tmp = 1 [L294] return (tmp); [L340] c1 = check() [L352] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L329] COND TRUE 1 [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 FALSE !(\read(alive1)) [L118] send1 = m1 [L121] mode1 = (_Bool)0 [L133] msg_t m2 ; [L136] m2 = nomsg [L137] COND TRUE \read(mode2) [L138] m2 = p1_old [L139] p1_old = nomsg [L140] COND FALSE !((int )m2 != (int )nomsg) [L152] mode2 = (_Bool)0 [L167] msg_t m3 ; [L170] m3 = nomsg [L171] COND TRUE \read(mode3) [L172] m3 = p2_old [L173] p2_old = nomsg [L174] COND FALSE !((int )m3 != (int )nomsg) [L186] mode3 = (_Bool)0 [L334] p1_old = p1_new [L335] p1_new = nomsg [L336] p2_old = p2_new [L337] p2_new = nomsg [L338] p3_old = p3_new [L339] p3_new = nomsg [L279] int tmp ; [L282] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L283] COND TRUE (int )r1 < 3 [L284] tmp = 1 [L294] return (tmp); [L340] c1 = check() [L352] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L329] COND TRUE 1 [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND FALSE !(\read(mode1)) [L123] COND FALSE !(\read(alive1)) [L126] mode1 = (_Bool)1 [L133] msg_t m2 ; [L136] m2 = nomsg [L137] COND FALSE !(\read(mode2)) [L154] COND FALSE !(\read(alive2)) [L157] COND FALSE !((int )send2 != (int )id2) [L160] mode2 = (_Bool)1 [L167] msg_t m3 ; [L170] m3 = nomsg [L171] COND FALSE !(\read(mode3)) [L188] COND TRUE \read(alive3) [L189] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L189] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] mode3 = (_Bool)1 [L334] p1_old = p1_new [L335] p1_new = nomsg [L336] p2_old = p2_new [L337] p2_new = nomsg [L338] p3_old = p3_new [L339] p3_new = nomsg [L279] int tmp ; [L282] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L283] COND TRUE (int )r1 < 3 [L284] tmp = 1 [L294] return (tmp); [L340] c1 = check() [L352] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=1, r1=2, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L329] COND TRUE 1 [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 FALSE !(\read(alive1)) [L118] send1 = m1 [L121] mode1 = (_Bool)0 [L133] msg_t m2 ; [L136] m2 = nomsg [L137] COND TRUE \read(mode2) [L138] m2 = p1_old [L139] p1_old = nomsg [L140] COND FALSE !((int )m2 != (int )nomsg) [L152] mode2 = (_Bool)0 [L167] msg_t m3 ; [L170] m3 = nomsg [L171] COND TRUE \read(mode3) [L172] m3 = p2_old [L173] p2_old = nomsg [L174] COND FALSE !((int )m3 != (int )nomsg) [L186] mode3 = (_Bool)0 [L334] p1_old = p1_new [L335] p1_new = nomsg [L336] p2_old = p2_new [L337] p2_new = nomsg [L338] p3_old = p3_new [L339] p3_new = nomsg [L279] int tmp ; [L282] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L283] COND FALSE !((int )r1 < 3) [L286] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L289] tmp = 0 [L294] return (tmp); [L340] c1 = check() [L352] COND TRUE ! arg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L354] __VERIFIER_error() VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=127, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 213.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 716.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 943.3 MB in the end (delta: 163.0 MB). Peak memory consumption was 163.0 MB. Max. memory is 11.5 GB. * CodeCheck took 42837.87 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 323.5 MB). Free memory was 943.3 MB in the beginning and 818.1 MB in the end (delta: 125.2 MB). Peak memory consumption was 448.7 MB. Max. memory is 11.5 GB. * Witness Printer took 54.97 ms. Allocated memory is still 1.5 GB. Free memory was 818.1 MB in the beginning and 805.5 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...