./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-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_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/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 8a7b4ef7a8affb897157388e19dfe5e9a45c805e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:58:40,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:58:40,627 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:58:40,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:58:40,634 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:58:40,635 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:58:40,636 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:58:40,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:58:40,638 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:58:40,639 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:58:40,639 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:58:40,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:58:40,640 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:58:40,641 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:58:40,641 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:58:40,642 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:58:40,642 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:58:40,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:58:40,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:58:40,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:58:40,646 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:58:40,647 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:58:40,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:58:40,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:58:40,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:58:40,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:58:40,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:58:40,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:58:40,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:58:40,651 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:58:40,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:58:40,652 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:58:40,652 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:58:40,652 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:58:40,653 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:58:40,653 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:58:40,654 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 07:58:40,661 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:58:40,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:58:40,662 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:58:40,662 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:58:40,662 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:58:40,662 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:58:40,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:58:40,663 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:58:40,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:58:40,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:58:40,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:58:40,663 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:58:40,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:58:40,663 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:58:40,663 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:58:40,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:58:40,664 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:58:40,664 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 07:58:40,664 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 07:58:40,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:58:40,664 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:58:40,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 07:58:40,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:58:40,665 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:58:40,665 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:58:40,665 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 07:58:40,665 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:58:40,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:58:40,665 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_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/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 -> 8a7b4ef7a8affb897157388e19dfe5e9a45c805e [2018-11-10 07:58:40,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:58:40,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:58:40,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:58:40,702 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:58:40,703 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:58:40,703 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 07:58:40,751 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/bin-2019/ukojak/data/c26c84011/bddd762116ee4d0ab98449dc21864469/FLAG94961f287 [2018-11-10 07:58:41,123 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:58:41,124 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 07:58:41,132 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/bin-2019/ukojak/data/c26c84011/bddd762116ee4d0ab98449dc21864469/FLAG94961f287 [2018-11-10 07:58:41,144 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/bin-2019/ukojak/data/c26c84011/bddd762116ee4d0ab98449dc21864469 [2018-11-10 07:58:41,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:58:41,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:58:41,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:58:41,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:58:41,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:58:41,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:58:41" (1/1) ... [2018-11-10 07:58:41,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42725a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:58:41, skipping insertion in model container [2018-11-10 07:58:41,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:58:41" (1/1) ... [2018-11-10 07:58:41,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:58:41,192 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:58:41,346 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:58:41,351 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:58:41,388 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:58:41,400 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:58:41,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:58:41 WrapperNode [2018-11-10 07:58:41,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:58:41,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:58:41,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:58:41,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:58:41,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:58:41" (1/1) ... [2018-11-10 07:58:41,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:58:41" (1/1) ... [2018-11-10 07:58:41,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:58:41,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:58:41,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:58:41,481 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:58:41,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:58:41" (1/1) ... [2018-11-10 07:58:41,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:58:41" (1/1) ... [2018-11-10 07:58:41,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:58:41" (1/1) ... [2018-11-10 07:58:41,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:58:41" (1/1) ... [2018-11-10 07:58:41,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:58:41" (1/1) ... [2018-11-10 07:58:41,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:58:41" (1/1) ... [2018-11-10 07:58:41,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:58:41" (1/1) ... [2018-11-10 07:58:41,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:58:41,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:58:41,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:58:41,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:58:41,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:58:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 07:58:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:58:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:58:43,401 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:58:43,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:58:43 BoogieIcfgContainer [2018-11-10 07:58:43,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:58:43,402 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 07:58:43,402 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 07:58:43,412 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 07:58:43,412 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:58:43" (1/1) ... [2018-11-10 07:58:43,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:58:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-10 07:58:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-10 07:58:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 07:58:43,450 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-11-10 07:58:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-11-10 07:58:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 07:58:43,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-11-10 07:58:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-11-10 07:58:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 07:58:44,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-11-10 07:58:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-11-10 07:58:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 07:58:44,714 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-11-10 07:58:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-11-10 07:58:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 07:58:45,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-11-10 07:58:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-11-10 07:58:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 07:58:45,975 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-11-10 07:58:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-11-10 07:58:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 07:58:46,898 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-11-10 07:58:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-11-10 07:58:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 07:58:47,125 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-11-10 07:58:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-11-10 07:58:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 07:58:47,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 67 states and 114 transitions. [2018-11-10 07:58:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 114 transitions. [2018-11-10 07:58:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 07:58:48,719 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 70 states and 120 transitions. [2018-11-10 07:58:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 120 transitions. [2018-11-10 07:58:49,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:58:49,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 88 states and 157 transitions. [2018-11-10 07:58:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 157 transitions. [2018-11-10 07:58:52,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:58:52,391 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:52,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 103 states and 182 transitions. [2018-11-10 07:58:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 182 transitions. [2018-11-10 07:58:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:58:56,066 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 104 states and 185 transitions. [2018-11-10 07:58:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 185 transitions. [2018-11-10 07:58:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:58:56,372 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 122 states and 223 transitions. [2018-11-10 07:59:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 223 transitions. [2018-11-10 07:59:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:59:00,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 123 states and 226 transitions. [2018-11-10 07:59:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 226 transitions. [2018-11-10 07:59:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:59:00,748 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 124 states and 227 transitions. [2018-11-10 07:59:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 227 transitions. [2018-11-10 07:59:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:59:01,106 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 125 states and 231 transitions. [2018-11-10 07:59:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 231 transitions. [2018-11-10 07:59:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:59:01,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 142 states and 264 transitions. [2018-11-10 07:59:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 264 transitions. [2018-11-10 07:59:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:59:05,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 143 states and 268 transitions. [2018-11-10 07:59:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 268 transitions. [2018-11-10 07:59:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:59:05,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:06,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 144 states and 269 transitions. [2018-11-10 07:59:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 269 transitions. [2018-11-10 07:59:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:59:06,236 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 145 states and 274 transitions. [2018-11-10 07:59:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 274 transitions. [2018-11-10 07:59:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:59:06,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:59:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:59:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:59:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:59:07,267 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 22 iterations. [2018-11-10 07:59:07,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 07:59:07 ImpRootNode [2018-11-10 07:59:07,339 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 07:59:07,339 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:59:07,339 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:59:07,340 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:59:07,340 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:58:43" (3/4) ... [2018-11-10 07:59:07,342 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 07:59:07,422 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_35f6c11b-6b7e-43be-bed6-f7c5c67c3541/bin-2019/ukojak/witness.graphml [2018-11-10 07:59:07,423 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:59:07,423 INFO L168 Benchmark]: Toolchain (without parser) took 26276.61 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 622.9 MB). Free memory was 961.9 MB in the beginning and 1.6 GB in the end (delta: -602.8 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:59:07,424 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:59:07,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.92 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 940.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:59:07,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:59:07,425 INFO L168 Benchmark]: Boogie Preprocessor took 23.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:59:07,425 INFO L168 Benchmark]: RCFGBuilder took 1897.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 118.5 MB). Peak memory consumption was 266.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:59:07,425 INFO L168 Benchmark]: CodeCheck took 23936.39 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 481.8 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -562.9 MB). Peak memory consumption was 668.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:59:07,425 INFO L168 Benchmark]: Witness Printer took 83.75 ms. Allocated memory is still 1.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:59:07,427 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, 142 locations, 1 error locations. UNSAFE Result, 23.8s OverallTime, 22 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20556832 SDtfs, 13769980 SDslu, 16801408 SDs, 0 SdLazy, 52603602 SolverSat, 12238714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3774 GetRequests, 3213 SyntacticMatches, 161 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90510 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 69204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 22/77 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: 643]: 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] _Bool newmax1 ; [L102] char id2 ; [L103] char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] _Bool newmax2 ; [L110] char id3 ; [L111] char r3 ; [L112] char st3 ; [L113] char nl3 ; [L114] char m3 ; [L115] char max3 ; [L116] _Bool mode3 ; [L117] _Bool newmax3 ; [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 ; [L271] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L561] int c1 ; [L562] int i2 ; [L565] c1 = 0 [L566] ep12 = __VERIFIER_nondet_bool() [L567] ep13 = __VERIFIER_nondet_bool() [L568] ep21 = __VERIFIER_nondet_bool() [L569] ep23 = __VERIFIER_nondet_bool() [L570] ep31 = __VERIFIER_nondet_bool() [L571] ep32 = __VERIFIER_nondet_bool() [L572] id1 = __VERIFIER_nondet_char() [L573] r1 = __VERIFIER_nondet_char() [L574] st1 = __VERIFIER_nondet_char() [L575] nl1 = __VERIFIER_nondet_char() [L576] m1 = __VERIFIER_nondet_char() [L577] max1 = __VERIFIER_nondet_char() [L578] mode1 = __VERIFIER_nondet_bool() [L579] newmax1 = __VERIFIER_nondet_bool() [L580] id2 = __VERIFIER_nondet_char() [L581] r2 = __VERIFIER_nondet_char() [L582] st2 = __VERIFIER_nondet_char() [L583] nl2 = __VERIFIER_nondet_char() [L584] m2 = __VERIFIER_nondet_char() [L585] max2 = __VERIFIER_nondet_char() [L586] mode2 = __VERIFIER_nondet_bool() [L587] newmax2 = __VERIFIER_nondet_bool() [L588] id3 = __VERIFIER_nondet_char() [L589] r3 = __VERIFIER_nondet_char() [L590] st3 = __VERIFIER_nondet_char() [L591] nl3 = __VERIFIER_nondet_char() [L592] m3 = __VERIFIER_nondet_char() [L593] max3 = __VERIFIER_nondet_char() [L594] mode3 = __VERIFIER_nondet_bool() [L595] newmax3 = __VERIFIER_nondet_bool() [L596] CALL, EXPR init() [L274] _Bool r121 ; [L275] _Bool r131 ; [L276] _Bool r211 ; [L277] _Bool r231 ; [L278] _Bool r311 ; [L279] _Bool r321 ; [L280] _Bool r122 ; [L281] int tmp ; [L282] _Bool r132 ; [L283] int tmp___0 ; [L284] _Bool r212 ; [L285] int tmp___1 ; [L286] _Bool r232 ; [L287] int tmp___2 ; [L288] _Bool r312 ; [L289] int tmp___3 ; [L290] _Bool r322 ; [L291] int tmp___4 ; [L292] int tmp___5 ; [L295] r121 = ep12 [L296] r131 = ep13 [L297] r211 = ep21 [L298] r231 = ep23 [L299] r311 = ep31 [L300] r321 = ep32 [L301] COND FALSE !(\read(r121)) [L304] COND TRUE \read(r131) [L305] COND TRUE \read(ep32) [L306] tmp = 1 [L313] r122 = (_Bool )tmp [L314] COND TRUE \read(r131) [L315] tmp___0 = 1 [L326] r132 = (_Bool )tmp___0 [L327] COND FALSE !(\read(r211)) [L330] COND TRUE \read(r231) [L331] COND TRUE \read(ep31) [L332] tmp___1 = 1 [L339] r212 = (_Bool )tmp___1 [L340] COND TRUE \read(r231) [L341] tmp___2 = 1 [L352] r232 = (_Bool )tmp___2 [L353] COND TRUE \read(r311) [L354] tmp___3 = 1 [L365] r312 = (_Bool )tmp___3 [L366] COND TRUE \read(r321) [L367] tmp___4 = 1 [L378] r322 = (_Bool )tmp___4 [L379] COND TRUE (int )id1 != (int )id2 [L380] COND TRUE (int )id1 != (int )id3 [L381] COND TRUE (int )id2 != (int )id3 [L382] COND TRUE (int )id1 >= 0 [L383] COND TRUE (int )id2 >= 0 [L384] COND TRUE (int )id3 >= 0 [L385] COND TRUE (int )r1 == 0 [L386] COND TRUE (int )r2 == 0 [L387] COND TRUE (int )r3 == 0 [L388] COND TRUE \read(r122) [L389] COND TRUE \read(r132) [L390] COND TRUE \read(r212) [L391] COND TRUE \read(r232) [L392] COND TRUE \read(r312) [L393] COND TRUE \read(r322) [L394] COND TRUE (int )max1 == (int )id1 [L395] COND TRUE (int )max2 == (int )id2 [L396] COND TRUE (int )max3 == (int )id3 [L397] COND TRUE (int )st1 == 0 [L398] COND TRUE (int )st2 == 0 [L399] COND TRUE (int )st3 == 0 [L400] COND TRUE (int )nl1 == 0 [L401] COND TRUE (int )nl2 == 0 [L402] COND TRUE (int )nl3 == 0 [L403] COND TRUE (int )mode1 == 0 [L404] COND TRUE (int )mode2 == 0 [L405] COND TRUE (int )mode3 == 0 [L406] COND TRUE \read(newmax1) [L407] COND TRUE \read(newmax2) [L408] COND TRUE \read(newmax3) [L409] tmp___5 = 1 [L500] RET return (tmp___5); [L596] EXPR init() [L596] i2 = init() [L598] p12_old = nomsg [L599] p12_new = nomsg [L600] p13_old = nomsg [L601] p13_new = nomsg [L602] p21_old = nomsg [L603] p21_new = nomsg [L604] p23_old = nomsg [L605] p23_new = nomsg [L606] p31_old = nomsg [L607] p31_new = nomsg [L608] p32_old = nomsg [L609] p32_new = nomsg [L610] i2 = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L611] COND TRUE i2 < 6 [L613] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND TRUE \read(ep13) [L159] COND TRUE \read(newmax1) [L160] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L160] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] RET mode1 = (_Bool)1 [L613] node1() [L614] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND FALSE !(\read(ep21)) [L209] COND TRUE \read(ep23) [L210] COND TRUE \read(newmax2) [L211] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L211] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L215] RET mode2 = (_Bool)1 [L614] node2() [L615] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND TRUE \read(ep31) [L256] COND TRUE \read(newmax3) [L257] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L257] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L260] COND TRUE \read(ep32) [L261] COND TRUE \read(newmax3) [L262] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L262] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L266] RET mode3 = (_Bool)1 [L615] node3() [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L628] CALL, EXPR check() [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L556] RET return (tmp); [L628] EXPR check() [L628] c1 = check() [L629] CALL assert(c1) [L641] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L629] assert(c1) [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=-128, m3=-128, max1=127, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=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=-1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L613] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND FALSE !(\read(ep21)) [L134] COND TRUE \read(ep31) [L135] m1 = p31_old [L136] p31_old = nomsg [L137] COND FALSE !((int )m1 > (int )max1) [L142] newmax1 = newmax [L143] COND TRUE (int )r1 == 1 [L144] COND TRUE (int )max1 == (int )id1 [L145] st1 = (char)1 [L150] RET mode1 = (_Bool)0 [L613] node1() [L614] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND FALSE !((int )r2 == 2) [L201] RET mode2 = (_Bool)0 [L614] node2() [L615] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND TRUE \read(ep13) [L229] m3 = p13_old [L230] p13_old = nomsg [L231] COND TRUE (int )m3 > (int )max3 [L232] max3 = m3 [L233] newmax = (_Bool)1 [L236] COND TRUE \read(ep23) [L237] m3 = p23_old [L238] p23_old = nomsg [L239] COND FALSE !((int )m3 > (int )max3) [L244] newmax3 = newmax [L245] COND FALSE !((int )r3 == 2) [L252] RET mode3 = (_Bool)0 [L615] node3() [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L628] CALL, EXPR check() [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L515] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L542] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L556] RET return (tmp); [L628] EXPR check() [L628] c1 = check() [L629] CALL assert(c1) [L641] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L643] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=127, id2=1, id3=0, m1=0, m2=0, m3=1, max1=127, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.92 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 940.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1897.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 118.5 MB). Peak memory consumption was 266.0 MB. Max. memory is 11.5 GB. * CodeCheck took 23936.39 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 481.8 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -562.9 MB). Peak memory consumption was 668.8 MB. Max. memory is 11.5 GB. * Witness Printer took 83.75 ms. Allocated memory is still 1.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...