./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dde90af2328c679905dbf72b0c2b57892228e614 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:06:10,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:06:10,877 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:06:10,885 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:06:10,885 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:06:10,886 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:06:10,887 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:06:10,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:06:10,889 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:06:10,890 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:06:10,890 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:06:10,890 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:06:10,891 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:06:10,892 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:06:10,892 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:06:10,893 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:06:10,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:06:10,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:06:10,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:06:10,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:06:10,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:06:10,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:06:10,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:06:10,899 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:06:10,899 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:06:10,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:06:10,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:06:10,901 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:06:10,902 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:06:10,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:06:10,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:06:10,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:06:10,903 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:06:10,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:06:10,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:06:10,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:06:10,905 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 12:06:10,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:06:10,914 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:06:10,915 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:06:10,915 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:06:10,915 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:06:10,915 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:06:10,915 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:06:10,916 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:06:10,916 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:06:10,916 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:06:10,916 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:06:10,916 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:06:10,916 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:06:10,916 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:06:10,917 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:06:10,917 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:06:10,917 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:06:10,917 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 12:06:10,917 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 12:06:10,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:06:10,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:06:10,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 12:06:10,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:06:10,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:06:10,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:06:10,918 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 12:06:10,918 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:06:10,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:06:10,919 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dde90af2328c679905dbf72b0c2b57892228e614 [2018-11-10 12:06:10,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:06:10,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:06:10,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:06:10,950 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:06:10,950 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:06:10,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c [2018-11-10 12:06:10,983 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak/data/3d9e57f4c/862f5bfde6d343668ab6dadbf86a20bb/FLAG94d746c5e [2018-11-10 12:06:11,293 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:06:11,294 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c [2018-11-10 12:06:11,299 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak/data/3d9e57f4c/862f5bfde6d343668ab6dadbf86a20bb/FLAG94d746c5e [2018-11-10 12:06:11,307 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak/data/3d9e57f4c/862f5bfde6d343668ab6dadbf86a20bb [2018-11-10 12:06:11,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:06:11,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:06:11,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:06:11,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:06:11,313 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:06:11,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:06:11" (1/1) ... [2018-11-10 12:06:11,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23291eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:11, skipping insertion in model container [2018-11-10 12:06:11,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:06:11" (1/1) ... [2018-11-10 12:06:11,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:06:11,347 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:06:11,495 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:06:11,501 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:06:11,544 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:06:11,556 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:06:11,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:11 WrapperNode [2018-11-10 12:06:11,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:06:11,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:06:11,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:06:11,557 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:06:11,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:11" (1/1) ... [2018-11-10 12:06:11,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:11" (1/1) ... [2018-11-10 12:06:11,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:06:11,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:06:11,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:06:11,632 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:06:11,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:11" (1/1) ... [2018-11-10 12:06:11,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:11" (1/1) ... [2018-11-10 12:06:11,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:11" (1/1) ... [2018-11-10 12:06:11,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:11" (1/1) ... [2018-11-10 12:06:11,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:11" (1/1) ... [2018-11-10 12:06:11,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:11" (1/1) ... [2018-11-10 12:06:11,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:11" (1/1) ... [2018-11-10 12:06:11,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:06:11,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:06:11,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:06:11,660 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:06:11,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 12:06:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:06:11,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:06:13,270 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:06:13,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:06:13 BoogieIcfgContainer [2018-11-10 12:06:13,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:06:13,272 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 12:06:13,272 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 12:06:13,278 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 12:06:13,278 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:06:13" (1/1) ... [2018-11-10 12:06:13,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:06:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-10 12:06:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-10 12:06:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 12:06:13,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-10 12:06:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-10 12:06:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 12:06:13,641 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 26 states and 41 transitions. [2018-11-10 12:06:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2018-11-10 12:06:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 12:06:13,917 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 31 states and 50 transitions. [2018-11-10 12:06:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-11-10 12:06:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 12:06:14,289 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 37 states and 61 transitions. [2018-11-10 12:06:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2018-11-10 12:06:14,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 12:06:14,798 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 74 transitions. [2018-11-10 12:06:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2018-11-10 12:06:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 12:06:15,567 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2018-11-10 12:06:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-11-10 12:06:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 12:06:16,378 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 53 states and 86 transitions. [2018-11-10 12:06:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2018-11-10 12:06:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 12:06:16,595 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 54 states and 87 transitions. [2018-11-10 12:06:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 87 transitions. [2018-11-10 12:06:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 12:06:16,657 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 65 states and 104 transitions. [2018-11-10 12:06:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2018-11-10 12:06:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 12:06:18,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 68 states and 109 transitions. [2018-11-10 12:06:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 109 transitions. [2018-11-10 12:06:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:06:18,379 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 86 states and 140 transitions. [2018-11-10 12:06:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 140 transitions. [2018-11-10 12:06:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:06:21,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 105 states and 174 transitions. [2018-11-10 12:06:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 174 transitions. [2018-11-10 12:06:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:06:25,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 106 states and 175 transitions. [2018-11-10 12:06:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 175 transitions. [2018-11-10 12:06:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:06:26,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 126 states and 210 transitions. [2018-11-10 12:06:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 210 transitions. [2018-11-10 12:06:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:06:30,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 127 states and 213 transitions. [2018-11-10 12:06:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 213 transitions. [2018-11-10 12:06:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:06:30,917 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:31,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 128 states and 214 transitions. [2018-11-10 12:06:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 214 transitions. [2018-11-10 12:06:31,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:06:31,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:34,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 143 states and 243 transitions. [2018-11-10 12:06:34,803 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 243 transitions. [2018-11-10 12:06:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:06:34,804 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 145 states and 245 transitions. [2018-11-10 12:06:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 245 transitions. [2018-11-10 12:06:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:06:35,458 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 146 states and 250 transitions. [2018-11-10 12:06:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 250 transitions. [2018-11-10 12:06:35,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:06:35,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 147 states and 251 transitions. [2018-11-10 12:06:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 251 transitions. [2018-11-10 12:06:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:06:36,367 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 156 states and 273 transitions. [2018-11-10 12:06:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 273 transitions. [2018-11-10 12:06:41,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:06:41,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 158 states and 280 transitions. [2018-11-10 12:06:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 280 transitions. [2018-11-10 12:06:42,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:06:42,390 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 160 states and 285 transitions. [2018-11-10 12:06:43,557 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 285 transitions. [2018-11-10 12:06:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:06:43,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 161 states and 286 transitions. [2018-11-10 12:06:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions. [2018-11-10 12:06:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:06:44,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 162 states and 287 transitions. [2018-11-10 12:06:44,907 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 287 transitions. [2018-11-10 12:06:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:06:44,907 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 163 states and 288 transitions. [2018-11-10 12:06:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 288 transitions. [2018-11-10 12:06:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:06:45,621 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 164 states and 289 transitions. [2018-11-10 12:06:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 289 transitions. [2018-11-10 12:06:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 12:06:46,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 179 states and 313 transitions. [2018-11-10 12:06:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 313 transitions. [2018-11-10 12:06:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:06:50,498 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:06:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 188 states and 330 transitions. [2018-11-10 12:06:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 330 transitions. [2018-11-10 12:06:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 12:06:55,412 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:06:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 203 states and 378 transitions. [2018-11-10 12:07:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 378 transitions. [2018-11-10 12:07:02,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 12:07:02,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 218 states and 414 transitions. [2018-11-10 12:07:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 414 transitions. [2018-11-10 12:07:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 12:07:08,692 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 230 states and 438 transitions. [2018-11-10 12:07:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 438 transitions. [2018-11-10 12:07:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 12:07:14,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 232 states and 443 transitions. [2018-11-10 12:07:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 443 transitions. [2018-11-10 12:07:15,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 12:07:15,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 243 states and 467 transitions. [2018-11-10 12:07:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 467 transitions. [2018-11-10 12:07:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 12:07:20,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 245 states and 471 transitions. [2018-11-10 12:07:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 471 transitions. [2018-11-10 12:07:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 12:07:21,606 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 248 states and 481 transitions. [2018-11-10 12:07:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 481 transitions. [2018-11-10 12:07:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 12:07:22,693 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 254 states and 500 transitions. [2018-11-10 12:07:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 500 transitions. [2018-11-10 12:07:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 12:07:28,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 257 states and 511 transitions. [2018-11-10 12:07:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 511 transitions. [2018-11-10 12:07:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 12:07:29,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 259 states and 514 transitions. [2018-11-10 12:07:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 514 transitions. [2018-11-10 12:07:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 12:07:30,376 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 272 states and 543 transitions. [2018-11-10 12:07:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 543 transitions. [2018-11-10 12:07:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 12:07:37,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 278 states and 568 transitions. [2018-11-10 12:07:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 568 transitions. [2018-11-10 12:07:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 12:07:40,419 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 282 states and 586 transitions. [2018-11-10 12:07:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 586 transitions. [2018-11-10 12:07:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 12:07:42,336 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 283 states and 594 transitions. [2018-11-10 12:07:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 594 transitions. [2018-11-10 12:07:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 12:07:43,430 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 287 states and 605 transitions. [2018-11-10 12:07:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 605 transitions. [2018-11-10 12:07:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:07:45,406 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 289 states and 612 transitions. [2018-11-10 12:07:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 612 transitions. [2018-11-10 12:07:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:07:49,463 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 291 states and 615 transitions. [2018-11-10 12:07:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 615 transitions. [2018-11-10 12:07:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:07:50,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 296 states and 629 transitions. [2018-11-10 12:07:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 629 transitions. [2018-11-10 12:07:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:07:52,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 297 states and 630 transitions. [2018-11-10 12:07:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 630 transitions. [2018-11-10 12:07:53,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:07:53,469 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 302 states and 643 transitions. [2018-11-10 12:07:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 643 transitions. [2018-11-10 12:07:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:07:55,660 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:07:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:07:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:07:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 306 states and 655 transitions. [2018-11-10 12:07:57,230 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 655 transitions. [2018-11-10 12:07:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 12:07:57,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:07:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:07:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:08:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:08:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:08:00,762 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 51 iterations. [2018-11-10 12:08:00,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 12:08:00 ImpRootNode [2018-11-10 12:08:00,850 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 12:08:00,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:08:00,851 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:08:00,851 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:08:00,852 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:06:13" (3/4) ... [2018-11-10 12:08:00,854 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:08:00,961 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_34151cd4-2fa9-4040-95ac-ba2e96018827/bin-2019/ukojak/witness.graphml [2018-11-10 12:08:00,961 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:08:00,962 INFO L168 Benchmark]: Toolchain (without parser) took 109652.03 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 957.5 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 192.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:08:00,963 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:08:00,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.66 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:08:00,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 936.0 MB in the beginning and 1.2 GB in the end (delta: -214.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:08:00,964 INFO L168 Benchmark]: Boogie Preprocessor took 27.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:08:00,964 INFO L168 Benchmark]: RCFGBuilder took 1611.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.8 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -76.8 MB). Peak memory consumption was 330.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:08:00,964 INFO L168 Benchmark]: CodeCheck took 107578.62 ms. Allocated memory was 1.3 GB in the beginning and 2.4 GB in the end (delta: 1.1 GB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -936.6 MB). Peak memory consumption was 192.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:08:00,964 INFO L168 Benchmark]: Witness Printer took 110.79 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:08:00,966 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 136 locations, 1 error locations. UNSAFE Result, 107.4s OverallTime, 51 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -619684804 SDslu, 207852912 SDs, 0 SdLazy, 1169994432 SolverSat, 1154492748 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 69.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14664 GetRequests, 12836 SyntacticMatches, 874 SemanticMatches, 954 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593281 ImplicationChecksByTransitivity, 96.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 1542 NumberOfCodeBlocks, 1542 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 1440 ConstructedInterpolants, 0 QuantifiedInterpolants, 634168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 10 PerfectInterpolantSequences, 173/892 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 610]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] char id2 ; [L103] unsigned char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] char id3 ; [L110] unsigned char r3 ; [L111] char st3 ; [L112] char nl3 ; [L113] char m3 ; [L114] char max3 ; [L115] _Bool mode3 ; [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L75] port_t p13 ; [L79] port_t p21 ; [L83] port_t p23 ; [L87] port_t p31 ; [L91] port_t p32 ; [L254] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L532] int c1 ; [L533] int i2 ; [L536] c1 = 0 [L537] ep12 = __VERIFIER_nondet_bool() [L538] ep13 = __VERIFIER_nondet_bool() [L539] ep21 = __VERIFIER_nondet_bool() [L540] ep23 = __VERIFIER_nondet_bool() [L541] ep31 = __VERIFIER_nondet_bool() [L542] ep32 = __VERIFIER_nondet_bool() [L543] id1 = __VERIFIER_nondet_char() [L544] r1 = __VERIFIER_nondet_uchar() [L545] st1 = __VERIFIER_nondet_char() [L546] nl1 = __VERIFIER_nondet_char() [L547] m1 = __VERIFIER_nondet_char() [L548] max1 = __VERIFIER_nondet_char() [L549] mode1 = __VERIFIER_nondet_bool() [L550] id2 = __VERIFIER_nondet_char() [L551] r2 = __VERIFIER_nondet_uchar() [L552] st2 = __VERIFIER_nondet_char() [L553] nl2 = __VERIFIER_nondet_char() [L554] m2 = __VERIFIER_nondet_char() [L555] max2 = __VERIFIER_nondet_char() [L556] mode2 = __VERIFIER_nondet_bool() [L557] id3 = __VERIFIER_nondet_char() [L558] r3 = __VERIFIER_nondet_uchar() [L559] st3 = __VERIFIER_nondet_char() [L560] nl3 = __VERIFIER_nondet_char() [L561] m3 = __VERIFIER_nondet_char() [L562] max3 = __VERIFIER_nondet_char() [L563] mode3 = __VERIFIER_nondet_bool() [L564] CALL, EXPR init() [L257] _Bool r121 ; [L258] _Bool r131 ; [L259] _Bool r211 ; [L260] _Bool r231 ; [L261] _Bool r311 ; [L262] _Bool r321 ; [L263] _Bool r122 ; [L264] int tmp ; [L265] _Bool r132 ; [L266] int tmp___0 ; [L267] _Bool r212 ; [L268] int tmp___1 ; [L269] _Bool r232 ; [L270] int tmp___2 ; [L271] _Bool r312 ; [L272] int tmp___3 ; [L273] _Bool r322 ; [L274] int tmp___4 ; [L275] int tmp___5 ; [L278] r121 = ep12 [L279] r131 = ep13 [L280] r211 = ep21 [L281] r231 = ep23 [L282] r311 = ep31 [L283] r321 = ep32 [L284] COND TRUE \read(r121) [L285] tmp = 1 [L296] r122 = (_Bool )tmp [L297] COND FALSE !(\read(r131)) [L300] COND TRUE \read(r121) [L301] COND TRUE \read(ep23) [L302] tmp___0 = 1 [L309] r132 = (_Bool )tmp___0 [L310] COND FALSE !(\read(r211)) [L313] COND TRUE \read(r231) [L314] COND TRUE \read(ep31) [L315] tmp___1 = 1 [L322] r212 = (_Bool )tmp___1 [L323] COND TRUE \read(r231) [L324] tmp___2 = 1 [L335] r232 = (_Bool )tmp___2 [L336] COND TRUE \read(r311) [L337] tmp___3 = 1 [L348] r312 = (_Bool )tmp___3 [L349] COND FALSE !(\read(r321)) [L352] COND TRUE \read(r311) [L353] COND TRUE \read(ep12) [L354] tmp___4 = 1 [L361] r322 = (_Bool )tmp___4 [L362] COND TRUE (int )id1 != (int )id2 [L363] COND TRUE (int )id1 != (int )id3 [L364] COND TRUE (int )id2 != (int )id3 [L365] COND TRUE (int )id1 >= 0 [L366] COND TRUE (int )id2 >= 0 [L367] COND TRUE (int )id3 >= 0 [L368] COND TRUE (int )r1 == 0 [L369] COND TRUE (int )r2 == 0 [L370] COND TRUE (int )r3 == 0 [L371] COND TRUE \read(r122) [L372] COND TRUE \read(r132) [L373] COND TRUE \read(r212) [L374] COND TRUE \read(r232) [L375] COND TRUE \read(r312) [L376] COND TRUE \read(r322) [L377] COND TRUE (int )max1 == (int )id1 [L378] COND TRUE (int )max2 == (int )id2 [L379] COND TRUE (int )max3 == (int )id3 [L380] COND TRUE (int )st1 == 0 [L381] COND TRUE (int )st2 == 0 [L382] COND TRUE (int )st3 == 0 [L383] COND TRUE (int )nl1 == 0 [L384] COND TRUE (int )nl2 == 0 [L385] COND TRUE (int )nl3 == 0 [L386] COND TRUE (int )mode1 == 0 [L387] COND TRUE (int )mode2 == 0 [L388] COND TRUE (int )mode3 == 0 [L389] tmp___5 = 1 [L471] RET return (tmp___5); [L564] EXPR init() [L564] i2 = init() [L566] p12_old = nomsg [L567] p12_new = nomsg [L568] p13_old = nomsg [L569] p13_new = nomsg [L570] p21_old = nomsg [L571] p21_new = nomsg [L572] p23_old = nomsg [L573] p23_new = nomsg [L574] p31_old = nomsg [L575] p31_new = nomsg [L576] p32_old = nomsg [L577] p32_new = nomsg [L578] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, 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] [L579] COND TRUE 1 [L581] CALL node1() [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 1 [L150] COND TRUE \read(ep12) [L151] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L151] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L153] COND FALSE !(\read(ep13)) [L157] RET mode1 = (_Bool)1 [L581] node1() [L582] CALL node2() [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND FALSE !(\read(ep21)) [L199] COND TRUE \read(ep23) [L200] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L200] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L203] RET mode2 = (_Bool)1 [L582] node2() [L583] CALL node3() [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND FALSE !(\read(ep32)) [L249] RET mode3 = (_Bool)1 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=1, m2=3, m3=4, max1=0, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L597] assert(c1) [L579] COND TRUE 1 [L581] CALL node1() [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND FALSE !(\read(ep21)) [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND TRUE (int )m1 > (int )max1 [L137] max1 = m1 [L140] COND FALSE !((int )r1 == 2) [L147] RET mode1 = (_Bool)0 [L581] node1() [L582] CALL node2() [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND TRUE \read(ep12) [L173] m2 = p12_old [L174] p12_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND FALSE !(\read(ep32)) [L186] COND FALSE !((int )r2 == 2) [L193] RET mode2 = (_Bool)0 [L582] node2() [L583] CALL node3() [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND FALSE !(\read(ep13)) [L225] COND TRUE \read(ep23) [L226] m3 = p23_old [L227] p23_old = nomsg [L228] COND FALSE !((int )m3 > (int )max3) [L232] COND FALSE !((int )r3 == 2) [L239] RET mode3 = (_Bool)0 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=0, st2=0, st3=0] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=0, st2=0, st3=0] [L597] assert(c1) [L579] COND TRUE 1 [L581] CALL node1() [L121] COND FALSE !(\read(mode1)) [L149] COND FALSE !((int )r1 < 1) [L157] RET mode1 = (_Bool)1 [L581] node1() [L582] CALL node2() [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND FALSE !(\read(ep21)) [L199] COND TRUE \read(ep23) [L200] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L200] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L203] RET mode2 = (_Bool)1 [L582] node2() [L583] CALL node3() [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND FALSE !(\read(ep32)) [L249] RET mode3 = (_Bool)1 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=0, m3=3, max1=4, max2=3, max3=4, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] assert(c1) [L579] COND TRUE 1 [L581] CALL node1() [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND FALSE !(\read(ep21)) [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND FALSE !((int )m1 > (int )max1) [L140] COND TRUE (int )r1 == 2 [L141] COND FALSE !((int )max1 == (int )id1) [L144] nl1 = (char)1 [L147] RET mode1 = (_Bool)0 [L581] node1() [L582] CALL node2() [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND TRUE \read(ep12) [L173] m2 = p12_old [L174] p12_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND FALSE !(\read(ep32)) [L186] COND TRUE (int )r2 == 2 [L187] COND TRUE (int )max2 == (int )id2 [L188] st2 = (char)1 [L193] RET mode2 = (_Bool)0 [L582] node2() [L583] CALL node3() [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND FALSE !(\read(ep13)) [L225] COND TRUE \read(ep23) [L226] m3 = p23_old [L227] p23_old = nomsg [L228] COND FALSE !((int )m3 > (int )max3) [L232] COND TRUE (int )r3 == 2 [L233] COND TRUE (int )max3 == (int )id3 [L234] st3 = (char)1 [L239] RET mode3 = (_Bool)0 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=-1, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L479] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L525] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=-1, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=-1, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L610] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=3, id3=4, m1=4, m2=-1, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 245.66 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 936.0 MB in the beginning and 1.2 GB in the end (delta: -214.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1611.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.8 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -76.8 MB). Peak memory consumption was 330.2 MB. Max. memory is 11.5 GB. * CodeCheck took 107578.62 ms. Allocated memory was 1.3 GB in the beginning and 2.4 GB in the end (delta: 1.1 GB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -936.6 MB). Peak memory consumption was 192.2 MB. Max. memory is 11.5 GB. * Witness Printer took 110.79 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...