./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/terminator_01_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/terminator_01_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9fb65547f8a6daa297fc4bc1126a09cbd517dc4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-aa41828 [2018-11-23 02:34:38,827 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:34:38,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:34:38,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:34:38,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:34:38,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:34:38,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:34:38,839 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:34:38,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:34:38,840 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:34:38,841 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:34:38,841 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:34:38,842 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:34:38,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:34:38,843 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:34:38,844 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:34:38,844 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:34:38,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:34:38,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:34:38,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:34:38,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:34:38,851 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:34:38,853 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:34:38,853 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:34:38,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:34:38,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:34:38,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:34:38,856 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:34:38,856 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:34:38,857 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:34:38,857 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:34:38,858 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:34:38,858 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:34:38,858 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:34:38,859 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:34:38,859 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:34:38,860 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 02:34:38,869 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:34:38,869 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:34:38,870 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:34:38,870 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:34:38,871 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:34:38,871 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:34:38,871 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:34:38,871 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:34:38,871 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:34:38,871 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:34:38,872 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:34:38,872 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:34:38,872 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:34:38,872 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:34:38,872 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:34:38,872 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:34:38,873 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:34:38,873 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:34:38,873 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:34:38,873 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:34:38,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:34:38,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:34:38,874 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:34:38,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:34:38,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:34:38,874 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:34:38,875 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:34:38,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:34:38,875 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:34:38,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:34:38,875 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_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer 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 -> Automizer 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 -> e9fb65547f8a6daa297fc4bc1126a09cbd517dc4 [2018-11-23 02:34:38,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:34:38,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:34:38,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:34:38,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:34:38,913 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:34:38,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer/../../sv-benchmarks/c/loops/terminator_01_false-unreach-call_true-termination.i [2018-11-23 02:34:38,949 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer/data/746979127/9aa35c7d50604f2b87f768bece67eac7/FLAG29a4c1551 [2018-11-23 02:34:39,244 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:34:39,245 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/sv-benchmarks/c/loops/terminator_01_false-unreach-call_true-termination.i [2018-11-23 02:34:39,249 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer/data/746979127/9aa35c7d50604f2b87f768bece67eac7/FLAG29a4c1551 [2018-11-23 02:34:39,259 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer/data/746979127/9aa35c7d50604f2b87f768bece67eac7 [2018-11-23 02:34:39,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:34:39,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:34:39,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:34:39,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:34:39,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:34:39,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:34:39" (1/1) ... [2018-11-23 02:34:39,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd9ff0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39, skipping insertion in model container [2018-11-23 02:34:39,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:34:39" (1/1) ... [2018-11-23 02:34:39,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:34:39,286 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:34:39,388 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:34:39,394 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:34:39,403 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:34:39,413 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:34:39,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39 WrapperNode [2018-11-23 02:34:39,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:34:39,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:34:39,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:34:39,414 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:34:39,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39" (1/1) ... [2018-11-23 02:34:39,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39" (1/1) ... [2018-11-23 02:34:39,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:34:39,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:34:39,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:34:39,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:34:39,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39" (1/1) ... [2018-11-23 02:34:39,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39" (1/1) ... [2018-11-23 02:34:39,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39" (1/1) ... [2018-11-23 02:34:39,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39" (1/1) ... [2018-11-23 02:34:39,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39" (1/1) ... [2018-11-23 02:34:39,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39" (1/1) ... [2018-11-23 02:34:39,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39" (1/1) ... [2018-11-23 02:34:39,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:34:39,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:34:39,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:34:39,482 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:34:39,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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:2000 [2018-11-23 02:34:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:34:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:34:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:34:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:34:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:34:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:34:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:34:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 02:34:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:34:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:34:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 02:34:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 02:34:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:34:39,657 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:34:39,657 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 02:34:39,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:34:39 BoogieIcfgContainer [2018-11-23 02:34:39,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:34:39,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:34:39,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:34:39,660 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:34:39,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:34:39" (1/3) ... [2018-11-23 02:34:39,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a4315b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:34:39, skipping insertion in model container [2018-11-23 02:34:39,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:39" (2/3) ... [2018-11-23 02:34:39,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a4315b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:34:39, skipping insertion in model container [2018-11-23 02:34:39,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:34:39" (3/3) ... [2018-11-23 02:34:39,664 INFO L112 eAbstractionObserver]: Analyzing ICFG terminator_01_false-unreach-call_true-termination.i [2018-11-23 02:34:39,672 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:34:39,678 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:34:39,693 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:34:39,720 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:34:39,721 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:34:39,721 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:34:39,721 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:34:39,721 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:34:39,721 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:34:39,722 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:34:39,722 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:34:39,722 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:34:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 02:34:39,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 02:34:39,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:34:39,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:34:39,744 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:34:39,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:39,750 INFO L82 PathProgramCache]: Analyzing trace with hash -564387615, now seen corresponding path program 1 times [2018-11-23 02:34:39,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:39,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:39,840 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-23 02:34:39,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:34:39,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:34:39,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:34:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:34:39,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:34:39,853 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 02:34:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:34:39,867 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 02:34:39,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:34:39,869 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 02:34:39,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:34:39,876 INFO L225 Difference]: With dead ends: 32 [2018-11-23 02:34:39,876 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 02:34:39,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:34:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 02:34:39,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 02:34:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 02:34:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 02:34:39,907 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 02:34:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:34:39,907 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 02:34:39,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:34:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 02:34:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 02:34:39,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:34:39,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:34:39,908 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:34:39,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:39,908 INFO L82 PathProgramCache]: Analyzing trace with hash -538271495, now seen corresponding path program 1 times [2018-11-23 02:34:39,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:39,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:39,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:39,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:39,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:39,949 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=104, |#NULL.offset|=102, |old(#NULL.base)|=104, |old(#NULL.offset)|=102] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=102] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=102] [?] RET #34#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4);havoc #t~nondet0;~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; VAL [main_~p~0.base=103, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=103, |main_~#x~0.offset|=0] [?] call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset, 4); VAL [main_~p~0.base=103, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem1|=101, |main_~#x~0.base|=103, |main_~#x~0.offset|=0] [?] assume !(#t~mem1 < 100);havoc #t~mem1; VAL [main_~p~0.base=103, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=103, |main_~#x~0.offset|=0] [?] CALL call __VERIFIER_assert(0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=102, old(#NULL.base)=104, old(#NULL.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4); [L13] havoc #t~nondet0; [L14] ~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16] call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem1=101, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16-L18] assume !(#t~mem1 < 100); [L16] havoc #t~mem1; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=102, old(#NULL.base)=104, old(#NULL.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4); [L13] havoc #t~nondet0; [L14] ~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16] call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem1=101, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16-L18] assume !(#t~mem1 < 100); [L16] havoc #t~mem1; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L13] int x=__VERIFIER_nondet_int(); [L13] int x=__VERIFIER_nondet_int(); [L14] int *p = &x; VAL [p={103:0}, x={103:0}] [L16] EXPR \read(x) VAL [\read(x)=101, p={103:0}, x={103:0}] [L16] COND FALSE !(x<100) [L19] CALL __VERIFIER_assert(0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 02:34:39,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:34:39 BoogieIcfgContainer [2018-11-23 02:34:39,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:34:39,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:34:39,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:34:39,972 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:34:39,973 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:34:39" (3/4) ... [2018-11-23 02:34:39,974 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=104, |#NULL.offset|=102, |old(#NULL.base)|=104, |old(#NULL.offset)|=102] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=102] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=102] [?] RET #34#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4);havoc #t~nondet0;~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; VAL [main_~p~0.base=103, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=103, |main_~#x~0.offset|=0] [?] call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset, 4); VAL [main_~p~0.base=103, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem1|=101, |main_~#x~0.base|=103, |main_~#x~0.offset|=0] [?] assume !(#t~mem1 < 100);havoc #t~mem1; VAL [main_~p~0.base=103, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=103, |main_~#x~0.offset|=0] [?] CALL call __VERIFIER_assert(0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=102, old(#NULL.base)=104, old(#NULL.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4); [L13] havoc #t~nondet0; [L14] ~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16] call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem1=101, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16-L18] assume !(#t~mem1 < 100); [L16] havoc #t~mem1; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=102, old(#NULL.base)=104, old(#NULL.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4); [L13] havoc #t~nondet0; [L14] ~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16] call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem1=101, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16-L18] assume !(#t~mem1 < 100); [L16] havoc #t~mem1; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L13] int x=__VERIFIER_nondet_int(); [L13] int x=__VERIFIER_nondet_int(); [L14] int *p = &x; VAL [p={103:0}, x={103:0}] [L16] EXPR \read(x) VAL [\read(x)=101, p={103:0}, x={103:0}] [L16] COND FALSE !(x<100) [L19] CALL __VERIFIER_assert(0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 02:34:40,008 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a8c60072-0ae0-4036-a26d-ca1727ddb9b3/bin-2019/uautomizer/witness.graphml [2018-11-23 02:34:40,009 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:34:40,009 INFO L168 Benchmark]: Toolchain (without parser) took 747.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:34:40,010 INFO L168 Benchmark]: CDTParser took 0.15 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-23 02:34:40,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.33 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:34:40,011 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.44 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:34:40,011 INFO L168 Benchmark]: Boogie Preprocessor took 51.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:34:40,012 INFO L168 Benchmark]: RCFGBuilder took 175.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:34:40,012 INFO L168 Benchmark]: TraceAbstraction took 313.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:34:40,013 INFO L168 Benchmark]: Witness Printer took 36.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:34:40,015 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 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 150.33 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.44 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 175.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 313.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Witness Printer took 36.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] int x=__VERIFIER_nondet_int(); [L13] int x=__VERIFIER_nondet_int(); [L14] int *p = &x; VAL [p={103:0}, x={103:0}] [L16] EXPR \read(x) VAL [\read(x)=101, p={103:0}, x={103:0}] [L16] COND FALSE !(x<100) [L19] CALL __VERIFIER_assert(0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, traceCheckStatistics: No data available, 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...