./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/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 4e7975b17d935115e9ca07f323e5eabfbd25e139 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:51:47,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:51:47,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:51:47,379 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:51:47,380 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:51:47,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:51:47,382 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:51:47,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:51:47,384 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:51:47,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:51:47,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:51:47,387 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:51:47,388 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:51:47,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:51:47,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:51:47,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:51:47,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:51:47,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:51:47,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:51:47,398 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:51:47,399 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:51:47,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:51:47,403 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:51:47,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:51:47,404 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:51:47,405 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:51:47,406 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:51:47,407 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:51:47,408 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:51:47,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:51:47,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:51:47,410 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:51:47,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:51:47,411 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:51:47,412 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:51:47,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:51:47,413 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 19:51:47,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:51:47,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:51:47,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:51:47,428 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:51:47,429 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:51:47,429 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:51:47,430 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:51:47,430 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:51:47,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:51:47,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:51:47,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:51:47,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:51:47,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:51:47,431 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:51:47,431 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:51:47,431 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:51:47,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:51:47,431 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 19:51:47,432 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 19:51:47,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:51:47,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:51:47,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 19:51:47,432 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:51:47,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:51:47,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:51:47,433 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 19:51:47,435 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:51:47,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:51:47,436 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_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/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 -> 4e7975b17d935115e9ca07f323e5eabfbd25e139 [2018-10-26 19:51:47,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:51:47,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:51:47,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:51:47,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:51:47,485 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:51:47,486 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 19:51:47,542 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/bin-2019/ukojak/data/e987e0433/8b5aa8836992464faf9a6c7d71a18145/FLAGc360f5ef1 [2018-10-26 19:51:47,961 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:51:47,961 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 19:51:47,973 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/bin-2019/ukojak/data/e987e0433/8b5aa8836992464faf9a6c7d71a18145/FLAGc360f5ef1 [2018-10-26 19:51:47,989 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/bin-2019/ukojak/data/e987e0433/8b5aa8836992464faf9a6c7d71a18145 [2018-10-26 19:51:47,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:51:47,994 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:51:47,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:51:47,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:51:47,999 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:51:48,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:51:47" (1/1) ... [2018-10-26 19:51:48,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6934edcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:48, skipping insertion in model container [2018-10-26 19:51:48,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:51:47" (1/1) ... [2018-10-26 19:51:48,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:51:48,054 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:51:48,290 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:51:48,299 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:51:48,365 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:51:48,382 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:51:48,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:48 WrapperNode [2018-10-26 19:51:48,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:51:48,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:51:48,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:51:48,384 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:51:48,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:48" (1/1) ... [2018-10-26 19:51:48,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:48" (1/1) ... [2018-10-26 19:51:48,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:51:48,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:51:48,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:51:48,471 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:51:48,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:48" (1/1) ... [2018-10-26 19:51:48,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:48" (1/1) ... [2018-10-26 19:51:48,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:48" (1/1) ... [2018-10-26 19:51:48,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:48" (1/1) ... [2018-10-26 19:51:48,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:48" (1/1) ... [2018-10-26 19:51:48,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:48" (1/1) ... [2018-10-26 19:51:48,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:48" (1/1) ... [2018-10-26 19:51:48,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:51:48,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:51:48,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:51:48,570 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:51:48,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/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-10-26 19:51:48,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:51:48,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:51:53,115 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:51:53,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:51:53 BoogieIcfgContainer [2018-10-26 19:51:53,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:51:53,117 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 19:51:53,117 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 19:51:53,128 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 19:51:53,129 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:51:53" (1/1) ... [2018-10-26 19:51:53,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:51:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-10-26 19:51:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-10-26 19:51:53,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-26 19:51:53,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:51:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:51:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:51:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-10-26 19:51:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-26 19:51:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-26 19:51:54,367 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:51:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:51:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:51:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-10-26 19:51:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-10-26 19:51:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 19:51:55,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:51:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:56,059 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 19:51:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:51:56,681 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 19:51:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:51:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-10-26 19:51:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-10-26 19:51:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 19:51:56,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:51:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:51:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:51:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-10-26 19:51:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-10-26 19:51:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 19:51:57,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:51:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:51:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:51:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-10-26 19:51:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-10-26 19:51:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 19:51:58,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:51:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-10-26 19:52:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-10-26 19:52:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 19:52:00,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-10-26 19:52:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-10-26 19:52:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 19:52:01,167 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-10-26 19:52:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-10-26 19:52:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 19:52:01,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:03,593 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 19:52:04,441 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 19:52:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 67 states and 113 transitions. [2018-10-26 19:52:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 113 transitions. [2018-10-26 19:52:04,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 19:52:04,897 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 70 states and 118 transitions. [2018-10-26 19:52:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-10-26 19:52:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 19:52:05,830 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 88 states and 161 transitions. [2018-10-26 19:52:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2018-10-26 19:52:11,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 19:52:11,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:17,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 107 states and 202 transitions. [2018-10-26 19:52:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 202 transitions. [2018-10-26 19:52:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 19:52:17,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 110 states and 214 transitions. [2018-10-26 19:52:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 214 transitions. [2018-10-26 19:52:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:52:18,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:20,516 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-26 19:52:21,136 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-26 19:52:25,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 128 states and 260 transitions. [2018-10-26 19:52:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 260 transitions. [2018-10-26 19:52:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:52:25,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 131 states and 269 transitions. [2018-10-26 19:52:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 269 transitions. [2018-10-26 19:52:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:52:27,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 135 states and 279 transitions. [2018-10-26 19:52:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 279 transitions. [2018-10-26 19:52:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:52:28,842 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 152 states and 316 transitions. [2018-10-26 19:52:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 316 transitions. [2018-10-26 19:52:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:52:34,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 156 states and 330 transitions. [2018-10-26 19:52:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 330 transitions. [2018-10-26 19:52:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:52:36,845 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 158 states and 338 transitions. [2018-10-26 19:52:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 338 transitions. [2018-10-26 19:52:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:52:38,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 159 states and 341 transitions. [2018-10-26 19:52:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 341 transitions. [2018-10-26 19:52:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:52:39,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:52:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:52:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:52:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:52:39,762 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 21 iterations. [2018-10-26 19:52:39,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 07:52:39 ImpRootNode [2018-10-26 19:52:39,932 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 19:52:39,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:52:39,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:52:39,933 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:52:39,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:51:53" (3/4) ... [2018-10-26 19:52:39,936 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 19:52:40,127 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ea18e9b0-5a9e-4688-9907-bf66c7a178f8/bin-2019/ukojak/witness.graphml [2018-10-26 19:52:40,128 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:52:40,128 INFO L168 Benchmark]: Toolchain (without parser) took 52135.81 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 615.5 MB). Free memory was 958.5 MB in the beginning and 1.1 GB in the end (delta: -108.5 MB). Peak memory consumption was 507.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:52:40,129 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:52:40,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.04 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 939.7 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-10-26 19:52:40,130 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.62 ms. Allocated memory is still 1.0 GB. Free memory was 939.7 MB in the beginning and 937.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:52:40,131 INFO L168 Benchmark]: Boogie Preprocessor took 98.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-10-26 19:52:40,131 INFO L168 Benchmark]: RCFGBuilder took 4547.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 801.0 MB in the end (delta: 322.4 MB). Peak memory consumption was 322.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:52:40,131 INFO L168 Benchmark]: CodeCheck took 46815.33 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 483.9 MB). Free memory was 801.0 MB in the beginning and 1.1 GB in the end (delta: -281.7 MB). Peak memory consumption was 202.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:52:40,132 INFO L168 Benchmark]: Witness Printer took 195.24 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:52:40,135 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, 130 locations, 1 error locations. UNSAFE Result, 46.6s OverallTime, 21 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10280184 SDtfs, 6883162 SDslu, 8423512 SDs, 0 SdLazy, 26303044 SolverSat, 6121838 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3729 GetRequests, 3166 SyntacticMatches, 127 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109654 ImplicationChecksByTransitivity, 40.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 66185 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 20/70 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: 601]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L74] port_t p13 ; [L78] port_t p21 ; [L82] port_t p23 ; [L86] port_t p31 ; [L90] port_t p32 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] ep12 = __VERIFIER_nondet_bool() [L528] ep13 = __VERIFIER_nondet_bool() [L529] ep21 = __VERIFIER_nondet_bool() [L530] ep23 = __VERIFIER_nondet_bool() [L531] ep31 = __VERIFIER_nondet_bool() [L532] ep32 = __VERIFIER_nondet_bool() [L533] id1 = __VERIFIER_nondet_char() [L534] r1 = __VERIFIER_nondet_char() [L535] st1 = __VERIFIER_nondet_char() [L536] nl1 = __VERIFIER_nondet_char() [L537] m1 = __VERIFIER_nondet_char() [L538] max1 = __VERIFIER_nondet_char() [L539] mode1 = __VERIFIER_nondet_bool() [L540] id2 = __VERIFIER_nondet_char() [L541] r2 = __VERIFIER_nondet_char() [L542] st2 = __VERIFIER_nondet_char() [L543] nl2 = __VERIFIER_nondet_char() [L544] m2 = __VERIFIER_nondet_char() [L545] max2 = __VERIFIER_nondet_char() [L546] mode2 = __VERIFIER_nondet_bool() [L547] id3 = __VERIFIER_nondet_char() [L548] r3 = __VERIFIER_nondet_char() [L549] st3 = __VERIFIER_nondet_char() [L550] nl3 = __VERIFIER_nondet_char() [L551] m3 = __VERIFIER_nondet_char() [L552] max3 = __VERIFIER_nondet_char() [L553] mode3 = __VERIFIER_nondet_bool() [L554] CALL, EXPR init() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND FALSE !(\read(r121)) [L277] COND TRUE \read(r131) [L278] COND TRUE \read(ep32) [L279] tmp = 1 [L286] r122 = (_Bool )tmp [L287] COND TRUE \read(r131) [L288] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND TRUE \read(r211) [L301] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND FALSE !(\read(r231)) [L316] COND TRUE \read(r211) [L317] COND TRUE \read(ep13) [L318] tmp___2 = 1 [L325] r232 = (_Bool )tmp___2 [L326] COND FALSE !(\read(r311)) [L329] COND TRUE \read(r321) [L330] COND TRUE \read(ep21) [L331] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND TRUE \read(r321) [L340] tmp___4 = 1 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE \read(r122) [L362] COND TRUE \read(r132) [L363] COND TRUE \read(r212) [L364] COND TRUE \read(r232) [L365] COND TRUE \read(r312) [L366] COND TRUE \read(r322) [L367] COND TRUE (int )max1 == (int )id1 [L368] COND TRUE (int )max2 == (int )id2 [L369] COND TRUE (int )max3 == (int )id3 [L370] COND TRUE (int )st1 == 0 [L371] COND TRUE (int )st2 == 0 [L372] COND TRUE (int )st3 == 0 [L373] COND TRUE (int )nl1 == 0 [L374] COND TRUE (int )nl2 == 0 [L375] COND TRUE (int )nl3 == 0 [L376] COND TRUE (int )mode1 == 0 [L377] COND TRUE (int )mode2 == 0 [L378] COND TRUE (int )mode3 == 0 [L379] tmp___5 = 1 [L461] RET return (tmp___5); [L554] EXPR init() [L554] i2 = init() [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND FALSE !(\read(ep12)) [L149] COND TRUE \read(ep13) [L150] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L150] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L153] RET mode1 = (_Bool)1 [L571] node1() [L572] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND FALSE !(\read(ep23)) [L196] RET mode2 = (_Bool)1 [L572] node2() [L573] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND FALSE !(\read(ep31)) [L235] COND TRUE \read(ep32) [L236] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] RET mode3 = (_Bool)1 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=4, m2=3, m3=125, max1=127, max2=3, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND FALSE !((int )m1 > (int )max1) [L129] COND FALSE !(\read(ep31)) [L136] COND TRUE (int )r1 == 1 [L137] COND TRUE (int )max1 == (int )id1 [L138] st1 = (char)1 [L143] RET mode1 = (_Bool)0 [L571] node1() [L572] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND TRUE (int )m2 > (int )max2 [L176] max2 = m2 [L179] COND FALSE !((int )r2 == 2) [L186] RET mode2 = (_Bool)0 [L572] node2() [L573] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND TRUE \read(ep13) [L209] m3 = p13_old [L210] p13_old = nomsg [L211] COND TRUE (int )m3 > (int )max3 [L212] max3 = m3 [L215] COND FALSE !(\read(ep23)) [L222] COND FALSE !((int )r3 == 2) [L229] RET mode3 = (_Bool)0 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=3, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=3, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=3, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=3, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=3, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=3, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L476] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L503] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=3, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=3, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L601] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=3, id3=126, m1=3, m2=126, m3=127, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.04 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 939.7 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.62 ms. Allocated memory is still 1.0 GB. Free memory was 939.7 MB in the beginning and 937.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4547.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 801.0 MB in the end (delta: 322.4 MB). Peak memory consumption was 322.4 MB. Max. memory is 11.5 GB. * CodeCheck took 46815.33 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 483.9 MB). Free memory was 801.0 MB in the beginning and 1.1 GB in the end (delta: -281.7 MB). Peak memory consumption was 202.2 MB. Max. memory is 11.5 GB. * Witness Printer took 195.24 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...