./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/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_13133a2e-d253-4ec0-b256-2e7e35e3a960/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/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-a4ecdab [2020-11-29 21:35:56,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 21:35:56,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 21:35:56,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 21:35:56,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 21:35:56,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 21:35:57,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 21:35:57,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 21:35:57,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 21:35:57,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 21:35:57,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 21:35:57,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 21:35:57,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 21:35:57,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 21:35:57,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 21:35:57,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 21:35:57,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 21:35:57,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 21:35:57,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 21:35:57,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 21:35:57,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 21:35:57,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 21:35:57,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 21:35:57,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 21:35:57,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 21:35:57,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 21:35:57,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 21:35:57,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 21:35:57,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 21:35:57,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 21:35:57,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 21:35:57,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 21:35:57,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 21:35:57,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 21:35:57,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 21:35:57,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 21:35:57,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 21:35:57,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 21:35:57,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 21:35:57,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 21:35:57,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 21:35:57,082 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-11-29 21:35:57,127 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 21:35:57,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 21:35:57,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-29 21:35:57,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-11-29 21:35:57,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 21:35:57,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 21:35:57,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 21:35:57,130 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 21:35:57,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 21:35:57,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 21:35:57,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 21:35:57,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 21:35:57,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 21:35:57,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 21:35:57,133 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 21:35:57,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 21:35:57,134 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 21:35:57,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 21:35:57,134 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-11-29 21:35:57,134 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-11-29 21:35:57,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 21:35:57,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 21:35:57,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-11-29 21:35:57,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 21:35:57,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 21:35:57,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 21:35:57,136 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-11-29 21:35:57,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 21:35:57,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 21:35:57,138 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_13133a2e-d253-4ec0-b256-2e7e35e3a960/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_13133a2e-d253-4ec0-b256-2e7e35e3a960/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-11-29 21:35:57,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 21:35:57,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 21:35:57,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 21:35:57,466 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 21:35:57,467 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 21:35:57,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c [2020-11-29 21:35:57,550 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/bin/ukojak/data/c33441ad6/fd0b701d4a1543d3a244d9875e1138c8/FLAG32e1c0440 [2020-11-29 21:35:58,052 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 21:35:58,052 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c [2020-11-29 21:35:58,074 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/bin/ukojak/data/c33441ad6/fd0b701d4a1543d3a244d9875e1138c8/FLAG32e1c0440 [2020-11-29 21:35:58,546 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/bin/ukojak/data/c33441ad6/fd0b701d4a1543d3a244d9875e1138c8 [2020-11-29 21:35:58,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 21:35:58,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 21:35:58,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 21:35:58,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 21:35:58,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 21:35:58,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:35:58" (1/1) ... [2020-11-29 21:35:58,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a668f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:35:58, skipping insertion in model container [2020-11-29 21:35:58,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:35:58" (1/1) ... [2020-11-29 21:35:58,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 21:35:58,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 21:35:58,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 21:35:58,887 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 21:35:58,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 21:35:59,009 INFO L208 MainTranslator]: Completed translation [2020-11-29 21:35:59,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:35:59 WrapperNode [2020-11-29 21:35:59,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 21:35:59,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 21:35:59,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 21:35:59,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 21:35:59,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:35:59" (1/1) ... [2020-11-29 21:35:59,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:35:59" (1/1) ... [2020-11-29 21:35:59,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 21:35:59,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 21:35:59,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 21:35:59,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 21:35:59,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:35:59" (1/1) ... [2020-11-29 21:35:59,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:35:59" (1/1) ... [2020-11-29 21:35:59,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:35:59" (1/1) ... [2020-11-29 21:35:59,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:35:59" (1/1) ... [2020-11-29 21:35:59,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:35:59" (1/1) ... [2020-11-29 21:35:59,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:35:59" (1/1) ... [2020-11-29 21:35:59,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:35:59" (1/1) ... [2020-11-29 21:35:59,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 21:35:59,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 21:35:59,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 21:35:59,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 21:35:59,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:35:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/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-29 21:35:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 21:35:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 21:35:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 21:35:59,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 21:36:02,378 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 21:36:02,378 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-11-29 21:36:02,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:36:02 BoogieIcfgContainer [2020-11-29 21:36:02,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 21:36:02,382 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-11-29 21:36:02,382 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-11-29 21:36:02,392 INFO L275 PluginConnector]: CodeCheck initialized [2020-11-29 21:36:02,393 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:36:02" (1/1) ... [2020-11-29 21:36:02,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:36:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2020-11-29 21:36:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-11-29 21:36:02,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-29 21:36:02,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:02,997 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-29 21:36:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2020-11-29 21:36:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-11-29 21:36:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 21:36:03,121 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:03,388 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-29 21:36:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2020-11-29 21:36:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2020-11-29 21:36:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-29 21:36:03,745 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:03,891 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-29 21:36:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2020-11-29 21:36:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2020-11-29 21:36:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-29 21:36:04,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:04,646 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-29 21:36:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2020-11-29 21:36:05,473 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2020-11-29 21:36:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 21:36:05,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:05,746 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-29 21:36:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2020-11-29 21:36:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2020-11-29 21:36:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 21:36:06,830 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:07,246 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-29 21:36:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2020-11-29 21:36:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2020-11-29 21:36:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 21:36:08,483 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:08,607 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-29 21:36:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2020-11-29 21:36:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2020-11-29 21:36:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 21:36:08,931 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:08,998 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-29 21:36:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2020-11-29 21:36:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2020-11-29 21:36:09,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 21:36:09,018 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:09,441 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-29 21:36:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2020-11-29 21:36:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2020-11-29 21:36:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 21:36:11,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:12,113 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-29 21:36:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2020-11-29 21:36:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2020-11-29 21:36:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-29 21:36:12,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:13,651 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-29 21:36:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 74 states and 138 transitions. [2020-11-29 21:36:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 138 transitions. [2020-11-29 21:36:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 21:36:19,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:19,970 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-29 21:36:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 90 states and 172 transitions. [2020-11-29 21:36:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 172 transitions. [2020-11-29 21:36:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 21:36:27,624 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:27,948 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-29 21:36:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 91 states and 173 transitions. [2020-11-29 21:36:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 173 transitions. [2020-11-29 21:36:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 21:36:28,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:29,086 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-29 21:36:29,246 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-11-29 21:36:29,618 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2020-11-29 21:36:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 108 states and 208 transitions. [2020-11-29 21:36:38,596 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 208 transitions. [2020-11-29 21:36:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 21:36:38,597 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:38,707 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-29 21:36:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 109 states and 211 transitions. [2020-11-29 21:36:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 211 transitions. [2020-11-29 21:36:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 21:36:39,558 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:39,705 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-29 21:36:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 110 states and 212 transitions. [2020-11-29 21:36:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 212 transitions. [2020-11-29 21:36:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 21:36:40,323 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:40,414 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-29 21:36:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 111 states and 216 transitions. [2020-11-29 21:36:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 216 transitions. [2020-11-29 21:36:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 21:36:41,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:42,434 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-29 21:36:43,243 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-11-29 21:36:43,968 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-11-29 21:36:44,918 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2020-11-29 21:36:46,026 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-11-29 21:36:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 124 states and 242 transitions. [2020-11-29 21:36:53,132 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 242 transitions. [2020-11-29 21:36:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 21:36:53,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:53,568 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-29 21:36:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 125 states and 244 transitions. [2020-11-29 21:36:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 244 transitions. [2020-11-29 21:36:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 21:36:54,351 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:54,818 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-29 21:36:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 126 states and 245 transitions. [2020-11-29 21:36:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 245 transitions. [2020-11-29 21:36:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 21:36:55,784 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:56,259 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-29 21:36:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 127 states and 246 transitions. [2020-11-29 21:36:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 246 transitions. [2020-11-29 21:36:57,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 21:36:57,167 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:36:57,615 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-29 21:36:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 21:36:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 128 states and 251 transitions. [2020-11-29 21:36:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 251 transitions. [2020-11-29 21:36:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-29 21:36:58,594 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 21:36:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:36:58,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:36:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:36:59,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:36:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:36:59,457 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:36:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:36:59,658 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:36:59,767 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 23 iterations. [2020-11-29 21:36:59,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.11 09:36:59 ImpRootNode [2020-11-29 21:36:59,906 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-11-29 21:36:59,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 21:36:59,907 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 21:36:59,907 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 21:36:59,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:36:02" (3/4) ... [2020-11-29 21:36:59,909 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 21:37:00,164 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_13133a2e-d253-4ec0-b256-2e7e35e3a960/bin/ukojak/witness.graphml [2020-11-29 21:37:00,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 21:37:00,165 INFO L168 Benchmark]: Toolchain (without parser) took 61614.78 ms. Allocated memory was 109.1 MB in the beginning and 488.6 MB in the end (delta: 379.6 MB). Free memory was 72.0 MB in the beginning and 272.7 MB in the end (delta: -200.7 MB). Peak memory consumption was 179.8 MB. Max. memory is 16.1 GB. [2020-11-29 21:37:00,165 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 109.1 MB. Free memory is still 89.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 21:37:00,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.76 ms. Allocated memory is still 109.1 MB. Free memory was 71.8 MB in the beginning and 79.8 MB in the end (delta: -8.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 21:37:00,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.56 ms. Allocated memory is still 109.1 MB. Free memory was 79.8 MB in the beginning and 76.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 21:37:00,166 INFO L168 Benchmark]: Boogie Preprocessor took 45.33 ms. Allocated memory is still 109.1 MB. Free memory was 76.8 MB in the beginning and 74.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 21:37:00,167 INFO L168 Benchmark]: RCFGBuilder took 3241.89 ms. Allocated memory was 109.1 MB in the beginning and 138.4 MB in the end (delta: 29.4 MB). Free memory was 74.5 MB in the beginning and 44.7 MB in the end (delta: 29.8 MB). Peak memory consumption was 73.5 MB. Max. memory is 16.1 GB. [2020-11-29 21:37:00,176 INFO L168 Benchmark]: CodeCheck took 57524.42 ms. Allocated memory was 138.4 MB in the beginning and 488.6 MB in the end (delta: 350.2 MB). Free memory was 43.6 MB in the beginning and 286.3 MB in the end (delta: -242.7 MB). Peak memory consumption was 106.4 MB. Max. memory is 16.1 GB. [2020-11-29 21:37:00,176 INFO L168 Benchmark]: Witness Printer took 257.51 ms. Allocated memory is still 488.6 MB. Free memory was 285.3 MB in the beginning and 272.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 21:37:00,178 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: 57.3s, OverallIterations: 23, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22446080 SDtfs, 16200740 SDslu, 12976128 SDs, 0 SdLazy, 105368306 SolverSat, 23442146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3904 GetRequests, 3373 SyntacticMatches, 151 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81738 ImplicationChecksByTransitivity, 48.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 42177 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 24/73 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 TRUE \read(r121) [L239] tmp = 1 [L250] r122 = (_Bool )tmp [L251] COND FALSE !(\read(r131)) [L254] COND TRUE \read(r121) [L255] COND TRUE \read(ep23) [L256] 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 FALSE !(\read(r321)) [L306] COND TRUE \read(r311) [L307] COND TRUE \read(ep12) [L308] 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=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, 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 TRUE \read(ep12) [L106] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L106] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L108] COND FALSE !(\read(ep13)) [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 FALSE !(\read(ep32)) [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=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L433] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L434] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L435] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L436] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L440] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L442] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L447] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L450] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L452] COND TRUE (int )r1 < 2 [L453] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L481] return (tmp); [L552] c1 = check() [L564] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=0, m2=3, m3=2, max1=4, max2=3, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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 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 TRUE \read(ep12) [L128] m2 = p12_old [L129] p12_old = nomsg [L130] COND TRUE (int )m2 > (int )max2 [L131] max2 = m2 [L134] COND FALSE !(\read(ep32)) [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 FALSE !(\read(ep13)) [L180] COND TRUE \read(ep23) [L181] m3 = p23_old [L182] p23_old = nomsg [L183] COND TRUE (int )m3 > (int )max3 [L184] max3 = m3 [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=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=1, m2=4, m3=3, max1=4, max2=4, max3=3, 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=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=1, m2=4, m3=3, max1=4, max2=4, max3=3, 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=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=1, m2=4, m3=3, max1=4, max2=4, max3=3, 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=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=1, m2=4, m3=3, max1=4, max2=4, max3=3, 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=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=1, m2=4, m3=3, max1=4, max2=4, max3=3, 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=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=1, m2=4, m3=3, max1=4, max2=4, max3=3, 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=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=1, m2=4, m3=3, max1=4, max2=4, max3=3, 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=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=1, m2=4, m3=3, max1=4, max2=4, max3=3, 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=1, ep13=0, ep21=0, ep23=1, ep31=255, ep32=0, id1=4, id2=3, id3=1, m1=1, m2=4, m3=3, max1=4, max2=4, max3=3, 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.22 ms. Allocated memory is still 109.1 MB. Free memory is still 89.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 456.76 ms. Allocated memory is still 109.1 MB. Free memory was 71.8 MB in the beginning and 79.8 MB in the end (delta: -8.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.56 ms. Allocated memory is still 109.1 MB. Free memory was 79.8 MB in the beginning and 76.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.33 ms. Allocated memory is still 109.1 MB. Free memory was 76.8 MB in the beginning and 74.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3241.89 ms. Allocated memory was 109.1 MB in the beginning and 138.4 MB in the end (delta: 29.4 MB). Free memory was 74.5 MB in the beginning and 44.7 MB in the end (delta: 29.8 MB). Peak memory consumption was 73.5 MB. Max. memory is 16.1 GB. * CodeCheck took 57524.42 ms. Allocated memory was 138.4 MB in the beginning and 488.6 MB in the end (delta: 350.2 MB). Free memory was 43.6 MB in the beginning and 286.3 MB in the end (delta: -242.7 MB). Peak memory consumption was 106.4 MB. Max. memory is 16.1 GB. * Witness Printer took 257.51 ms. Allocated memory is still 488.6 MB. Free memory was 285.3 MB in the beginning and 272.7 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...