./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.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_506509f4-0ecd-4fcc-998a-22dcb41a8424/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/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 4e7975b17d935115e9ca07f323e5eabfbd25e139 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:02:09,817 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:02:09,818 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:02:09,828 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:02:09,828 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:02:09,829 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:02:09,830 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:02:09,831 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:02:09,832 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:02:09,833 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:02:09,834 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:02:09,834 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:02:09,835 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:02:09,836 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:02:09,837 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:02:09,838 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:02:09,838 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:02:09,840 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:02:09,841 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:02:09,843 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:02:09,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:02:09,845 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:02:09,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:02:09,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:02:09,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:02:09,847 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:02:09,848 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:02:09,849 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:02:09,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:02:09,850 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:02:09,851 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:02:09,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:02:09,851 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:02:09,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:02:09,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:02:09,853 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:02:09,854 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 05:02:09,862 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:02:09,862 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:02:09,862 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:02:09,863 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 05:02:09,863 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:02:09,863 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:02:09,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:02:09,864 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:02:09,864 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:02:09,864 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:02:09,864 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:02:09,865 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:02:09,865 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:02:09,866 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:02:09,866 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:02:09,866 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:02:09,866 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:02:09,866 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 05:02:09,866 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 05:02:09,866 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:02:09,867 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:02:09,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 05:02:09,867 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:02:09,867 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:02:09,867 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:02:09,867 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 05:02:09,868 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:02:09,868 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:02:09,868 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_506509f4-0ecd-4fcc-998a-22dcb41a8424/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 -> 4e7975b17d935115e9ca07f323e5eabfbd25e139 [2018-11-10 05:02:09,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:02:09,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:02:09,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:02:09,905 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:02:09,905 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:02:09,905 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 05:02:09,943 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/bin-2019/ukojak/data/398c08671/aa41b56bef0c4bdc895382072ee35d72/FLAG9deae54d6 [2018-11-10 05:02:10,270 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:02:10,270 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 05:02:10,279 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/bin-2019/ukojak/data/398c08671/aa41b56bef0c4bdc895382072ee35d72/FLAG9deae54d6 [2018-11-10 05:02:10,288 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/bin-2019/ukojak/data/398c08671/aa41b56bef0c4bdc895382072ee35d72 [2018-11-10 05:02:10,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:02:10,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:02:10,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:02:10,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:02:10,294 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:02:10,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:02:10" (1/1) ... [2018-11-10 05:02:10,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b52ac19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:02:10, skipping insertion in model container [2018-11-10 05:02:10,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:02:10" (1/1) ... [2018-11-10 05:02:10,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:02:10,329 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:02:10,465 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:02:10,471 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:02:10,506 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:02:10,520 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:02:10,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:02:10 WrapperNode [2018-11-10 05:02:10,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:02:10,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:02:10,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:02:10,521 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:02:10,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:02:10" (1/1) ... [2018-11-10 05:02:10,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:02:10" (1/1) ... [2018-11-10 05:02:10,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:02:10,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:02:10,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:02:10,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:02:10,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:02:10" (1/1) ... [2018-11-10 05:02:10,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:02:10" (1/1) ... [2018-11-10 05:02:10,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:02:10" (1/1) ... [2018-11-10 05:02:10,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:02:10" (1/1) ... [2018-11-10 05:02:10,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:02:10" (1/1) ... [2018-11-10 05:02:10,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:02:10" (1/1) ... [2018-11-10 05:02:10,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:02:10" (1/1) ... [2018-11-10 05:02:10,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:02:10,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:02:10,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:02:10,628 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:02:10,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:02:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/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 05:02:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:02:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:02:12,317 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:02:12,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:02:12 BoogieIcfgContainer [2018-11-10 05:02:12,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:02:12,318 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 05:02:12,318 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 05:02:12,325 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 05:02:12,325 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:02:12" (1/1) ... [2018-11-10 05:02:12,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:02:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-10 05:02:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-10 05:02:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 05:02:12,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:12,764 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 05:02:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-11-10 05:02:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-11-10 05:02:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 05:02:12,839 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:12,985 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 05:02:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-11-10 05:02:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-11-10 05:02:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 05:02:13,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:13,379 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 05:02:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-11-10 05:02:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-11-10 05:02:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 05:02:13,696 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:13,849 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 05:02:14,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-11-10 05:02:14,234 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-11-10 05:02:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 05:02:14,234 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:14,397 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 05:02:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-11-10 05:02:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-11-10 05:02:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 05:02:15,032 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:15,208 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 05:02:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-11-10 05:02:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-11-10 05:02:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 05:02:15,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:16,057 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 05:02:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-11-10 05:02:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-11-10 05:02:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 05:02:16,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:16,241 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 05:02:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-11-10 05:02:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-11-10 05:02:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 05:02:16,272 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:16,532 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 05:02:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 67 states and 113 transitions. [2018-11-10 05:02:17,949 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 113 transitions. [2018-11-10 05:02:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 05:02:17,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:18,094 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 05:02:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 70 states and 118 transitions. [2018-11-10 05:02:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-11-10 05:02:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 05:02:18,306 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:18,611 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 05:02:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 88 states and 161 transitions. [2018-11-10 05:02:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2018-11-10 05:02:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 05:02:21,257 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:21,582 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 05:02:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 107 states and 209 transitions. [2018-11-10 05:02:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 209 transitions. [2018-11-10 05:02:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 05:02:25,455 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:25,565 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 05:02:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 109 states and 213 transitions. [2018-11-10 05:02:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2018-11-10 05:02:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 05:02:25,965 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:26,042 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 05:02:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 110 states and 214 transitions. [2018-11-10 05:02:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 214 transitions. [2018-11-10 05:02:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 05:02:26,263 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:26,668 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 05:02:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 129 states and 261 transitions. [2018-11-10 05:02:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 261 transitions. [2018-11-10 05:02:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 05:02:30,899 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:31,123 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 05:02:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 130 states and 266 transitions. [2018-11-10 05:02:31,422 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 266 transitions. [2018-11-10 05:02:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 05:02:31,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:31,573 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 05:02:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 133 states and 275 transitions. [2018-11-10 05:02:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 275 transitions. [2018-11-10 05:02:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 05:02:32,122 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:32,363 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 05:02:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 135 states and 279 transitions. [2018-11-10 05:02:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 279 transitions. [2018-11-10 05:02:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 05:02:32,678 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:33,158 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 05:02:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 150 states and 311 transitions. [2018-11-10 05:02:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 311 transitions. [2018-11-10 05:02:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 05:02:36,960 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:37,144 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 05:02:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 154 states and 324 transitions. [2018-11-10 05:02:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 324 transitions. [2018-11-10 05:02:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 05:02:38,051 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:38,224 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 05:02:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 156 states and 332 transitions. [2018-11-10 05:02:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 332 transitions. [2018-11-10 05:02:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 05:02:38,842 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:39,039 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 05:02:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 159 states and 343 transitions. [2018-11-10 05:02:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 343 transitions. [2018-11-10 05:02:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 05:02:39,699 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:02:39,870 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 05:02:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:02:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 160 states and 346 transitions. [2018-11-10 05:02:40,128 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 346 transitions. [2018-11-10 05:02:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 05:02:40,128 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:02:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:02:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:02:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:02:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:02:40,772 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 24 iterations. [2018-11-10 05:02:40,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 05:02:40 ImpRootNode [2018-11-10 05:02:40,851 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 05:02:40,851 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:02:40,851 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:02:40,851 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:02:40,853 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:02:12" (3/4) ... [2018-11-10 05:02:40,855 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 05:02:40,949 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_506509f4-0ecd-4fcc-998a-22dcb41a8424/bin-2019/ukojak/witness.graphml [2018-11-10 05:02:40,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:02:40,949 INFO L168 Benchmark]: Toolchain (without parser) took 30658.83 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 687.3 MB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 518.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:02:40,950 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:02:40,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.40 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 940.4 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:02:40,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 940.4 MB in the beginning and 1.2 GB in the end (delta: -210.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:02:40,951 INFO L168 Benchmark]: Boogie Preprocessor took 28.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:02:40,951 INFO L168 Benchmark]: RCFGBuilder took 1690.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -85.0 MB). Peak memory consumption was 335.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:02:40,951 INFO L168 Benchmark]: CodeCheck took 28532.97 ms. Allocated memory was 1.3 GB in the beginning and 1.7 GB in the end (delta: 443.5 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 87.7 MB). Peak memory consumption was 531.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:02:40,951 INFO L168 Benchmark]: Witness Printer took 97.74 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:02:40,953 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, 130 locations, 1 error locations. UNSAFE Result, 28.4s OverallTime, 24 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 82237880 SDtfs, 55033914 SDslu, 67360184 SDs, 0 SdLazy, 210379728 SolverSat, 48967554 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4434 GetRequests, 3804 SyntacticMatches, 190 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112811 ImplicationChecksByTransitivity, 24.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 458 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 82606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 10 PerfectInterpolantSequences, 26/91 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: 601]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L74] port_t p13 ; [L78] port_t p21 ; [L82] port_t p23 ; [L86] port_t p31 ; [L90] port_t p32 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] ep12 = __VERIFIER_nondet_bool() [L528] ep13 = __VERIFIER_nondet_bool() [L529] ep21 = __VERIFIER_nondet_bool() [L530] ep23 = __VERIFIER_nondet_bool() [L531] ep31 = __VERIFIER_nondet_bool() [L532] ep32 = __VERIFIER_nondet_bool() [L533] id1 = __VERIFIER_nondet_char() [L534] r1 = __VERIFIER_nondet_char() [L535] st1 = __VERIFIER_nondet_char() [L536] nl1 = __VERIFIER_nondet_char() [L537] m1 = __VERIFIER_nondet_char() [L538] max1 = __VERIFIER_nondet_char() [L539] mode1 = __VERIFIER_nondet_bool() [L540] id2 = __VERIFIER_nondet_char() [L541] r2 = __VERIFIER_nondet_char() [L542] st2 = __VERIFIER_nondet_char() [L543] nl2 = __VERIFIER_nondet_char() [L544] m2 = __VERIFIER_nondet_char() [L545] max2 = __VERIFIER_nondet_char() [L546] mode2 = __VERIFIER_nondet_bool() [L547] id3 = __VERIFIER_nondet_char() [L548] r3 = __VERIFIER_nondet_char() [L549] st3 = __VERIFIER_nondet_char() [L550] nl3 = __VERIFIER_nondet_char() [L551] m3 = __VERIFIER_nondet_char() [L552] max3 = __VERIFIER_nondet_char() [L553] mode3 = __VERIFIER_nondet_bool() [L554] CALL, EXPR init() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND TRUE \read(r121) [L275] tmp = 1 [L286] r122 = (_Bool )tmp [L287] COND FALSE !(\read(r131)) [L290] COND TRUE \read(r121) [L291] COND TRUE \read(ep23) [L292] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND FALSE !(\read(r211)) [L303] COND TRUE \read(r231) [L304] COND TRUE \read(ep31) [L305] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND TRUE \read(r231) [L314] tmp___2 = 1 [L325] r232 = (_Bool )tmp___2 [L326] COND TRUE \read(r311) [L327] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND TRUE \read(r321) [L340] tmp___4 = 1 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE \read(r122) [L362] COND TRUE \read(r132) [L363] COND TRUE \read(r212) [L364] COND TRUE \read(r232) [L365] COND TRUE \read(r312) [L366] COND TRUE \read(r322) [L367] COND TRUE (int )max1 == (int )id1 [L368] COND TRUE (int )max2 == (int )id2 [L369] COND TRUE (int )max3 == (int )id3 [L370] COND TRUE (int )st1 == 0 [L371] COND TRUE (int )st2 == 0 [L372] COND TRUE (int )st3 == 0 [L373] COND TRUE (int )nl1 == 0 [L374] COND TRUE (int )nl2 == 0 [L375] COND TRUE (int )nl3 == 0 [L376] COND TRUE (int )mode1 == 0 [L377] COND TRUE (int )mode2 == 0 [L378] COND TRUE (int )mode3 == 0 [L379] tmp___5 = 1 [L461] RET return (tmp___5); [L554] EXPR init() [L554] i2 = init() [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, 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] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND TRUE \read(ep12) [L147] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L147] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L149] COND FALSE !(\read(ep13)) [L153] RET mode1 = (_Bool)1 [L571] node1() [L572] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND FALSE !(\read(ep21)) [L192] COND TRUE \read(ep23) [L193] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] RET mode2 = (_Bool)1 [L572] node2() [L573] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND TRUE \read(ep32) [L236] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] RET mode3 = (_Bool)1 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, 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=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=1, m2=0, m3=-128, max1=126, max2=127, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND FALSE !(\read(ep21)) [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND FALSE !((int )m1 > (int )max1) [L136] COND TRUE (int )r1 == 1 [L137] COND TRUE (int )max1 == (int )id1 [L138] st1 = (char)1 [L143] RET mode1 = (_Bool)0 [L571] node1() [L572] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND FALSE !((int )m2 > (int )max2) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND FALSE !((int )r2 == 2) [L186] RET mode2 = (_Bool)0 [L572] node2() [L573] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND TRUE (int )m3 > (int )max3 [L219] max3 = m3 [L222] COND FALSE !((int )r3 == 2) [L229] RET mode3 = (_Bool)0 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=0, m2=0, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=0, m2=0, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=0, m2=0, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=0, m2=0, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=0, m2=0, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=0, m2=0, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L476] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L503] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=0, m2=0, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=0, m2=0, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L601] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=127, id3=0, m1=0, m2=0, m3=127, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 229.40 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 940.4 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 940.4 MB in the beginning and 1.2 GB in the end (delta: -210.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1690.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -85.0 MB). Peak memory consumption was 335.0 MB. Max. memory is 11.5 GB. * CodeCheck took 28532.97 ms. Allocated memory was 1.3 GB in the beginning and 1.7 GB in the end (delta: 443.5 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 87.7 MB). Peak memory consumption was 531.3 MB. Max. memory is 11.5 GB. * Witness Printer took 97.74 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...