./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6ff697c57265298ce2261966fa58c440777fc865 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:11:27,082 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:11:27,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:11:27,090 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:11:27,090 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:11:27,091 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:11:27,091 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:11:27,092 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:11:27,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:11:27,094 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:11:27,095 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:11:27,095 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:11:27,095 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:11:27,096 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:11:27,097 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:11:27,097 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:11:27,098 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:11:27,099 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:11:27,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:11:27,101 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:11:27,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:11:27,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:11:27,104 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:11:27,104 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:11:27,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:11:27,105 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:11:27,106 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:11:27,106 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:11:27,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:11:27,107 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:11:27,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:11:27,108 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:11:27,108 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:11:27,108 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:11:27,109 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:11:27,109 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:11:27,110 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-23 08:11:27,119 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:11:27,119 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:11:27,119 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:11:27,120 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:11:27,120 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 08:11:27,120 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 08:11:27,120 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 08:11:27,120 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 08:11:27,120 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 08:11:27,120 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 08:11:27,121 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 08:11:27,121 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 08:11:27,121 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 08:11:27,121 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:11:27,121 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 08:11:27,122 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:11:27,122 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:11:27,122 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:11:27,122 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:11:27,122 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:11:27,122 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 08:11:27,122 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:11:27,122 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:11:27,123 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:11:27,123 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:11:27,123 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:11:27,123 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:11:27,123 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:11:27,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:11:27,123 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:11:27,124 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:11:27,124 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:11:27,124 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 08:11:27,124 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:11:27,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:11:27,124 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 08:11:27,124 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ff697c57265298ce2261966fa58c440777fc865 [2018-11-23 08:11:27,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:11:27,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:11:27,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:11:27,158 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:11:27,159 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:11:27,159 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c [2018-11-23 08:11:27,197 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/data/1be99c5e9/1e8adfec5a694c58ab4f504a506e2b51/FLAGe3623d19d [2018-11-23 08:11:27,595 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:11:27,595 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c [2018-11-23 08:11:27,599 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/data/1be99c5e9/1e8adfec5a694c58ab4f504a506e2b51/FLAGe3623d19d [2018-11-23 08:11:27,607 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/data/1be99c5e9/1e8adfec5a694c58ab4f504a506e2b51 [2018-11-23 08:11:27,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:11:27,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:11:27,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:11:27,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:11:27,612 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:11:27,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:11:27" (1/1) ... [2018-11-23 08:11:27,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9989bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27, skipping insertion in model container [2018-11-23 08:11:27,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:11:27" (1/1) ... [2018-11-23 08:11:27,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:11:27,634 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:11:27,741 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:11:27,743 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:11:27,755 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:11:27,763 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:11:27,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27 WrapperNode [2018-11-23 08:11:27,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:11:27,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:11:27,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:11:27,764 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:11:27,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27" (1/1) ... [2018-11-23 08:11:27,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27" (1/1) ... [2018-11-23 08:11:27,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:11:27,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:11:27,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:11:27,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:11:27,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27" (1/1) ... [2018-11-23 08:11:27,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27" (1/1) ... [2018-11-23 08:11:27,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27" (1/1) ... [2018-11-23 08:11:27,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27" (1/1) ... [2018-11-23 08:11:27,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27" (1/1) ... [2018-11-23 08:11:27,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27" (1/1) ... [2018-11-23 08:11:27,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27" (1/1) ... [2018-11-23 08:11:27,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:11:27,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:11:27,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:11:27,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:11:27,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/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 08:11:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:11:27,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:11:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-23 08:11:27,874 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-23 08:11:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:11:27,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:11:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:11:27,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:11:28,045 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:11:28,045 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 08:11:28,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:28 BoogieIcfgContainer [2018-11-23 08:11:28,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:11:28,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:11:28,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:11:28,048 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:11:28,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:11:27" (1/3) ... [2018-11-23 08:11:28,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693d8887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:11:28, skipping insertion in model container [2018-11-23 08:11:28,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:27" (2/3) ... [2018-11-23 08:11:28,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693d8887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:11:28, skipping insertion in model container [2018-11-23 08:11:28,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:28" (3/3) ... [2018-11-23 08:11:28,051 INFO L112 eAbstractionObserver]: Analyzing ICFG HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c [2018-11-23 08:11:28,057 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:11:28,062 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-23 08:11:28,074 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-23 08:11:28,104 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:11:28,105 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:11:28,105 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:11:28,105 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:11:28,105 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:11:28,105 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:11:28,105 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:11:28,105 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:11:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-23 08:11:28,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 08:11:28,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:28,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:28,128 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 08:11:28,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:28,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1872952966, now seen corresponding path program 1 times [2018-11-23 08:11:28,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:28,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:28,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:28,228 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 08:11:28,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:28,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:11:28,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:28,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:11:28,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:11:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:11:28,241 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-11-23 08:11:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:28,280 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2018-11-23 08:11:28,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:11:28,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 08:11:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:28,288 INFO L225 Difference]: With dead ends: 58 [2018-11-23 08:11:28,288 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 08:11:28,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:11:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 08:11:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 08:11:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 08:11:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2018-11-23 08:11:28,316 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 7 [2018-11-23 08:11:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:28,316 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2018-11-23 08:11:28,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:11:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2018-11-23 08:11:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 08:11:28,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:28,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:28,317 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 08:11:28,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:28,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2068000115, now seen corresponding path program 1 times [2018-11-23 08:11:28,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:28,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:28,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:28,331 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 08:11:28,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:28,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:11:28,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:28,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:11:28,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:11:28,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:11:28,333 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand 3 states. [2018-11-23 08:11:28,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:28,371 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2018-11-23 08:11:28,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:11:28,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 08:11:28,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:28,372 INFO L225 Difference]: With dead ends: 72 [2018-11-23 08:11:28,372 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 08:11:28,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:11:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 08:11:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2018-11-23 08:11:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 08:11:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2018-11-23 08:11:28,381 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 8 [2018-11-23 08:11:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:28,382 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2018-11-23 08:11:28,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:11:28,382 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2018-11-23 08:11:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 08:11:28,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:28,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:28,384 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 08:11:28,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1576559192, now seen corresponding path program 1 times [2018-11-23 08:11:28,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:28,412 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 08:11:28,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:28,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:11:28,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:28,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:11:28,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:11:28,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:11:28,413 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand 3 states. [2018-11-23 08:11:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:28,458 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2018-11-23 08:11:28,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:11:28,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 08:11:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:28,461 INFO L225 Difference]: With dead ends: 69 [2018-11-23 08:11:28,461 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 08:11:28,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:11:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 08:11:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-11-23 08:11:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 08:11:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2018-11-23 08:11:28,469 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 18 [2018-11-23 08:11:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:28,469 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2018-11-23 08:11:28,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:11:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2018-11-23 08:11:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 08:11:28,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:28,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:28,471 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 08:11:28,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:28,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1628694841, now seen corresponding path program 1 times [2018-11-23 08:11:28,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:28,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:28,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:28,506 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 08:11:28,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:28,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:11:28,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:28,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 08:11:28,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:11:28,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:11:28,507 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand 4 states. [2018-11-23 08:11:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:28,554 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2018-11-23 08:11:28,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:11:28,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 08:11:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:28,555 INFO L225 Difference]: With dead ends: 67 [2018-11-23 08:11:28,555 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 08:11:28,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:11:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 08:11:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 08:11:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 08:11:28,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2018-11-23 08:11:28,560 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 19 [2018-11-23 08:11:28,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:28,561 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2018-11-23 08:11:28,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 08:11:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2018-11-23 08:11:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 08:11:28,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:28,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:28,562 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 08:11:28,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:28,562 INFO L82 PathProgramCache]: Analyzing trace with hash 975768462, now seen corresponding path program 1 times [2018-11-23 08:11:28,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:28,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:28,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:28,586 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 08:11:28,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:28,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:11:28,586 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:28,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 08:11:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:11:28,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:11:28,587 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 4 states. [2018-11-23 08:11:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:28,622 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2018-11-23 08:11:28,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:11:28,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 08:11:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:28,623 INFO L225 Difference]: With dead ends: 74 [2018-11-23 08:11:28,623 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 08:11:28,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-23 08:11:28,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 08:11:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2018-11-23 08:11:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 08:11:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2018-11-23 08:11:28,629 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 20 [2018-11-23 08:11:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:28,630 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2018-11-23 08:11:28,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 08:11:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2018-11-23 08:11:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 08:11:28,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:28,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:28,631 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 08:11:28,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:28,632 INFO L82 PathProgramCache]: Analyzing trace with hash 975774644, now seen corresponding path program 1 times [2018-11-23 08:11:28,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:28,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:28,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:28,670 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 08:11:28,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:28,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:11:28,670 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:28,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 08:11:28,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:11:28,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:11:28,671 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand 4 states. [2018-11-23 08:11:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:28,706 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2018-11-23 08:11:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:11:28,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 08:11:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:28,708 INFO L225 Difference]: With dead ends: 69 [2018-11-23 08:11:28,708 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 08:11:28,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-23 08:11:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 08:11:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2018-11-23 08:11:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 08:11:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2018-11-23 08:11:28,715 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 20 [2018-11-23 08:11:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:28,715 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2018-11-23 08:11:28,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 08:11:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2018-11-23 08:11:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 08:11:28,716 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:28,716 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:28,716 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 08:11:28,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:28,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1807650971, now seen corresponding path program 1 times [2018-11-23 08:11:28,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:28,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:28,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:28,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:28,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:11:28,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:11:28,765 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-23 08:11:28,767 INFO L202 CegarAbsIntRunner]: [0], [46], [55], [57], [64], [66], [73], [75], [82], [84], [91], [93], [102], [111], [112], [113], [115], [121], [122], [123] [2018-11-23 08:11:28,792 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 08:11:28,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 08:11:28,872 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 08:11:28,873 INFO L272 AbstractInterpreter]: Visited 20 different actions 20 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 9 variables. [2018-11-23 08:11:28,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:28,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 08:11:28,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:11:28,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/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-23 08:11:28,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:28,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:11:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:28,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:11:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:28,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:11:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:28,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:11:28,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2018-11-23 08:11:28,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:28,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 08:11:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:11:28,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:11:28,987 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand 4 states. [2018-11-23 08:11:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:29,009 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2018-11-23 08:11:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:11:29,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 08:11:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:29,009 INFO L225 Difference]: With dead ends: 72 [2018-11-23 08:11:29,009 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 08:11:29,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:11:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 08:11:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 08:11:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 08:11:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2018-11-23 08:11:29,014 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 21 [2018-11-23 08:11:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:29,014 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2018-11-23 08:11:29,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 08:11:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2018-11-23 08:11:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 08:11:29,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:29,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:29,015 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 08:11:29,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:29,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1410625968, now seen corresponding path program 1 times [2018-11-23 08:11:29,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:29,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:29,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:29,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:29,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:11:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:11:29,036 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #122#return; [?] CALL call #t~ret19 := main(); [?] ~d~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~x~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [main_~d~0=1, main_~x~0=2147483647, |main_#t~nondet9|=1] [?] assume 0 != #t~nondet9;havoc #t~nondet9; VAL [main_~d~0=1, main_~x~0=2147483647] [?] assume ~d~0 - 1 <= 2147483647; VAL [main_~d~0=1, main_~x~0=2147483647] [?] assume ~d~0 - 1 >= -2147483648;~d~0 := ~d~0 - 1; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647, |main_#t~nondet10|=0] [?] assume !(0 != #t~nondet10);havoc #t~nondet10; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647, |main_#t~nondet12|=0] [?] assume !(0 != #t~nondet12);havoc #t~nondet12; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647, |main_#t~nondet14|=0] [?] assume !(0 != #t~nondet14);havoc #t~nondet14; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647, |main_#t~nondet16|=0] [?] assume !(0 != #t~nondet16);havoc #t~nondet16; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647, |main_#t~nondet18|=1] [?] assume 0 != #t~nondet18;havoc #t~nondet18; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume ~d~0 - 1 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume ~d~0 - 1 >= -2147483648;~d~0 := ~d~0 - 1; VAL [main_~d~0=(- 1), main_~x~0=2147483647] [?] assume !!(~x~0 > 0); VAL [main_~d~0=(- 1), main_~x~0=2147483647] [?] assume !(~x~0 - ~d~0 <= 2147483647); VAL [main_~d~0=(- 1), main_~x~0=2147483647] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret19 := main(); [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [#t~nondet9=1, ~d~0=1, ~x~0=2147483647] [L56-L58] assume 0 != #t~nondet9; [L56] havoc #t~nondet9; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; VAL [~d~0=0, ~x~0=2147483647] [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [#t~nondet10=0, ~d~0=0, ~x~0=2147483647] [L61-L63] assume !(0 != #t~nondet10); [L61] havoc #t~nondet10; VAL [~d~0=0, ~x~0=2147483647] [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [#t~nondet12=0, ~d~0=0, ~x~0=2147483647] [L64-L66] assume !(0 != #t~nondet12); [L64] havoc #t~nondet12; VAL [~d~0=0, ~x~0=2147483647] [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [#t~nondet14=0, ~d~0=0, ~x~0=2147483647] [L67-L69] assume !(0 != #t~nondet14); [L67] havoc #t~nondet14; VAL [~d~0=0, ~x~0=2147483647] [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [#t~nondet16=0, ~d~0=0, ~x~0=2147483647] [L70-L72] assume !(0 != #t~nondet16); [L70] havoc #t~nondet16; VAL [~d~0=0, ~x~0=2147483647] [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [#t~nondet18=1, ~d~0=0, ~x~0=2147483647] [L76-L78] assume 0 != #t~nondet18; [L76] havoc #t~nondet18; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; VAL [~d~0=-1, ~x~0=2147483647] [L80-L82] assume !!(~x~0 > 0); VAL [~d~0=-1, ~x~0=2147483647] [L81] assert ~x~0 - ~d~0 <= 2147483647; VAL [~d~0=-1, ~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret19 := main(); [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [#t~nondet9=1, ~d~0=1, ~x~0=2147483647] [L56-L58] assume 0 != #t~nondet9; [L56] havoc #t~nondet9; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; VAL [~d~0=0, ~x~0=2147483647] [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [#t~nondet10=0, ~d~0=0, ~x~0=2147483647] [L61-L63] assume !(0 != #t~nondet10); [L61] havoc #t~nondet10; VAL [~d~0=0, ~x~0=2147483647] [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [#t~nondet12=0, ~d~0=0, ~x~0=2147483647] [L64-L66] assume !(0 != #t~nondet12); [L64] havoc #t~nondet12; VAL [~d~0=0, ~x~0=2147483647] [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [#t~nondet14=0, ~d~0=0, ~x~0=2147483647] [L67-L69] assume !(0 != #t~nondet14); [L67] havoc #t~nondet14; VAL [~d~0=0, ~x~0=2147483647] [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [#t~nondet16=0, ~d~0=0, ~x~0=2147483647] [L70-L72] assume !(0 != #t~nondet16); [L70] havoc #t~nondet16; VAL [~d~0=0, ~x~0=2147483647] [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [#t~nondet18=1, ~d~0=0, ~x~0=2147483647] [L76-L78] assume 0 != #t~nondet18; [L76] havoc #t~nondet18; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; VAL [~d~0=-1, ~x~0=2147483647] [L80-L82] assume !!(~x~0 > 0); VAL [~d~0=-1, ~x~0=2147483647] [L81] assert ~x~0 - ~d~0 <= 2147483647; VAL [~d~0=-1, ~x~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret19 := main(); [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [#t~nondet9=1, ~d~0=1, ~x~0=2147483647] [L56-L58] COND TRUE 0 != #t~nondet9 [L56] havoc #t~nondet9; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; VAL [~d~0=0, ~x~0=2147483647] [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [#t~nondet10=0, ~d~0=0, ~x~0=2147483647] [L61-L63] COND FALSE !(0 != #t~nondet10) [L61] havoc #t~nondet10; VAL [~d~0=0, ~x~0=2147483647] [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [#t~nondet12=0, ~d~0=0, ~x~0=2147483647] [L64-L66] COND FALSE !(0 != #t~nondet12) [L64] havoc #t~nondet12; VAL [~d~0=0, ~x~0=2147483647] [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [#t~nondet14=0, ~d~0=0, ~x~0=2147483647] [L67-L69] COND FALSE !(0 != #t~nondet14) [L67] havoc #t~nondet14; VAL [~d~0=0, ~x~0=2147483647] [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [#t~nondet16=0, ~d~0=0, ~x~0=2147483647] [L70-L72] COND FALSE !(0 != #t~nondet16) [L70] havoc #t~nondet16; VAL [~d~0=0, ~x~0=2147483647] [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [#t~nondet18=1, ~d~0=0, ~x~0=2147483647] [L76-L78] COND TRUE 0 != #t~nondet18 [L76] havoc #t~nondet18; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; VAL [~d~0=-1, ~x~0=2147483647] [L80-L82] COND FALSE !(!(~x~0 > 0)) VAL [~d~0=-1, ~x~0=2147483647] [L81] assert ~x~0 - ~d~0 <= 2147483647; VAL [~d~0=-1, ~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret19 := main(); [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [#t~nondet9=1, ~d~0=1, ~x~0=2147483647] [L56-L58] COND TRUE 0 != #t~nondet9 [L56] havoc #t~nondet9; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; VAL [~d~0=0, ~x~0=2147483647] [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [#t~nondet10=0, ~d~0=0, ~x~0=2147483647] [L61-L63] COND FALSE !(0 != #t~nondet10) [L61] havoc #t~nondet10; VAL [~d~0=0, ~x~0=2147483647] [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [#t~nondet12=0, ~d~0=0, ~x~0=2147483647] [L64-L66] COND FALSE !(0 != #t~nondet12) [L64] havoc #t~nondet12; VAL [~d~0=0, ~x~0=2147483647] [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [#t~nondet14=0, ~d~0=0, ~x~0=2147483647] [L67-L69] COND FALSE !(0 != #t~nondet14) [L67] havoc #t~nondet14; VAL [~d~0=0, ~x~0=2147483647] [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [#t~nondet16=0, ~d~0=0, ~x~0=2147483647] [L70-L72] COND FALSE !(0 != #t~nondet16) [L70] havoc #t~nondet16; VAL [~d~0=0, ~x~0=2147483647] [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [#t~nondet18=1, ~d~0=0, ~x~0=2147483647] [L76-L78] COND TRUE 0 != #t~nondet18 [L76] havoc #t~nondet18; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; VAL [~d~0=-1, ~x~0=2147483647] [L80-L82] COND FALSE !(!(~x~0 > 0)) VAL [~d~0=-1, ~x~0=2147483647] [L81] assert ~x~0 - ~d~0 <= 2147483647; VAL [~d~0=-1, ~x~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret19 := main(); [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [#t~nondet9=1, ~d~0=1, ~x~0=2147483647] [L56-L58] COND TRUE 0 != #t~nondet9 [L56] havoc #t~nondet9; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; VAL [~d~0=0, ~x~0=2147483647] [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [#t~nondet10=0, ~d~0=0, ~x~0=2147483647] [L61-L63] COND FALSE !(0 != #t~nondet10) [L61] havoc #t~nondet10; VAL [~d~0=0, ~x~0=2147483647] [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [#t~nondet12=0, ~d~0=0, ~x~0=2147483647] [L64-L66] COND FALSE !(0 != #t~nondet12) [L64] havoc #t~nondet12; VAL [~d~0=0, ~x~0=2147483647] [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [#t~nondet14=0, ~d~0=0, ~x~0=2147483647] [L67-L69] COND FALSE !(0 != #t~nondet14) [L67] havoc #t~nondet14; VAL [~d~0=0, ~x~0=2147483647] [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [#t~nondet16=0, ~d~0=0, ~x~0=2147483647] [L70-L72] COND FALSE !(0 != #t~nondet16) [L70] havoc #t~nondet16; VAL [~d~0=0, ~x~0=2147483647] [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [#t~nondet18=1, ~d~0=0, ~x~0=2147483647] [L76-L78] COND TRUE 0 != #t~nondet18 [L76] havoc #t~nondet18; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; VAL [~d~0=-1, ~x~0=2147483647] [L80-L82] COND FALSE !(!(~x~0 > 0)) VAL [~d~0=-1, ~x~0=2147483647] [L81] assert ~x~0 - ~d~0 <= 2147483647; VAL [~d~0=-1, ~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret19 := main(); [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [#t~nondet9=1, ~d~0=1, ~x~0=2147483647] [L56-L58] COND TRUE 0 != #t~nondet9 [L56] havoc #t~nondet9; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; VAL [~d~0=0, ~x~0=2147483647] [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [#t~nondet10=0, ~d~0=0, ~x~0=2147483647] [L61-L63] COND FALSE !(0 != #t~nondet10) [L61] havoc #t~nondet10; VAL [~d~0=0, ~x~0=2147483647] [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [#t~nondet12=0, ~d~0=0, ~x~0=2147483647] [L64-L66] COND FALSE !(0 != #t~nondet12) [L64] havoc #t~nondet12; VAL [~d~0=0, ~x~0=2147483647] [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [#t~nondet14=0, ~d~0=0, ~x~0=2147483647] [L67-L69] COND FALSE !(0 != #t~nondet14) [L67] havoc #t~nondet14; VAL [~d~0=0, ~x~0=2147483647] [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [#t~nondet16=0, ~d~0=0, ~x~0=2147483647] [L70-L72] COND FALSE !(0 != #t~nondet16) [L70] havoc #t~nondet16; VAL [~d~0=0, ~x~0=2147483647] [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [#t~nondet18=1, ~d~0=0, ~x~0=2147483647] [L76-L78] COND TRUE 0 != #t~nondet18 [L76] havoc #t~nondet18; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; VAL [~d~0=-1, ~x~0=2147483647] [L80-L82] COND FALSE !(!(~x~0 > 0)) VAL [~d~0=-1, ~x~0=2147483647] [L81] assert ~x~0 - ~d~0 <= 2147483647; VAL [~d~0=-1, ~x~0=2147483647] [L53] int d = 1; [L54] int x = __VERIFIER_nondet_int(); [L56] COND TRUE __VERIFIER_nondet_int() [L57] EXPR d - 1 [L57] d = d - 1 VAL [d=0, x=2147483647] [L61] COND FALSE !(__VERIFIER_nondet_int()) [L64] COND FALSE !(__VERIFIER_nondet_int()) [L67] COND FALSE !(__VERIFIER_nondet_int()) [L70] COND FALSE !(__VERIFIER_nondet_int()) [L76] COND TRUE __VERIFIER_nondet_int() [L77] EXPR d - 1 [L77] d = d - 1 VAL [d=-1, x=2147483647] [L80] COND TRUE x > 0 VAL [d=-1, x=2147483647] [L81] x - d VAL [d=-1, x=2147483647] ----- [2018-11-23 08:11:29,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:11:29 BoogieIcfgContainer [2018-11-23 08:11:29,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:11:29,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:11:29,059 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:11:29,059 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:11:29,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:28" (3/4) ... [2018-11-23 08:11:29,061 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 #122#return; [?] CALL call #t~ret19 := main(); [?] ~d~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~x~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [main_~d~0=1, main_~x~0=2147483647, |main_#t~nondet9|=1] [?] assume 0 != #t~nondet9;havoc #t~nondet9; VAL [main_~d~0=1, main_~x~0=2147483647] [?] assume ~d~0 - 1 <= 2147483647; VAL [main_~d~0=1, main_~x~0=2147483647] [?] assume ~d~0 - 1 >= -2147483648;~d~0 := ~d~0 - 1; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647, |main_#t~nondet10|=0] [?] assume !(0 != #t~nondet10);havoc #t~nondet10; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647, |main_#t~nondet12|=0] [?] assume !(0 != #t~nondet12);havoc #t~nondet12; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647, |main_#t~nondet14|=0] [?] assume !(0 != #t~nondet14);havoc #t~nondet14; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647, |main_#t~nondet16|=0] [?] assume !(0 != #t~nondet16);havoc #t~nondet16; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647, |main_#t~nondet18|=1] [?] assume 0 != #t~nondet18;havoc #t~nondet18; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume ~d~0 - 1 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647] [?] assume ~d~0 - 1 >= -2147483648;~d~0 := ~d~0 - 1; VAL [main_~d~0=(- 1), main_~x~0=2147483647] [?] assume !!(~x~0 > 0); VAL [main_~d~0=(- 1), main_~x~0=2147483647] [?] assume !(~x~0 - ~d~0 <= 2147483647); VAL [main_~d~0=(- 1), main_~x~0=2147483647] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret19 := main(); [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [#t~nondet9=1, ~d~0=1, ~x~0=2147483647] [L56-L58] assume 0 != #t~nondet9; [L56] havoc #t~nondet9; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; VAL [~d~0=0, ~x~0=2147483647] [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [#t~nondet10=0, ~d~0=0, ~x~0=2147483647] [L61-L63] assume !(0 != #t~nondet10); [L61] havoc #t~nondet10; VAL [~d~0=0, ~x~0=2147483647] [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [#t~nondet12=0, ~d~0=0, ~x~0=2147483647] [L64-L66] assume !(0 != #t~nondet12); [L64] havoc #t~nondet12; VAL [~d~0=0, ~x~0=2147483647] [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [#t~nondet14=0, ~d~0=0, ~x~0=2147483647] [L67-L69] assume !(0 != #t~nondet14); [L67] havoc #t~nondet14; VAL [~d~0=0, ~x~0=2147483647] [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [#t~nondet16=0, ~d~0=0, ~x~0=2147483647] [L70-L72] assume !(0 != #t~nondet16); [L70] havoc #t~nondet16; VAL [~d~0=0, ~x~0=2147483647] [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [#t~nondet18=1, ~d~0=0, ~x~0=2147483647] [L76-L78] assume 0 != #t~nondet18; [L76] havoc #t~nondet18; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; VAL [~d~0=-1, ~x~0=2147483647] [L80-L82] assume !!(~x~0 > 0); VAL [~d~0=-1, ~x~0=2147483647] [L81] assert ~x~0 - ~d~0 <= 2147483647; VAL [~d~0=-1, ~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret19 := main(); [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [#t~nondet9=1, ~d~0=1, ~x~0=2147483647] [L56-L58] assume 0 != #t~nondet9; [L56] havoc #t~nondet9; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; VAL [~d~0=0, ~x~0=2147483647] [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [#t~nondet10=0, ~d~0=0, ~x~0=2147483647] [L61-L63] assume !(0 != #t~nondet10); [L61] havoc #t~nondet10; VAL [~d~0=0, ~x~0=2147483647] [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [#t~nondet12=0, ~d~0=0, ~x~0=2147483647] [L64-L66] assume !(0 != #t~nondet12); [L64] havoc #t~nondet12; VAL [~d~0=0, ~x~0=2147483647] [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [#t~nondet14=0, ~d~0=0, ~x~0=2147483647] [L67-L69] assume !(0 != #t~nondet14); [L67] havoc #t~nondet14; VAL [~d~0=0, ~x~0=2147483647] [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [#t~nondet16=0, ~d~0=0, ~x~0=2147483647] [L70-L72] assume !(0 != #t~nondet16); [L70] havoc #t~nondet16; VAL [~d~0=0, ~x~0=2147483647] [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [#t~nondet18=1, ~d~0=0, ~x~0=2147483647] [L76-L78] assume 0 != #t~nondet18; [L76] havoc #t~nondet18; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; VAL [~d~0=-1, ~x~0=2147483647] [L80-L82] assume !!(~x~0 > 0); VAL [~d~0=-1, ~x~0=2147483647] [L81] assert ~x~0 - ~d~0 <= 2147483647; VAL [~d~0=-1, ~x~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret19 := main(); [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [#t~nondet9=1, ~d~0=1, ~x~0=2147483647] [L56-L58] COND TRUE 0 != #t~nondet9 [L56] havoc #t~nondet9; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; VAL [~d~0=0, ~x~0=2147483647] [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [#t~nondet10=0, ~d~0=0, ~x~0=2147483647] [L61-L63] COND FALSE !(0 != #t~nondet10) [L61] havoc #t~nondet10; VAL [~d~0=0, ~x~0=2147483647] [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [#t~nondet12=0, ~d~0=0, ~x~0=2147483647] [L64-L66] COND FALSE !(0 != #t~nondet12) [L64] havoc #t~nondet12; VAL [~d~0=0, ~x~0=2147483647] [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [#t~nondet14=0, ~d~0=0, ~x~0=2147483647] [L67-L69] COND FALSE !(0 != #t~nondet14) [L67] havoc #t~nondet14; VAL [~d~0=0, ~x~0=2147483647] [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [#t~nondet16=0, ~d~0=0, ~x~0=2147483647] [L70-L72] COND FALSE !(0 != #t~nondet16) [L70] havoc #t~nondet16; VAL [~d~0=0, ~x~0=2147483647] [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [#t~nondet18=1, ~d~0=0, ~x~0=2147483647] [L76-L78] COND TRUE 0 != #t~nondet18 [L76] havoc #t~nondet18; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; VAL [~d~0=-1, ~x~0=2147483647] [L80-L82] COND FALSE !(!(~x~0 > 0)) VAL [~d~0=-1, ~x~0=2147483647] [L81] assert ~x~0 - ~d~0 <= 2147483647; VAL [~d~0=-1, ~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret19 := main(); [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [#t~nondet9=1, ~d~0=1, ~x~0=2147483647] [L56-L58] COND TRUE 0 != #t~nondet9 [L56] havoc #t~nondet9; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; VAL [~d~0=0, ~x~0=2147483647] [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [#t~nondet10=0, ~d~0=0, ~x~0=2147483647] [L61-L63] COND FALSE !(0 != #t~nondet10) [L61] havoc #t~nondet10; VAL [~d~0=0, ~x~0=2147483647] [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [#t~nondet12=0, ~d~0=0, ~x~0=2147483647] [L64-L66] COND FALSE !(0 != #t~nondet12) [L64] havoc #t~nondet12; VAL [~d~0=0, ~x~0=2147483647] [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [#t~nondet14=0, ~d~0=0, ~x~0=2147483647] [L67-L69] COND FALSE !(0 != #t~nondet14) [L67] havoc #t~nondet14; VAL [~d~0=0, ~x~0=2147483647] [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [#t~nondet16=0, ~d~0=0, ~x~0=2147483647] [L70-L72] COND FALSE !(0 != #t~nondet16) [L70] havoc #t~nondet16; VAL [~d~0=0, ~x~0=2147483647] [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [#t~nondet18=1, ~d~0=0, ~x~0=2147483647] [L76-L78] COND TRUE 0 != #t~nondet18 [L76] havoc #t~nondet18; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; VAL [~d~0=-1, ~x~0=2147483647] [L80-L82] COND FALSE !(!(~x~0 > 0)) VAL [~d~0=-1, ~x~0=2147483647] [L81] assert ~x~0 - ~d~0 <= 2147483647; VAL [~d~0=-1, ~x~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret19 := main(); [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [#t~nondet9=1, ~d~0=1, ~x~0=2147483647] [L56-L58] COND TRUE 0 != #t~nondet9 [L56] havoc #t~nondet9; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; VAL [~d~0=0, ~x~0=2147483647] [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [#t~nondet10=0, ~d~0=0, ~x~0=2147483647] [L61-L63] COND FALSE !(0 != #t~nondet10) [L61] havoc #t~nondet10; VAL [~d~0=0, ~x~0=2147483647] [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [#t~nondet12=0, ~d~0=0, ~x~0=2147483647] [L64-L66] COND FALSE !(0 != #t~nondet12) [L64] havoc #t~nondet12; VAL [~d~0=0, ~x~0=2147483647] [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [#t~nondet14=0, ~d~0=0, ~x~0=2147483647] [L67-L69] COND FALSE !(0 != #t~nondet14) [L67] havoc #t~nondet14; VAL [~d~0=0, ~x~0=2147483647] [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [#t~nondet16=0, ~d~0=0, ~x~0=2147483647] [L70-L72] COND FALSE !(0 != #t~nondet16) [L70] havoc #t~nondet16; VAL [~d~0=0, ~x~0=2147483647] [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [#t~nondet18=1, ~d~0=0, ~x~0=2147483647] [L76-L78] COND TRUE 0 != #t~nondet18 [L76] havoc #t~nondet18; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; VAL [~d~0=-1, ~x~0=2147483647] [L80-L82] COND FALSE !(!(~x~0 > 0)) VAL [~d~0=-1, ~x~0=2147483647] [L81] assert ~x~0 - ~d~0 <= 2147483647; VAL [~d~0=-1, ~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret19 := main(); [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; VAL [#t~nondet9=1, ~d~0=1, ~x~0=2147483647] [L56-L58] COND TRUE 0 != #t~nondet9 [L56] havoc #t~nondet9; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=1, ~x~0=2147483647] [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; VAL [~d~0=0, ~x~0=2147483647] [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; VAL [#t~nondet10=0, ~d~0=0, ~x~0=2147483647] [L61-L63] COND FALSE !(0 != #t~nondet10) [L61] havoc #t~nondet10; VAL [~d~0=0, ~x~0=2147483647] [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; VAL [#t~nondet12=0, ~d~0=0, ~x~0=2147483647] [L64-L66] COND FALSE !(0 != #t~nondet12) [L64] havoc #t~nondet12; VAL [~d~0=0, ~x~0=2147483647] [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; VAL [#t~nondet14=0, ~d~0=0, ~x~0=2147483647] [L67-L69] COND FALSE !(0 != #t~nondet14) [L67] havoc #t~nondet14; VAL [~d~0=0, ~x~0=2147483647] [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; VAL [#t~nondet16=0, ~d~0=0, ~x~0=2147483647] [L70-L72] COND FALSE !(0 != #t~nondet16) [L70] havoc #t~nondet16; VAL [~d~0=0, ~x~0=2147483647] [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; VAL [#t~nondet18=1, ~d~0=0, ~x~0=2147483647] [L76-L78] COND TRUE 0 != #t~nondet18 [L76] havoc #t~nondet18; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 <= 2147483647; VAL [~d~0=0, ~x~0=2147483647] [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; VAL [~d~0=-1, ~x~0=2147483647] [L80-L82] COND FALSE !(!(~x~0 > 0)) VAL [~d~0=-1, ~x~0=2147483647] [L81] assert ~x~0 - ~d~0 <= 2147483647; VAL [~d~0=-1, ~x~0=2147483647] [L53] int d = 1; [L54] int x = __VERIFIER_nondet_int(); [L56] COND TRUE __VERIFIER_nondet_int() [L57] EXPR d - 1 [L57] d = d - 1 VAL [d=0, x=2147483647] [L61] COND FALSE !(__VERIFIER_nondet_int()) [L64] COND FALSE !(__VERIFIER_nondet_int()) [L67] COND FALSE !(__VERIFIER_nondet_int()) [L70] COND FALSE !(__VERIFIER_nondet_int()) [L76] COND TRUE __VERIFIER_nondet_int() [L77] EXPR d - 1 [L77] d = d - 1 VAL [d=-1, x=2147483647] [L80] COND TRUE x > 0 VAL [d=-1, x=2147483647] [L81] x - d VAL [d=-1, x=2147483647] ----- [2018-11-23 08:11:29,098 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f4dec3e1-70c1-4eb0-ae1e-33e1844078c2/bin-2019/utaipan/witness.graphml [2018-11-23 08:11:29,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:11:29,099 INFO L168 Benchmark]: Toolchain (without parser) took 1489.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 959.1 MB in the beginning and 1.0 GB in the end (delta: -51.1 MB). Peak memory consumption was 110.9 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:29,100 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-23 08:11:29,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.71 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:29,101 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.15 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:29,101 INFO L168 Benchmark]: Boogie Preprocessor took 18.59 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:11:29,102 INFO L168 Benchmark]: RCFGBuilder took 249.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:29,102 INFO L168 Benchmark]: TraceAbstraction took 1012.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 128.4 MB). Peak memory consumption was 128.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:29,103 INFO L168 Benchmark]: Witness Printer took 40.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:11:29,104 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 153.71 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 13.15 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.59 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 249.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1012.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 128.4 MB). Peak memory consumption was 128.4 MB. Max. memory is 11.5 GB. * Witness Printer took 40.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 81]: integer overflow possible integer overflow possible We found a FailurePath: [L53] int d = 1; [L54] int x = __VERIFIER_nondet_int(); [L56] COND TRUE __VERIFIER_nondet_int() [L57] EXPR d - 1 [L57] d = d - 1 VAL [d=0, x=2147483647] [L61] COND FALSE !(__VERIFIER_nondet_int()) [L64] COND FALSE !(__VERIFIER_nondet_int()) [L67] COND FALSE !(__VERIFIER_nondet_int()) [L70] COND FALSE !(__VERIFIER_nondet_int()) [L76] COND TRUE __VERIFIER_nondet_int() [L77] EXPR d - 1 [L77] d = d - 1 VAL [d=-1, x=2147483647] [L80] COND TRUE x > 0 VAL [d=-1, x=2147483647] [L81] x - d VAL [d=-1, x=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 6 error locations. UNSAFE Result, 0.9s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 400 SDtfs, 178 SDslu, 404 SDs, 0 SdLazy, 131 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 10424 SizeOfPredicates, 1 NumberOfNonLiveVariables, 47 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 2/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...