./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba950fe2d036378a3065660e3d85b422f002b7a8 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.0-69874e2 [2020-12-01 17:56:48,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 17:56:48,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 17:56:48,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 17:56:48,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 17:56:48,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 17:56:48,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 17:56:48,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 17:56:48,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 17:56:48,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 17:56:48,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 17:56:48,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 17:56:48,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 17:56:48,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 17:56:48,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 17:56:48,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 17:56:48,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 17:56:48,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 17:56:48,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 17:56:48,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 17:56:48,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 17:56:48,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 17:56:48,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 17:56:48,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 17:56:48,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 17:56:48,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 17:56:48,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 17:56:48,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 17:56:48,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 17:56:48,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 17:56:48,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 17:56:48,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 17:56:48,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 17:56:48,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 17:56:48,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 17:56:48,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 17:56:48,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 17:56:48,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 17:56:48,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 17:56:48,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 17:56:48,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 17:56:48,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 17:56:48,305 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 17:56:48,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 17:56:48,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 17:56:48,307 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 17:56:48,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 17:56:48,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 17:56:48,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 17:56:48,310 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 17:56:48,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 17:56:48,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 17:56:48,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 17:56:48,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 17:56:48,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 17:56:48,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 17:56:48,312 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 17:56:48,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 17:56:48,313 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 17:56:48,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 17:56:48,314 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 17:56:48,314 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 17:56:48,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 17:56:48,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 17:56:48,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 17:56:48,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 17:56:48,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 17:56:48,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 17:56:48,317 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 17:56:48,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 17:56:48,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 17:56:48,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/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(reach_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 -> ba950fe2d036378a3065660e3d85b422f002b7a8 [2020-12-01 17:56:48,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 17:56:48,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 17:56:48,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 17:56:48,698 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 17:56:48,700 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 17:56:48,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2020-12-01 17:56:48,795 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak/data/806f2c4d6/d465ee294618471087eb69b1fcf76437/FLAG1efff6b01 [2020-12-01 17:56:49,467 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 17:56:49,470 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2020-12-01 17:56:49,490 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak/data/806f2c4d6/d465ee294618471087eb69b1fcf76437/FLAG1efff6b01 [2020-12-01 17:56:49,739 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak/data/806f2c4d6/d465ee294618471087eb69b1fcf76437 [2020-12-01 17:56:49,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 17:56:49,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 17:56:49,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 17:56:49,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 17:56:49,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 17:56:49,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:56:49" (1/1) ... [2020-12-01 17:56:49,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b5e284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:56:49, skipping insertion in model container [2020-12-01 17:56:49,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:56:49" (1/1) ... [2020-12-01 17:56:49,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 17:56:49,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 17:56:50,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:56:50,360 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 17:56:50,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:56:50,489 INFO L208 MainTranslator]: Completed translation [2020-12-01 17:56:50,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:56:50 WrapperNode [2020-12-01 17:56:50,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 17:56:50,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 17:56:50,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 17:56:50,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 17:56:50,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:56:50" (1/1) ... [2020-12-01 17:56:50,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:56:50" (1/1) ... [2020-12-01 17:56:50,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 17:56:50,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 17:56:50,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 17:56:50,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 17:56:50,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:56:50" (1/1) ... [2020-12-01 17:56:50,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:56:50" (1/1) ... [2020-12-01 17:56:50,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:56:50" (1/1) ... [2020-12-01 17:56:50,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:56:50" (1/1) ... [2020-12-01 17:56:50,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:56:50" (1/1) ... [2020-12-01 17:56:50,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:56:50" (1/1) ... [2020-12-01 17:56:50,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:56:50" (1/1) ... [2020-12-01 17:56:50,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 17:56:50,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 17:56:50,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 17:56:50,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 17:56:50,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:56:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/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 [2020-12-01 17:56:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 17:56:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 17:56:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 17:56:50,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 17:56:54,386 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 17:56:54,387 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-12-01 17:56:54,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:56:54 BoogieIcfgContainer [2020-12-01 17:56:54,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 17:56:54,391 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 17:56:54,391 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 17:56:54,404 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 17:56:54,405 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:56:54" (1/1) ... [2020-12-01 17:56:54,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:56:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:56:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2020-12-01 17:56:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-12-01 17:56:54,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-01 17:56:54,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:56:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:56:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:56:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:56:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2020-12-01 17:56:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2020-12-01 17:56:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 17:56:55,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:56:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:56:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:56:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:56:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 24 states and 42 transitions. [2020-12-01 17:56:56,243 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 42 transitions. [2020-12-01 17:56:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-01 17:56:56,247 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:56:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:56:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:56:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:56:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 28 states and 53 transitions. [2020-12-01 17:56:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 53 transitions. [2020-12-01 17:56:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 17:56:57,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:56:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:56:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:56:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:56:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 33 states and 65 transitions. [2020-12-01 17:56:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 65 transitions. [2020-12-01 17:56:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 17:56:58,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:56:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:56:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:56:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:56:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 37 states and 73 transitions. [2020-12-01 17:56:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 73 transitions. [2020-12-01 17:56:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-01 17:56:59,373 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:56:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:56:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 43 states and 87 transitions. [2020-12-01 17:57:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 87 transitions. [2020-12-01 17:57:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 17:57:00,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 44 states and 88 transitions. [2020-12-01 17:57:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 88 transitions. [2020-12-01 17:57:01,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 17:57:01,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 53 states and 102 transitions. [2020-12-01 17:57:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 102 transitions. [2020-12-01 17:57:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 17:57:02,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 54 states and 103 transitions. [2020-12-01 17:57:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 103 transitions. [2020-12-01 17:57:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-01 17:57:03,178 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 57 states and 109 transitions. [2020-12-01 17:57:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 109 transitions. [2020-12-01 17:57:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:57:03,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 73 states and 142 transitions. [2020-12-01 17:57:08,894 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 142 transitions. [2020-12-01 17:57:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:57:08,896 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 80 states and 163 transitions. [2020-12-01 17:57:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 163 transitions. [2020-12-01 17:57:12,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:57:12,507 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 81 states and 165 transitions. [2020-12-01 17:57:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 165 transitions. [2020-12-01 17:57:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:57:13,326 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 89 states and 188 transitions. [2020-12-01 17:57:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 188 transitions. [2020-12-01 17:57:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:57:17,141 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 91 states and 198 transitions. [2020-12-01 17:57:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 198 transitions. [2020-12-01 17:57:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:57:18,503 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 92 states and 202 transitions. [2020-12-01 17:57:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 202 transitions. [2020-12-01 17:57:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 17:57:19,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 100 states and 224 transitions. [2020-12-01 17:57:25,317 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 224 transitions. [2020-12-01 17:57:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 17:57:25,319 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 103 states and 234 transitions. [2020-12-01 17:57:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 234 transitions. [2020-12-01 17:57:27,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 17:57:27,521 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:57:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:57:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:57:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 104 states and 238 transitions. [2020-12-01 17:57:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 238 transitions. [2020-12-01 17:57:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 17:57:28,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:57:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:57:28,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:57:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:57:29,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:57:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:57:29,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:57:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:57:29,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:57:36,342 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 20 iterations. [2020-12-01 17:57:36,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 05:57:36 ImpRootNode [2020-12-01 17:57:36,520 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 17:57:36,521 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 17:57:36,521 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 17:57:36,522 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 17:57:36,522 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:56:54" (3/4) ... [2020-12-01 17:57:36,535 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 17:57:36,743 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4e87df82-7b76-4f93-9c67-8a13cfdca4e2/bin/ukojak/witness.graphml [2020-12-01 17:57:36,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 17:57:36,745 INFO L168 Benchmark]: Toolchain (without parser) took 46995.92 ms. Allocated memory was 83.9 MB in the beginning and 488.6 MB in the end (delta: 404.8 MB). Free memory was 51.9 MB in the beginning and 393.7 MB in the end (delta: -341.8 MB). Peak memory consumption was 64.0 MB. Max. memory is 16.1 GB. [2020-12-01 17:57:36,745 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 83.9 MB. Free memory was 43.3 MB in the beginning and 43.3 MB in the end (delta: 35.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 17:57:36,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.24 ms. Allocated memory is still 83.9 MB. Free memory was 51.7 MB in the beginning and 56.4 MB in the end (delta: -4.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-01 17:57:36,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.82 ms. Allocated memory is still 83.9 MB. Free memory was 56.4 MB in the beginning and 53.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 17:57:36,747 INFO L168 Benchmark]: Boogie Preprocessor took 109.35 ms. Allocated memory is still 83.9 MB. Free memory was 53.5 MB in the beginning and 51.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 17:57:36,747 INFO L168 Benchmark]: RCFGBuilder took 3703.80 ms. Allocated memory was 83.9 MB in the beginning and 142.6 MB in the end (delta: 58.7 MB). Free memory was 51.0 MB in the beginning and 43.5 MB in the end (delta: 7.5 MB). Peak memory consumption was 67.8 MB. Max. memory is 16.1 GB. [2020-12-01 17:57:36,748 INFO L168 Benchmark]: CodeCheck took 42129.33 ms. Allocated memory was 142.6 MB in the beginning and 488.6 MB in the end (delta: 346.0 MB). Free memory was 43.5 MB in the beginning and 407.3 MB in the end (delta: -363.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 17:57:36,748 INFO L168 Benchmark]: Witness Printer took 222.14 ms. Allocated memory is still 488.6 MB. Free memory was 407.3 MB in the beginning and 393.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-01 17:57:36,752 INFO L339 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, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 41.9s, OverallIterations: 20, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4557456 SDtfs, 1997996 SDslu, 1568032 SDs, 0 SdLazy, 13681160 SolverSat, 2405564 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2997 GetRequests, 2587 SyntacticMatches, 120 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44450 ImplicationChecksByTransitivity, 27.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 54488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 18/53 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND TRUE \read(r121) [L229] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND TRUE \read(r131) [L242] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND FALSE !(\read(r211)) [L257] COND TRUE \read(r231) [L258] COND TRUE \read(ep31) [L259] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND TRUE \read(r231) [L268] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND TRUE \read(r311) [L281] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND FALSE !(\read(r321)) [L296] COND TRUE \read(r311) [L297] COND TRUE \read(ep12) [L298] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, 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] [L523] COND TRUE i2 < 6 [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND TRUE \read(ep12) [L102] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L102] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L104] COND TRUE \read(ep13) [L105] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L420] int tmp ; VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] return (tmp); [L540] c1 = check() [L553] COND FALSE !(! arg) VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L542] i2 ++ VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=-128, m2=127, m3=127, max1=126, max2=124, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND TRUE (int )r1 == 1 [L92] COND TRUE (int )max1 == (int )id1 [L93] st1 = (char)1 [L98] mode1 = (_Bool)0 [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND TRUE (int )m2 > (int )max2 [L124] max2 = m2 [L127] COND FALSE !(\read(ep32)) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND TRUE (int )m3 > (int )max3 [L167] max3 = m3 [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L420] int tmp ; VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=125, m2=126, m3=124, max1=126, max2=126, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=125, m2=126, m3=124, max1=126, max2=126, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=125, m2=126, m3=124, max1=126, max2=126, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=125, m2=126, m3=124, max1=126, max2=126, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=125, m2=126, m3=124, max1=126, max2=126, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=125, m2=126, m3=124, max1=126, max2=126, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L430] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L457] tmp = 0 VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=125, m2=126, m3=124, max1=126, max2=126, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L471] return (tmp); [L540] c1 = check() [L553] COND TRUE ! arg VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=125, m2=126, m3=124, max1=126, max2=126, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L3] __assert_fail("0", "pals_floodmax.3.2.ufo.BOUNDED-6.pals.c", 3, "reach_error") VAL [ep12=255, ep13=1, ep21=0, ep23=255, ep31=255, ep32=0, id1=126, id2=124, id3=125, m1=125, m2=126, m3=124, max1=126, max2=126, 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=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.35 ms. Allocated memory is still 83.9 MB. Free memory was 43.3 MB in the beginning and 43.3 MB in the end (delta: 35.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 734.24 ms. Allocated memory is still 83.9 MB. Free memory was 51.7 MB in the beginning and 56.4 MB in the end (delta: -4.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 83.82 ms. Allocated memory is still 83.9 MB. Free memory was 56.4 MB in the beginning and 53.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 109.35 ms. Allocated memory is still 83.9 MB. Free memory was 53.5 MB in the beginning and 51.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3703.80 ms. Allocated memory was 83.9 MB in the beginning and 142.6 MB in the end (delta: 58.7 MB). Free memory was 51.0 MB in the beginning and 43.5 MB in the end (delta: 7.5 MB). Peak memory consumption was 67.8 MB. Max. memory is 16.1 GB. * CodeCheck took 42129.33 ms. Allocated memory was 142.6 MB in the beginning and 488.6 MB in the end (delta: 346.0 MB). Free memory was 43.5 MB in the beginning and 407.3 MB in the end (delta: -363.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 222.14 ms. Allocated memory is still 488.6 MB. Free memory was 407.3 MB in the beginning and 393.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...