./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/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 dd0859243246f60a71565c745331aae0aa96ecec .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-a4ecdab [2020-11-28 04:41:50,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 04:41:50,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 04:41:51,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 04:41:51,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 04:41:51,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 04:41:51,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 04:41:51,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 04:41:51,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 04:41:51,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 04:41:51,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 04:41:51,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 04:41:51,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 04:41:51,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 04:41:51,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 04:41:51,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 04:41:51,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 04:41:51,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 04:41:51,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 04:41:51,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 04:41:51,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 04:41:51,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 04:41:51,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 04:41:51,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 04:41:51,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 04:41:51,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 04:41:51,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 04:41:51,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 04:41:51,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 04:41:51,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 04:41:51,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 04:41:51,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 04:41:51,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 04:41:51,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 04:41:51,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 04:41:51,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 04:41:51,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 04:41:51,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 04:41:51,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 04:41:51,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 04:41:51,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 04:41:51,091 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-11-28 04:41:51,120 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 04:41:51,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 04:41:51,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-28 04:41:51,125 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-11-28 04:41:51,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 04:41:51,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 04:41:51,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 04:41:51,126 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 04:41:51,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 04:41:51,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 04:41:51,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 04:41:51,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 04:41:51,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 04:41:51,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 04:41:51,128 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 04:41:51,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 04:41:51,128 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 04:41:51,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 04:41:51,128 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-11-28 04:41:51,129 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-11-28 04:41:51,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 04:41:51,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 04:41:51,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-11-28 04:41:51,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 04:41:51,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 04:41:51,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 04:41:51,130 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-11-28 04:41:51,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 04:41:51,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 04:41:51,131 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_2a3ea391-14ee-4eb4-b8da-95d30c89a638/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_2a3ea391-14ee-4eb4-b8da-95d30c89a638/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 -> dd0859243246f60a71565c745331aae0aa96ecec [2020-11-28 04:41:51,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 04:41:51,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 04:41:51,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 04:41:51,411 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 04:41:51,411 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 04:41:51,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2020-11-28 04:41:51,472 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/bin/ukojak/data/1ffef833d/26ecd7baec1c4c24bd7b6ea9c2eeca98/FLAG5320e5f7c [2020-11-28 04:41:51,989 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 04:41:51,990 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2020-11-28 04:41:52,002 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/bin/ukojak/data/1ffef833d/26ecd7baec1c4c24bd7b6ea9c2eeca98/FLAG5320e5f7c [2020-11-28 04:41:52,332 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/bin/ukojak/data/1ffef833d/26ecd7baec1c4c24bd7b6ea9c2eeca98 [2020-11-28 04:41:52,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 04:41:52,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 04:41:52,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 04:41:52,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 04:41:52,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 04:41:52,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:41:52" (1/1) ... [2020-11-28 04:41:52,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e148580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:52, skipping insertion in model container [2020-11-28 04:41:52,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:41:52" (1/1) ... [2020-11-28 04:41:52,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 04:41:52,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 04:41:52,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 04:41:52,737 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 04:41:52,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 04:41:52,840 INFO L208 MainTranslator]: Completed translation [2020-11-28 04:41:52,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:52 WrapperNode [2020-11-28 04:41:52,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 04:41:52,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 04:41:52,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 04:41:52,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 04:41:52,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:52" (1/1) ... [2020-11-28 04:41:52,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:52" (1/1) ... [2020-11-28 04:41:52,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 04:41:52,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 04:41:52,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 04:41:52,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 04:41:52,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:52" (1/1) ... [2020-11-28 04:41:52,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:52" (1/1) ... [2020-11-28 04:41:52,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:52" (1/1) ... [2020-11-28 04:41:52,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:52" (1/1) ... [2020-11-28 04:41:52,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:52" (1/1) ... [2020-11-28 04:41:52,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:52" (1/1) ... [2020-11-28 04:41:52,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:52" (1/1) ... [2020-11-28 04:41:52,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 04:41:52,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 04:41:52,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 04:41:52,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 04:41:52,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/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-11-28 04:41:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 04:41:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 04:41:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 04:41:53,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 04:41:56,341 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 04:41:56,341 INFO L298 CfgBuilder]: Removed 21 assume(true) statements. [2020-11-28 04:41:56,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:41:56 BoogieIcfgContainer [2020-11-28 04:41:56,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 04:41:56,346 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-11-28 04:41:56,348 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-11-28 04:41:56,357 INFO L275 PluginConnector]: CodeCheck initialized [2020-11-28 04:41:56,358 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:41:56" (1/1) ... [2020-11-28 04:41:56,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 04:41:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:41:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2020-11-28 04:41:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-11-28 04:41:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-28 04:41:56,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:41:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:41:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:41:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:41:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2020-11-28 04:41:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2020-11-28 04:41:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-28 04:41:57,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:41:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:41:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:41:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:41:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2020-11-28 04:41:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2020-11-28 04:41:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-28 04:41:57,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:41:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:41:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:41:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:41:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2020-11-28 04:41:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2020-11-28 04:41:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 04:41:58,282 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:41:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:41:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:41:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:41:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 33 states and 60 transitions. [2020-11-28 04:41:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 60 transitions. [2020-11-28 04:41:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 04:41:59,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:41:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:41:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2020-11-28 04:42:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2020-11-28 04:42:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 04:42:00,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2020-11-28 04:42:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2020-11-28 04:42:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 04:42:01,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 48 states and 89 transitions. [2020-11-28 04:42:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2020-11-28 04:42:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 04:42:02,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:02,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 49 states and 91 transitions. [2020-11-28 04:42:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 91 transitions. [2020-11-28 04:42:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 04:42:02,152 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 59 states and 109 transitions. [2020-11-28 04:42:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 109 transitions. [2020-11-28 04:42:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 04:42:04,013 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 63 states and 115 transitions. [2020-11-28 04:42:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 115 transitions. [2020-11-28 04:42:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 04:42:04,551 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:05,628 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2020-11-28 04:42:08,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 79 states and 148 transitions. [2020-11-28 04:42:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 148 transitions. [2020-11-28 04:42:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 04:42:08,961 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 86 states and 165 transitions. [2020-11-28 04:42:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 165 transitions. [2020-11-28 04:42:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 04:42:10,965 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 87 states and 168 transitions. [2020-11-28 04:42:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 168 transitions. [2020-11-28 04:42:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-28 04:42:11,587 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 101 states and 198 transitions. [2020-11-28 04:42:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 198 transitions. [2020-11-28 04:42:15,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-28 04:42:15,347 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 102 states and 200 transitions. [2020-11-28 04:42:16,049 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 200 transitions. [2020-11-28 04:42:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 04:42:16,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 112 states and 214 transitions. [2020-11-28 04:42:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 214 transitions. [2020-11-28 04:42:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 04:42:19,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 114 states and 220 transitions. [2020-11-28 04:42:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 220 transitions. [2020-11-28 04:42:20,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 04:42:20,757 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 115 states and 222 transitions. [2020-11-28 04:42:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 222 transitions. [2020-11-28 04:42:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 04:42:21,516 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:42:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:42:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:42:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 116 states and 226 transitions. [2020-11-28 04:42:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 226 transitions. [2020-11-28 04:42:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-28 04:42:22,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:42:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 04:42:22,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 04:42:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 04:42:23,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 04:42:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 04:42:23,454 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 04:42:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 04:42:23,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 04:42:23,738 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 20 iterations. [2020-11-28 04:42:23,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 28.11 04:42:23 ImpRootNode [2020-11-28 04:42:23,960 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-11-28 04:42:23,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 04:42:23,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 04:42:23,961 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 04:42:23,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:41:56" (3/4) ... [2020-11-28 04:42:23,963 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 04:42:24,130 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2a3ea391-14ee-4eb4-b8da-95d30c89a638/bin/ukojak/witness.graphml [2020-11-28 04:42:24,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 04:42:24,132 INFO L168 Benchmark]: Toolchain (without parser) took 31795.56 ms. Allocated memory was 98.6 MB in the beginning and 453.0 MB in the end (delta: 354.4 MB). Free memory was 67.7 MB in the beginning and 334.8 MB in the end (delta: -267.2 MB). Peak memory consumption was 86.7 MB. Max. memory is 16.1 GB. [2020-11-28 04:42:24,132 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 75.5 MB. Free memory was 36.1 MB in the beginning and 36.1 MB in the end (delta: 37.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 04:42:24,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.29 ms. Allocated memory is still 98.6 MB. Free memory was 67.4 MB in the beginning and 70.1 MB in the end (delta: -2.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 04:42:24,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.98 ms. Allocated memory is still 98.6 MB. Free memory was 70.1 MB in the beginning and 66.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 04:42:24,133 INFO L168 Benchmark]: Boogie Preprocessor took 44.03 ms. Allocated memory is still 98.6 MB. Free memory was 66.9 MB in the beginning and 64.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 04:42:24,134 INFO L168 Benchmark]: RCFGBuilder took 3393.66 ms. Allocated memory was 98.6 MB in the beginning and 157.3 MB in the end (delta: 58.7 MB). Free memory was 64.3 MB in the beginning and 119.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 69.5 MB. Max. memory is 16.1 GB. [2020-11-28 04:42:24,134 INFO L168 Benchmark]: CodeCheck took 27614.47 ms. Allocated memory was 157.3 MB in the beginning and 453.0 MB in the end (delta: 295.7 MB). Free memory was 119.4 MB in the beginning and 348.5 MB in the end (delta: -229.0 MB). Peak memory consumption was 66.7 MB. Max. memory is 16.1 GB. [2020-11-28 04:42:24,134 INFO L168 Benchmark]: Witness Printer took 169.91 ms. Allocated memory is still 453.0 MB. Free memory was 348.5 MB in the beginning and 334.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-28 04:42:24,137 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: 27.3s, OverallIterations: 20, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4614816 SDtfs, 2079124 SDslu, 1630528 SDs, 0 SdLazy, 13107976 SolverSat, 2865812 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2994 GetRequests, 2601 SyntacticMatches, 115 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41266 ImplicationChecksByTransitivity, 20.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 42520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 18/54 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: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L229] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L519] int c1 ; [L520] int i2 ; [L523] c1 = 0 [L524] ep12 = __VERIFIER_nondet_bool() [L525] ep13 = __VERIFIER_nondet_bool() [L526] ep21 = __VERIFIER_nondet_bool() [L527] ep23 = __VERIFIER_nondet_bool() [L528] ep31 = __VERIFIER_nondet_bool() [L529] ep32 = __VERIFIER_nondet_bool() [L530] id1 = __VERIFIER_nondet_char() [L531] r1 = __VERIFIER_nondet_char() [L532] st1 = __VERIFIER_nondet_char() [L533] nl1 = __VERIFIER_nondet_char() [L534] m1 = __VERIFIER_nondet_char() [L535] max1 = __VERIFIER_nondet_char() [L536] mode1 = __VERIFIER_nondet_bool() [L537] newmax1 = __VERIFIER_nondet_bool() [L538] id2 = __VERIFIER_nondet_char() [L539] r2 = __VERIFIER_nondet_char() [L540] st2 = __VERIFIER_nondet_char() [L541] nl2 = __VERIFIER_nondet_char() [L542] m2 = __VERIFIER_nondet_char() [L543] max2 = __VERIFIER_nondet_char() [L544] mode2 = __VERIFIER_nondet_bool() [L545] newmax2 = __VERIFIER_nondet_bool() [L546] id3 = __VERIFIER_nondet_char() [L547] r3 = __VERIFIER_nondet_char() [L548] st3 = __VERIFIER_nondet_char() [L549] nl3 = __VERIFIER_nondet_char() [L550] m3 = __VERIFIER_nondet_char() [L551] max3 = __VERIFIER_nondet_char() [L552] mode3 = __VERIFIER_nondet_bool() [L553] newmax3 = __VERIFIER_nondet_bool() [L232] _Bool r121 ; [L233] _Bool r131 ; [L234] _Bool r211 ; [L235] _Bool r231 ; [L236] _Bool r311 ; [L237] _Bool r321 ; [L238] _Bool r122 ; [L239] int tmp ; [L240] _Bool r132 ; [L241] int tmp___0 ; [L242] _Bool r212 ; [L243] int tmp___1 ; [L244] _Bool r232 ; [L245] int tmp___2 ; [L246] _Bool r312 ; [L247] int tmp___3 ; [L248] _Bool r322 ; [L249] int tmp___4 ; [L250] int tmp___5 ; [L253] r121 = ep12 [L254] r131 = ep13 [L255] r211 = ep21 [L256] r231 = ep23 [L257] r311 = ep31 [L258] r321 = ep32 [L259] COND TRUE \read(r121) [L260] tmp = 1 [L271] r122 = (_Bool )tmp [L272] COND FALSE !(\read(r131)) [L275] COND TRUE \read(r121) [L276] COND TRUE \read(ep23) [L277] tmp___0 = 1 [L284] r132 = (_Bool )tmp___0 [L285] COND TRUE \read(r211) [L286] tmp___1 = 1 [L297] r212 = (_Bool )tmp___1 [L298] COND TRUE \read(r231) [L299] tmp___2 = 1 [L310] r232 = (_Bool )tmp___2 [L311] COND FALSE !(\read(r311)) [L314] COND TRUE \read(r321) [L315] COND TRUE \read(ep21) [L316] tmp___3 = 1 [L323] r312 = (_Bool )tmp___3 [L324] COND TRUE \read(r321) [L325] tmp___4 = 1 [L336] r322 = (_Bool )tmp___4 [L337] COND TRUE (int )id1 != (int )id2 [L338] COND TRUE (int )id1 != (int )id3 [L339] COND TRUE (int )id2 != (int )id3 [L340] COND TRUE (int )id1 >= 0 [L341] COND TRUE (int )id2 >= 0 [L342] COND TRUE (int )id3 >= 0 [L343] COND TRUE (int )r1 == 0 [L344] COND TRUE (int )r2 == 0 [L345] COND TRUE (int )r3 == 0 [L346] COND TRUE \read(r122) [L347] COND TRUE \read(r132) [L348] COND TRUE \read(r212) [L349] COND TRUE \read(r232) [L350] COND TRUE \read(r312) [L351] COND TRUE \read(r322) [L352] COND TRUE (int )max1 == (int )id1 [L353] COND TRUE (int )max2 == (int )id2 [L354] COND TRUE (int )max3 == (int )id3 [L355] COND TRUE (int )st1 == 0 [L356] COND TRUE (int )st2 == 0 [L357] COND TRUE (int )st3 == 0 [L358] COND TRUE (int )nl1 == 0 [L359] COND TRUE (int )nl2 == 0 [L360] COND TRUE (int )nl3 == 0 [L361] COND TRUE (int )mode1 == 0 [L362] COND TRUE (int )mode2 == 0 [L363] COND TRUE (int )mode3 == 0 [L364] COND TRUE \read(newmax1) [L365] COND TRUE \read(newmax2) [L366] COND TRUE \read(newmax3) [L367] tmp___5 = 1 [L458] return (tmp___5); [L554] i2 = init() [L21] COND FALSE !(!cond) [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=0, mode2=0, mode3=0, newmax1=255, 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] [L569] COND TRUE i2 < 6 [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND FALSE !(\read(ep13)) [L122] mode1 = (_Bool)1 [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND TRUE \read(newmax2) [L164] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L164] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L167] COND TRUE \read(ep23) [L168] COND TRUE \read(newmax2) [L169] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L169] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L173] mode2 = (_Bool)1 [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND FALSE !(\read(ep31)) [L218] COND TRUE \read(ep32) [L219] COND TRUE \read(newmax3) [L220] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L220] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L224] mode3 = (_Bool)1 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L463] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L480] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L485] COND TRUE (int )r1 < 2 [L486] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L514] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=124, m2=127, m3=124, max1=126, max2=125, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L92] COND FALSE !(\read(ep31)) [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 1 [L102] COND TRUE (int )max1 == (int )id1 [L103] st1 = (char)1 [L108] mode1 = (_Bool)0 [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND TRUE (int )m2 > (int )max2 [L139] max2 = m2 [L140] newmax = (_Bool)1 [L143] COND TRUE \read(ep32) [L144] m2 = p32_old [L145] p32_old = nomsg [L146] COND FALSE !((int )m2 > (int )max2) [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND FALSE !(\read(ep13)) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND TRUE (int )m3 > (int )max3 [L198] max3 = m3 [L199] newmax = (_Bool)1 [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L463] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=125, m2=124, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L466] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=125, m2=124, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L467] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=125, m2=124, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L468] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=125, m2=124, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L469] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=125, m2=124, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L470] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=125, m2=124, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L473] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L500] tmp = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=125, m2=124, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L514] return (tmp); [L586] c1 = check() [L599] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=125, m2=124, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L3] __assert_fail("0", "pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c", 3, "reach_error") VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=126, id2=125, id3=124, m1=125, m2=124, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, 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=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.23 ms. Allocated memory is still 75.5 MB. Free memory was 36.1 MB in the beginning and 36.1 MB in the end (delta: 37.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 502.29 ms. Allocated memory is still 98.6 MB. Free memory was 67.4 MB in the beginning and 70.1 MB in the end (delta: -2.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 62.98 ms. Allocated memory is still 98.6 MB. Free memory was 70.1 MB in the beginning and 66.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.03 ms. Allocated memory is still 98.6 MB. Free memory was 66.9 MB in the beginning and 64.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3393.66 ms. Allocated memory was 98.6 MB in the beginning and 157.3 MB in the end (delta: 58.7 MB). Free memory was 64.3 MB in the beginning and 119.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 69.5 MB. Max. memory is 16.1 GB. * CodeCheck took 27614.47 ms. Allocated memory was 157.3 MB in the beginning and 453.0 MB in the end (delta: 295.7 MB). Free memory was 119.4 MB in the beginning and 348.5 MB in the end (delta: -229.0 MB). Peak memory consumption was 66.7 MB. Max. memory is 16.1 GB. * Witness Printer took 169.91 ms. Allocated memory is still 453.0 MB. Free memory was 348.5 MB in the beginning and 334.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...