./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.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_84b82381-aebc-47f5-89d6-028fd63fe9c4/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/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 0418c890ceef4e03a4027371c9530a3b80d01884 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 18:24:44,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 18:24:44,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 18:24:44,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 18:24:44,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 18:24:44,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 18:24:44,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 18:24:44,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 18:24:44,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 18:24:44,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 18:24:44,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 18:24:44,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 18:24:44,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 18:24:44,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 18:24:44,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 18:24:44,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 18:24:44,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 18:24:44,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 18:24:44,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 18:24:44,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 18:24:44,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 18:24:44,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 18:24:44,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 18:24:44,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 18:24:44,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 18:24:44,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 18:24:44,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 18:24:44,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 18:24:44,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 18:24:44,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 18:24:44,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 18:24:44,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 18:24:44,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 18:24:44,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 18:24:44,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 18:24:44,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 18:24:44,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 18:24:44,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 18:24:44,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 18:24:44,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 18:24:44,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 18:24:44,181 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 18:24:44,211 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 18:24:44,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 18:24:44,212 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 18:24:44,213 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 18:24:44,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 18:24:44,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 18:24:44,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 18:24:44,215 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 18:24:44,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 18:24:44,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 18:24:44,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 18:24:44,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 18:24:44,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 18:24:44,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 18:24:44,217 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 18:24:44,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 18:24:44,217 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 18:24:44,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 18:24:44,218 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 18:24:44,218 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 18:24:44,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 18:24:44,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 18:24:44,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 18:24:44,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 18:24:44,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 18:24:44,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 18:24:44,220 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 18:24:44,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 18:24:44,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 18:24:44,221 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_84b82381-aebc-47f5-89d6-028fd63fe9c4/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_84b82381-aebc-47f5-89d6-028fd63fe9c4/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 -> 0418c890ceef4e03a4027371c9530a3b80d01884 [2020-12-01 18:24:44,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 18:24:44,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 18:24:44,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 18:24:44,667 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 18:24:44,670 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 18:24:44,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c [2020-12-01 18:24:44,772 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/bin/ukojak/data/e0c8c0f8d/664ce5d6741f40518149e0da9a8fe313/FLAG6e542cb04 [2020-12-01 18:24:45,500 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 18:24:45,505 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c [2020-12-01 18:24:45,522 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/bin/ukojak/data/e0c8c0f8d/664ce5d6741f40518149e0da9a8fe313/FLAG6e542cb04 [2020-12-01 18:24:45,812 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/bin/ukojak/data/e0c8c0f8d/664ce5d6741f40518149e0da9a8fe313 [2020-12-01 18:24:45,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 18:24:45,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 18:24:45,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 18:24:45,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 18:24:45,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 18:24:45,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:24:45" (1/1) ... [2020-12-01 18:24:45,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355e27f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:24:45, skipping insertion in model container [2020-12-01 18:24:45,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:24:45" (1/1) ... [2020-12-01 18:24:45,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 18:24:45,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 18:24:46,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 18:24:46,383 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 18:24:46,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 18:24:46,501 INFO L208 MainTranslator]: Completed translation [2020-12-01 18:24:46,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:24:46 WrapperNode [2020-12-01 18:24:46,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 18:24:46,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 18:24:46,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 18:24:46,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 18:24:46,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:24:46" (1/1) ... [2020-12-01 18:24:46,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:24:46" (1/1) ... [2020-12-01 18:24:46,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 18:24:46,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 18:24:46,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 18:24:46,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 18:24:46,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:24:46" (1/1) ... [2020-12-01 18:24:46,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:24:46" (1/1) ... [2020-12-01 18:24:46,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:24:46" (1/1) ... [2020-12-01 18:24:46,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:24:46" (1/1) ... [2020-12-01 18:24:46,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:24:46" (1/1) ... [2020-12-01 18:24:46,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:24:46" (1/1) ... [2020-12-01 18:24:46,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:24:46" (1/1) ... [2020-12-01 18:24:46,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 18:24:46,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 18:24:46,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 18:24:46,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 18:24:46,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:24:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/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 18:24:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 18:24:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 18:24:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 18:24:46,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 18:24:50,595 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 18:24:50,595 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-12-01 18:24:50,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:24:50 BoogieIcfgContainer [2020-12-01 18:24:50,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 18:24:50,600 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 18:24:50,600 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 18:24:50,613 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 18:24:50,614 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:24:50" (1/1) ... [2020-12-01 18:24:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 18:24:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:24:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2020-12-01 18:24:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-12-01 18:24:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-01 18:24:50,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:24:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:24:51,405 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 18:24:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:24:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2020-12-01 18:24:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-12-01 18:24:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 18:24:51,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:24:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:24:51,793 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 18:24:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:24:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2020-12-01 18:24:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2020-12-01 18:24:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-01 18:24:52,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:24:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:24:52,471 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 18:24:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:24:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2020-12-01 18:24:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2020-12-01 18:24:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 18:24:53,171 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:24:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:24:53,433 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 18:24:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:24:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2020-12-01 18:24:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2020-12-01 18:24:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 18:24:54,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:24:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:24:54,739 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 18:24:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:24:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2020-12-01 18:24:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2020-12-01 18:24:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-01 18:24:55,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:24:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:24:56,344 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 18:24:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:24:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2020-12-01 18:24:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2020-12-01 18:24:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 18:24:57,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:24:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:24:57,978 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 18:24:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:24:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2020-12-01 18:24:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2020-12-01 18:24:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 18:24:58,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:24:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:24:58,394 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 18:24:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:24:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2020-12-01 18:24:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2020-12-01 18:24:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 18:24:58,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:24:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:24:58,838 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 18:25:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:25:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2020-12-01 18:25:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2020-12-01 18:25:01,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-01 18:25:01,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:25:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:25:01,372 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 18:25:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:25:01,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2020-12-01 18:25:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2020-12-01 18:25:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 18:25:01,759 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:25:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:25:02,880 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 18:25:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:25:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 74 states and 139 transitions. [2020-12-01 18:25:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 139 transitions. [2020-12-01 18:25:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 18:25:09,772 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:25:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:25:10,707 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 18:25:11,291 WARN L197 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-12-01 18:25:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:25:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 90 states and 174 transitions. [2020-12-01 18:25:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 174 transitions. [2020-12-01 18:25:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 18:25:20,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:25:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:25:20,994 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 18:25:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:25:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 91 states and 175 transitions. [2020-12-01 18:25:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 175 transitions. [2020-12-01 18:25:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 18:25:21,704 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:25:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:25:23,205 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 18:25:23,364 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2020-12-01 18:25:23,878 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-12-01 18:25:24,730 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2020-12-01 18:25:25,206 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-12-01 18:25:26,619 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2020-12-01 18:25:27,193 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2020-12-01 18:25:27,454 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-12-01 18:25:28,375 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2020-12-01 18:25:28,614 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2020-12-01 18:25:29,573 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-12-01 18:25:30,064 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2020-12-01 18:25:31,029 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2020-12-01 18:25:33,286 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2020-12-01 18:25:33,513 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2020-12-01 18:25:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:25:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 108 states and 211 transitions. [2020-12-01 18:25:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 211 transitions. [2020-12-01 18:25:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 18:25:37,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:25:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:25:38,049 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 18:25:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:25:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 109 states and 214 transitions. [2020-12-01 18:25:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 214 transitions. [2020-12-01 18:25:39,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 18:25:39,087 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:25:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:25:39,246 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 18:25:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:25:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 110 states and 215 transitions. [2020-12-01 18:25:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 215 transitions. [2020-12-01 18:25:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 18:25:40,139 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:25:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:25:41,361 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 18:25:42,346 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-12-01 18:25:43,047 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2020-12-01 18:25:44,339 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-12-01 18:25:45,724 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-12-01 18:25:47,044 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-12-01 18:25:48,379 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-12-01 18:25:49,791 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2020-12-01 18:25:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:25:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 123 states and 243 transitions. [2020-12-01 18:25:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 243 transitions. [2020-12-01 18:25:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 18:25:55,014 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:25:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:25:55,169 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 18:25:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:25:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 125 states and 249 transitions. [2020-12-01 18:25:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 249 transitions. [2020-12-01 18:25:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 18:25:57,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:25:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:25:57,555 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 18:25:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:25:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 126 states and 250 transitions. [2020-12-01 18:25:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 250 transitions. [2020-12-01 18:25:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 18:25:58,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:25:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:25:58,879 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 18:26:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:26:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 127 states and 251 transitions. [2020-12-01 18:26:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 251 transitions. [2020-12-01 18:26:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 18:26:00,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:26:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:26:00,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:26:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:26:01,068 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:26:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:26:01,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:26:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:26:01,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:26:11,308 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 21 iterations. [2020-12-01 18:26:11,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 06:26:11 ImpRootNode [2020-12-01 18:26:11,510 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 18:26:11,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 18:26:11,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 18:26:11,512 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 18:26:11,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:24:50" (3/4) ... [2020-12-01 18:26:11,515 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 18:26:11,743 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_84b82381-aebc-47f5-89d6-028fd63fe9c4/bin/ukojak/witness.graphml [2020-12-01 18:26:11,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 18:26:11,744 INFO L168 Benchmark]: Toolchain (without parser) took 85923.60 ms. Allocated memory was 81.8 MB in the beginning and 465.6 MB in the end (delta: 383.8 MB). Free memory was 45.7 MB in the beginning and 335.9 MB in the end (delta: -290.2 MB). Peak memory consumption was 94.5 MB. Max. memory is 16.1 GB. [2020-12-01 18:26:11,745 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 81.8 MB. Free memory was 62.8 MB in the beginning and 62.7 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 18:26:11,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.22 ms. Allocated memory is still 81.8 MB. Free memory was 45.5 MB in the beginning and 53.9 MB in the end (delta: -8.4 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2020-12-01 18:26:11,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.45 ms. Allocated memory is still 81.8 MB. Free memory was 53.9 MB in the beginning and 51.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 18:26:11,748 INFO L168 Benchmark]: Boogie Preprocessor took 92.99 ms. Allocated memory is still 81.8 MB. Free memory was 51.0 MB in the beginning and 48.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 18:26:11,748 INFO L168 Benchmark]: RCFGBuilder took 3891.38 ms. Allocated memory was 81.8 MB in the beginning and 130.0 MB in the end (delta: 48.2 MB). Free memory was 48.8 MB in the beginning and 81.1 MB in the end (delta: -32.4 MB). Peak memory consumption was 59.2 MB. Max. memory is 16.1 GB. [2020-12-01 18:26:11,749 INFO L168 Benchmark]: CodeCheck took 80910.77 ms. Allocated memory was 130.0 MB in the beginning and 465.6 MB in the end (delta: 335.5 MB). Free memory was 81.1 MB in the beginning and 348.5 MB in the end (delta: -267.4 MB). Peak memory consumption was 67.1 MB. Max. memory is 16.1 GB. [2020-12-01 18:26:11,749 INFO L168 Benchmark]: Witness Printer took 231.76 ms. Allocated memory is still 465.6 MB. Free memory was 348.5 MB in the beginning and 335.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-01 18:26:11,756 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, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 80.6s, OverallIterations: 21, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5611520 SDtfs, 4051024 SDslu, 3244032 SDs, 0 SdLazy, 26345860 SolverSat, 5859720 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3494 GetRequests, 3000 SyntacticMatches, 110 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80229 ImplicationChecksByTransitivity, 61.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 48579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 20/60 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: [L25] msg_t nomsg = (msg_t )-1; [L26] port_t p12 ; [L27] char p12_old ; [L28] char p12_new ; [L29] _Bool ep12 ; [L30] port_t p13 ; [L31] char p13_old ; [L32] char p13_new ; [L33] _Bool ep13 ; [L34] port_t p21 ; [L35] char p21_old ; [L36] char p21_new ; [L37] _Bool ep21 ; [L38] port_t p23 ; [L39] char p23_old ; [L40] char p23_new ; [L41] _Bool ep23 ; [L42] port_t p31 ; [L43] char p31_old ; [L44] char p31_new ; [L45] _Bool ep31 ; [L46] port_t p32 ; [L47] char p32_old ; [L48] char p32_new ; [L49] _Bool ep32 ; [L50] char id1 ; [L51] unsigned char r1 ; [L52] char st1 ; [L53] char nl1 ; [L54] char m1 ; [L55] char max1 ; [L56] _Bool mode1 ; [L57] char id2 ; [L58] unsigned char r2 ; [L59] char st2 ; [L60] char nl2 ; [L61] char m2 ; [L62] char max2 ; [L63] _Bool mode2 ; [L64] char id3 ; [L65] unsigned char r3 ; [L66] char st3 ; [L67] char nl3 ; [L68] char m3 ; [L69] char max3 ; [L70] _Bool mode3 ; [L486] int c1 ; [L487] int i2 ; [L490] c1 = 0 [L491] ep12 = __VERIFIER_nondet_bool() [L492] ep13 = __VERIFIER_nondet_bool() [L493] ep21 = __VERIFIER_nondet_bool() [L494] ep23 = __VERIFIER_nondet_bool() [L495] ep31 = __VERIFIER_nondet_bool() [L496] ep32 = __VERIFIER_nondet_bool() [L497] id1 = __VERIFIER_nondet_char() [L498] r1 = __VERIFIER_nondet_uchar() [L499] st1 = __VERIFIER_nondet_char() [L500] nl1 = __VERIFIER_nondet_char() [L501] m1 = __VERIFIER_nondet_char() [L502] max1 = __VERIFIER_nondet_char() [L503] mode1 = __VERIFIER_nondet_bool() [L504] id2 = __VERIFIER_nondet_char() [L505] r2 = __VERIFIER_nondet_uchar() [L506] st2 = __VERIFIER_nondet_char() [L507] nl2 = __VERIFIER_nondet_char() [L508] m2 = __VERIFIER_nondet_char() [L509] max2 = __VERIFIER_nondet_char() [L510] mode2 = __VERIFIER_nondet_bool() [L511] id3 = __VERIFIER_nondet_char() [L512] r3 = __VERIFIER_nondet_uchar() [L513] st3 = __VERIFIER_nondet_char() [L514] nl3 = __VERIFIER_nondet_char() [L515] m3 = __VERIFIER_nondet_char() [L516] max3 = __VERIFIER_nondet_char() [L517] mode3 = __VERIFIER_nondet_bool() [L211] _Bool r121 ; [L212] _Bool r131 ; [L213] _Bool r211 ; [L214] _Bool r231 ; [L215] _Bool r311 ; [L216] _Bool r321 ; [L217] _Bool r122 ; [L218] int tmp ; [L219] _Bool r132 ; [L220] int tmp___0 ; [L221] _Bool r212 ; [L222] int tmp___1 ; [L223] _Bool r232 ; [L224] int tmp___2 ; [L225] _Bool r312 ; [L226] int tmp___3 ; [L227] _Bool r322 ; [L228] int tmp___4 ; [L229] int tmp___5 ; [L232] r121 = ep12 [L233] r131 = ep13 [L234] r211 = ep21 [L235] r231 = ep23 [L236] r311 = ep31 [L237] r321 = ep32 [L238] COND FALSE !(\read(r121)) [L241] COND TRUE \read(r131) [L242] COND TRUE \read(ep32) [L243] tmp = 1 [L250] r122 = (_Bool )tmp [L251] COND TRUE \read(r131) [L252] tmp___0 = 1 [L263] r132 = (_Bool )tmp___0 [L264] COND FALSE !(\read(r211)) [L267] COND TRUE \read(r231) [L268] COND TRUE \read(ep31) [L269] tmp___1 = 1 [L276] r212 = (_Bool )tmp___1 [L277] COND TRUE \read(r231) [L278] tmp___2 = 1 [L289] r232 = (_Bool )tmp___2 [L290] COND TRUE \read(r311) [L291] tmp___3 = 1 [L302] r312 = (_Bool )tmp___3 [L303] COND TRUE \read(r321) [L304] tmp___4 = 1 [L315] r322 = (_Bool )tmp___4 [L316] COND TRUE (int )id1 != (int )id2 [L317] COND TRUE (int )id1 != (int )id3 [L318] COND TRUE (int )id2 != (int )id3 [L319] COND TRUE (int )id1 >= 0 [L320] COND TRUE (int )id2 >= 0 [L321] COND TRUE (int )id3 >= 0 [L322] COND TRUE (int )r1 == 0 [L323] COND TRUE (int )r2 == 0 [L324] COND TRUE (int )r3 == 0 [L325] COND TRUE \read(r122) [L326] COND TRUE \read(r132) [L327] COND TRUE \read(r212) [L328] COND TRUE \read(r232) [L329] COND TRUE \read(r312) [L330] COND TRUE \read(r322) [L331] COND TRUE (int )max1 == (int )id1 [L332] COND TRUE (int )max2 == (int )id2 [L333] COND TRUE (int )max3 == (int )id3 [L334] COND TRUE (int )st1 == 0 [L335] COND TRUE (int )st2 == 0 [L336] COND TRUE (int )st3 == 0 [L337] COND TRUE (int )nl1 == 0 [L338] COND TRUE (int )nl2 == 0 [L339] COND TRUE (int )nl3 == 0 [L340] COND TRUE (int )mode1 == 0 [L341] COND TRUE (int )mode2 == 0 [L342] COND TRUE (int )mode3 == 0 [L343] tmp___5 = 1 [L425] return (tmp___5); [L518] i2 = init() [L519] COND FALSE !(!i2) [L522] p12_old = nomsg [L523] p12_new = nomsg [L524] p13_old = nomsg [L525] p13_new = nomsg [L526] p21_old = nomsg [L527] p21_new = nomsg [L528] p23_old = nomsg [L529] p23_new = nomsg [L530] p31_old = nomsg [L531] p31_new = nomsg [L532] p32_old = nomsg [L533] p32_new = nomsg [L534] i2 = 0 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, 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] [L535] COND TRUE 1 [L76] COND FALSE !(\read(mode1)) [L104] COND TRUE (int )r1 < 2 [L105] COND FALSE !(\read(ep12)) [L108] COND TRUE \read(ep13) [L109] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L109] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L112] mode1 = (_Bool)1 [L122] COND FALSE !(\read(mode2)) [L150] COND TRUE (int )r2 < 2 [L151] COND FALSE !(\read(ep21)) [L154] COND TRUE \read(ep23) [L155] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L155] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L158] mode2 = (_Bool)1 [L168] COND FALSE !(\read(mode3)) [L196] COND TRUE (int )r3 < 2 [L197] COND TRUE \read(ep31) [L198] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L198] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L200] COND TRUE \read(ep32) [L201] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L201] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L204] mode3 = (_Bool)1 [L540] p12_old = p12_new [L541] p12_new = nomsg [L542] p13_old = p13_new [L543] p13_new = nomsg [L544] p21_old = p21_new [L545] p21_new = nomsg [L546] p23_old = p23_new [L547] p23_new = nomsg [L548] p31_old = p31_new [L549] p31_new = nomsg [L550] p32_old = p32_new [L551] p32_new = nomsg [L430] int tmp ; VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L433] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L434] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L435] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND TRUE (int )r1 < 2 [L453] tmp = 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L481] return (tmp); [L552] c1 = check() [L564] COND FALSE !(! arg) VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=-2, m2=0, m3=-1, max1=126, max2=0, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L535] COND TRUE 1 [L76] COND TRUE \read(mode1) [L77] COND FALSE !(r1 == 255) [L80] r1 = r1 + 1 [L81] COND FALSE !(\read(ep21)) [L88] COND TRUE \read(ep31) [L89] m1 = p31_old [L90] p31_old = nomsg [L91] COND FALSE !((int )m1 > (int )max1) [L95] COND TRUE (int )r1 == 1 [L96] COND TRUE (int )max1 == (int )id1 [L97] st1 = (char)1 [L102] mode1 = (_Bool)0 [L122] COND TRUE \read(mode2) [L123] COND FALSE !(r2 == 255) [L126] r2 = r2 + 1 [L127] COND FALSE !(\read(ep12)) [L134] COND TRUE \read(ep32) [L135] m2 = p32_old [L136] p32_old = nomsg [L137] COND TRUE (int )m2 > (int )max2 [L138] max2 = m2 [L141] COND FALSE !((int )r2 == 2) [L148] mode2 = (_Bool)0 [L168] COND TRUE \read(mode3) [L169] COND FALSE !(r3 == 255) [L172] r3 = r3 + 1 [L173] COND TRUE \read(ep13) [L174] m3 = p13_old [L175] p13_old = nomsg [L176] COND TRUE (int )m3 > (int )max3 [L177] max3 = m3 [L180] COND TRUE \read(ep23) [L181] m3 = p23_old [L182] p23_old = nomsg [L183] COND FALSE !((int )m3 > (int )max3) [L187] COND FALSE !((int )r3 == 2) [L194] mode3 = (_Bool)0 [L540] p12_old = p12_new [L541] p12_new = nomsg [L542] p13_old = p13_new [L543] p13_new = nomsg [L544] p21_old = p21_new [L545] p21_new = nomsg [L546] p23_old = p23_new [L547] p23_new = nomsg [L548] p31_old = p31_new [L549] p31_new = nomsg [L550] p32_old = p32_new [L551] p32_new = nomsg [L430] int tmp ; VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=125, m2=125, m3=0, max1=126, max2=125, 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] [L433] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=125, m2=125, m3=0, max1=126, max2=125, 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] [L434] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=125, m2=125, m3=0, max1=126, max2=125, 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] [L435] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=125, m2=125, m3=0, max1=126, max2=125, 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] [L436] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=125, m2=125, m3=0, max1=126, max2=125, 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] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=125, m2=125, m3=0, max1=126, max2=125, 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] [L440] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L467] tmp = 0 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=125, m2=125, m3=0, max1=126, max2=125, 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] [L481] return (tmp); [L552] c1 = check() [L564] COND TRUE ! arg VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=125, m2=125, m3=0, max1=126, max2=125, 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.UNBOUNDED.pals.c", 3, "reach_error") VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=126, id2=0, id3=125, m1=125, m2=125, m3=0, max1=126, max2=125, 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.34 ms. Allocated memory is still 81.8 MB. Free memory was 62.8 MB in the beginning and 62.7 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 677.22 ms. Allocated memory is still 81.8 MB. Free memory was 45.5 MB in the beginning and 53.9 MB in the end (delta: -8.4 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 109.45 ms. Allocated memory is still 81.8 MB. Free memory was 53.9 MB in the beginning and 51.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 92.99 ms. Allocated memory is still 81.8 MB. Free memory was 51.0 MB in the beginning and 48.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3891.38 ms. Allocated memory was 81.8 MB in the beginning and 130.0 MB in the end (delta: 48.2 MB). Free memory was 48.8 MB in the beginning and 81.1 MB in the end (delta: -32.4 MB). Peak memory consumption was 59.2 MB. Max. memory is 16.1 GB. * CodeCheck took 80910.77 ms. Allocated memory was 130.0 MB in the beginning and 465.6 MB in the end (delta: 335.5 MB). Free memory was 81.1 MB in the beginning and 348.5 MB in the end (delta: -267.4 MB). Peak memory consumption was 67.1 MB. Max. memory is 16.1 GB. * Witness Printer took 231.76 ms. Allocated memory is still 465.6 MB. Free memory was 348.5 MB in the beginning and 335.9 MB in the end (delta: 12.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...