./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case_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_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/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 1b149b3cef099476d14a8b122afb66552d0406eb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-22 22:04:50,789 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:04:50,791 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:04:50,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:04:50,798 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:04:50,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:04:50,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:04:50,800 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:04:50,801 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:04:50,802 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:04:50,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:04:50,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:04:50,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:04:50,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:04:50,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:04:50,805 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:04:50,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:04:50,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:04:50,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:04:50,809 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:04:50,809 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:04:50,810 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:04:50,812 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:04:50,812 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:04:50,812 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:04:50,813 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:04:50,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:04:50,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:04:50,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:04:50,816 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:04:50,816 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:04:50,816 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:04:50,816 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:04:50,817 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:04:50,817 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:04:50,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:04:50,818 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 22:04:50,828 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:04:50,828 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:04:50,829 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:04:50,829 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:04:50,830 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:04:50,830 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:04:50,830 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:04:50,830 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:04:50,830 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:04:50,830 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:04:50,830 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:04:50,831 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:04:50,831 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:04:50,831 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:04:50,831 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:04:50,831 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:04:50,831 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:04:50,831 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:04:50,831 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:04:50,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:04:50,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:04:50,832 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:04:50,832 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:04:50,832 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:04:50,832 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:04:50,832 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:04:50,832 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:04:50,832 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:04:50,833 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:04:50,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:04:50,833 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_8572d14e-09ee-424b-b73b-02a460fb09ca/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 -> 1b149b3cef099476d14a8b122afb66552d0406eb [2018-11-22 22:04:50,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:04:50,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:04:50,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:04:50,865 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:04:50,865 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:04:50,866 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/../../sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-22 22:04:50,901 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/data/2d65030aa/7c3c3363dd714fc88cb79bc477cfdb83/FLAGd25386a7e [2018-11-22 22:04:51,294 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:04:51,294 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-22 22:04:51,298 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/data/2d65030aa/7c3c3363dd714fc88cb79bc477cfdb83/FLAGd25386a7e [2018-11-22 22:04:51,308 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/data/2d65030aa/7c3c3363dd714fc88cb79bc477cfdb83 [2018-11-22 22:04:51,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:04:51,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:04:51,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:04:51,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:04:51,316 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:04:51,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:04:51" (1/1) ... [2018-11-22 22:04:51,319 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 22.11 10:04:51, skipping insertion in model container [2018-11-22 22:04:51,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:04:51" (1/1) ... [2018-11-22 22:04:51,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:04:51,342 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:04:51,472 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:04:51,475 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:04:51,487 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:04:51,499 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:04:51,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:51 WrapperNode [2018-11-22 22:04:51,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:04:51,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:04:51,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:04:51,500 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:04:51,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:51" (1/1) ... [2018-11-22 22:04:51,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:51" (1/1) ... [2018-11-22 22:04:51,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:04:51,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:04:51,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:04:51,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:04:51,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:51" (1/1) ... [2018-11-22 22:04:51,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:51" (1/1) ... [2018-11-22 22:04:51,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:51" (1/1) ... [2018-11-22 22:04:51,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:51" (1/1) ... [2018-11-22 22:04:51,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:51" (1/1) ... [2018-11-22 22:04:51,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:51" (1/1) ... [2018-11-22 22:04:51,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:51" (1/1) ... [2018-11-22 22:04:51,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:04:51,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:04:51,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:04:51,534 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:04:51,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/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-22 22:04:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:04:51,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:04:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:04:51,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:04:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:04:51,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:04:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-22 22:04:51,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-22 22:04:51,703 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:04:51,703 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 22:04:51,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:04:51 BoogieIcfgContainer [2018-11-22 22:04:51,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:04:51,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:04:51,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:04:51,706 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:04:51,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:04:51" (1/3) ... [2018-11-22 22:04:51,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d089a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:04:51, skipping insertion in model container [2018-11-22 22:04:51,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:51" (2/3) ... [2018-11-22 22:04:51,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d089a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:04:51, skipping insertion in model container [2018-11-22 22:04:51,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:04:51" (3/3) ... [2018-11-22 22:04:51,709 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-22 22:04:51,715 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:04:51,719 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 22:04:51,730 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 22:04:51,750 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:04:51,750 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:04:51,750 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:04:51,750 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:04:51,750 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:04:51,750 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:04:51,751 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:04:51,751 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:04:51,751 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:04:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-22 22:04:51,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-22 22:04:51,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:51,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:51,766 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:51,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:51,770 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-22 22:04:51,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:04:51,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:04:51,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:51,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:51,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:51,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-22 22:04:51,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:04:51,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:04:51,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 22:04:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 22:04:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 22:04:51,853 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-22 22:04:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:51,868 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-22 22:04:51,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 22:04:51,869 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-22 22:04:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:51,876 INFO L225 Difference]: With dead ends: 30 [2018-11-22 22:04:51,876 INFO L226 Difference]: Without dead ends: 13 [2018-11-22 22:04:51,878 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-22 22:04:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-22 22:04:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-22 22:04:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-22 22:04:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-22 22:04:51,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-22 22:04:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:51,900 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-22 22:04:51,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 22:04:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-22 22:04:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-22 22:04:51,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:51,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:51,902 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:51,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:51,902 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2018-11-22 22:04:51,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:04:51,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:04:51,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:51,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:51,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:51,973 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-22 22:04:51,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:04:51,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:04:51,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:04:51,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:04:51,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:04:51,975 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2018-11-22 22:04:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:52,002 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-22 22:04:52,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:04:52,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-22 22:04:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:52,002 INFO L225 Difference]: With dead ends: 19 [2018-11-22 22:04:52,003 INFO L226 Difference]: Without dead ends: 14 [2018-11-22 22:04:52,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:04:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-22 22:04:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-22 22:04:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-22 22:04:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-22 22:04:52,006 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-22 22:04:52,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:52,006 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-22 22:04:52,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:04:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-22 22:04:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 22:04:52,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:52,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:52,007 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:52,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:52,007 INFO L82 PathProgramCache]: Analyzing trace with hash 137668885, now seen corresponding path program 1 times [2018-11-22 22:04:52,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:04:52,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:04:52,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:52,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:52,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:04:52,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:04:52,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:04:52,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:52,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:04:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:04:52,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:04:52,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-22 22:04:52,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 22:04:52,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:04:52,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:04:52,296 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 12 states. [2018-11-22 22:04:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:52,399 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-22 22:04:52,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:04:52,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-11-22 22:04:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:52,400 INFO L225 Difference]: With dead ends: 32 [2018-11-22 22:04:52,400 INFO L226 Difference]: Without dead ends: 20 [2018-11-22 22:04:52,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-22 22:04:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-22 22:04:52,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-22 22:04:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-22 22:04:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-22 22:04:52,403 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-22 22:04:52,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:52,403 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-22 22:04:52,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 22:04:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-22 22:04:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-22 22:04:52,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:52,404 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:52,404 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:52,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:52,404 INFO L82 PathProgramCache]: Analyzing trace with hash -2110192267, now seen corresponding path program 1 times [2018-11-22 22:04:52,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:04:52,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:04:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:52,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:52,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:04:52,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:04:52,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:04:52,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:52,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:04:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:04:52,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:04:52,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-22 22:04:52,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:04:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:04:52,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:04:52,459 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 4 states. [2018-11-22 22:04:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:52,472 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-22 22:04:52,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:04:52,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-22 22:04:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:52,473 INFO L225 Difference]: With dead ends: 28 [2018-11-22 22:04:52,473 INFO L226 Difference]: Without dead ends: 20 [2018-11-22 22:04:52,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:04:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-22 22:04:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-22 22:04:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-22 22:04:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-22 22:04:52,475 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-11-22 22:04:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:52,475 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-22 22:04:52,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:04:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-22 22:04:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 22:04:52,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:52,476 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:52,476 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:52,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:52,476 INFO L82 PathProgramCache]: Analyzing trace with hash 370288085, now seen corresponding path program 2 times [2018-11-22 22:04:52,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:04:52,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:04:52,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:52,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:52,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 22:04:52,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:04:52,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:04:52,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:04:52,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:04:52,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:04:52,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:04:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:04:52,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:04:52,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-11-22 22:04:52,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-22 22:04:52,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 22:04:52,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-11-22 22:04:52,775 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2018-11-22 22:04:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:52,992 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-22 22:04:52,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 22:04:52,992 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-11-22 22:04:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:52,993 INFO L225 Difference]: With dead ends: 38 [2018-11-22 22:04:52,993 INFO L226 Difference]: Without dead ends: 26 [2018-11-22 22:04:52,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-11-22 22:04:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-22 22:04:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-22 22:04:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-22 22:04:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-22 22:04:52,997 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2018-11-22 22:04:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:52,997 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-22 22:04:52,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-22 22:04:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-22 22:04:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-22 22:04:52,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:52,998 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:52,999 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:52,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash 66146485, now seen corresponding path program 2 times [2018-11-22 22:04:52,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:04:52,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:04:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:53,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:04:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:04:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:04:53,030 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret2 := main(); [?] havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=2] [?] assume !(4 == ~i~0); VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=4] [?] assume !(4 == ~i~0); VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=4] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=6] [?] assume !(4 == ~i~0); VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=6] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=8] [?] assume 4 == ~i~0;~sn~0 := -10; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=(- 10)] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=(- 10)] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=(- 10)] [?] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] assume !(4 == ~i~0); VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] assume !(4 == ~i~0); VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] assume !(4 == ~i~0); VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] assume 4 == ~i~0; [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] assume !(4 == ~i~0); VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] assume !(4 == ~i~0); VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] assume !(4 == ~i~0); VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] assume 4 == ~i~0; [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=0, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L13] i++ VAL [i=2, n=4, n=2] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=4, n=6] [L15] COND FALSE !(i==4) VAL [i=3, n=6, n=4] [L13] i++ VAL [i=4, n=6, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=8, n=4] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=-10, n=4] [L13] i++ VAL [i=5, n=-10, n=4] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 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-22 22:04:53,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:04:53 BoogieIcfgContainer [2018-11-22 22:04:53,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:04:53,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:04:53,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:04:53,055 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:04:53,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:04:51" (3/4) ... [2018-11-22 22:04:53,057 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret2 := main(); [?] havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=2] [?] assume !(4 == ~i~0); VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=4] [?] assume !(4 == ~i~0); VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=4] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=6] [?] assume !(4 == ~i~0); VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=6] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=8] [?] assume 4 == ~i~0;~sn~0 := -10; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=(- 10)] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=(- 10)] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=(- 10)] [?] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] assume !(4 == ~i~0); VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] assume !(4 == ~i~0); VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] assume !(4 == ~i~0); VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] assume 4 == ~i~0; [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] assume !(4 == ~i~0); VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] assume !(4 == ~i~0); VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] assume !(4 == ~i~0); VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] assume 4 == ~i~0; [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=0, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L13] i++ VAL [i=2, n=4, n=2] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=4, n=6] [L15] COND FALSE !(i==4) VAL [i=3, n=4, n=6] [L13] i++ VAL [i=4, n=6, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=4, n=8] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=4, n=-10] [L13] i++ VAL [i=5, n=-10, n=4] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 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-22 22:04:53,091 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8572d14e-09ee-424b-b73b-02a460fb09ca/bin-2019/uautomizer/witness.graphml [2018-11-22 22:04:53,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:04:53,092 INFO L168 Benchmark]: Toolchain (without parser) took 1780.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 958.1 MB in the beginning and 937.4 MB in the end (delta: 20.6 MB). Peak memory consumption was 174.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:53,093 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:04:53,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.01 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:53,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.73 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:04:53,094 INFO L168 Benchmark]: Boogie Preprocessor took 16.32 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 944.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:53,095 INFO L168 Benchmark]: RCFGBuilder took 169.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -193.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:53,095 INFO L168 Benchmark]: TraceAbstraction took 1351.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 940.7 MB in the end (delta: 197.1 MB). Peak memory consumption was 197.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:53,096 INFO L168 Benchmark]: Witness Printer took 36.52 ms. Allocated memory is still 1.2 GB. Free memory was 940.7 MB in the beginning and 937.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:53,098 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 187.01 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.73 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.32 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 944.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 169.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -193.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1351.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 940.7 MB in the end (delta: 197.1 MB). Peak memory consumption was 197.1 MB. Max. memory is 11.5 GB. * Witness Printer took 36.52 ms. Allocated memory is still 1.2 GB. Free memory was 940.7 MB in the beginning and 937.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 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: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=0, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L13] i++ VAL [i=2, n=4, n=2] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=4, n=6] [L15] COND FALSE !(i==4) VAL [i=3, n=6, n=4] [L13] i++ VAL [i=4, n=6, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=8, n=4] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=-10, n=4] [L13] i++ VAL [i=5, n=-10, n=4] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 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, 19 locations, 1 error locations. UNSAFE Result, 1.3s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 17 SDslu, 160 SDs, 0 SdLazy, 233 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=5, 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, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 7728 SizeOfPredicates, 7 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 11/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...