./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_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer --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 Automizer --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 14:23:07,628 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:23:07,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:23:07,636 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:23:07,637 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:23:07,637 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:23:07,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:23:07,640 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:23:07,641 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:23:07,641 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:23:07,642 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:23:07,642 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:23:07,643 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:23:07,644 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:23:07,645 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:23:07,645 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:23:07,646 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:23:07,647 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:23:07,649 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:23:07,650 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:23:07,651 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:23:07,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:23:07,653 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:23:07,653 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:23:07,653 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:23:07,654 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:23:07,655 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:23:07,655 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:23:07,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:23:07,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:23:07,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:23:07,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:23:07,658 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:23:07,658 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:23:07,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:23:07,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:23:07,659 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-23 14:23:07,670 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:23:07,670 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:23:07,671 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:23:07,671 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:23:07,671 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:23:07,672 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:23:07,672 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:23:07,672 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:23:07,672 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:23:07,672 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:23:07,672 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:23:07,672 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:23:07,673 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:23:07,673 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:23:07,673 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 14:23:07,673 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:23:07,673 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:23:07,673 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:23:07,673 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:23:07,674 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:23:07,674 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:23:07,674 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:23:07,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:23:07,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:23:07,674 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:23:07,674 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:23:07,675 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:23:07,675 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:23:07,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:23:07,675 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ff697c57265298ce2261966fa58c440777fc865 [2018-11-23 14:23:07,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:23:07,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:23:07,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:23:07,711 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:23:07,712 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:23:07,712 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c [2018-11-23 14:23:07,759 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/data/a1f810620/4374055010c442869c2c72c5e705133a/FLAG847a815fb [2018-11-23 14:23:08,156 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:23:08,156 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c [2018-11-23 14:23:08,160 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/data/a1f810620/4374055010c442869c2c72c5e705133a/FLAG847a815fb [2018-11-23 14:23:08,171 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/data/a1f810620/4374055010c442869c2c72c5e705133a [2018-11-23 14:23:08,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:23:08,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:23:08,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:23:08,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:23:08,179 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:23:08,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:23:08" (1/1) ... [2018-11-23 14:23:08,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391d636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08, skipping insertion in model container [2018-11-23 14:23:08,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:23:08" (1/1) ... [2018-11-23 14:23:08,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:23:08,204 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:23:08,306 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:23:08,308 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:23:08,319 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:23:08,327 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:23:08,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08 WrapperNode [2018-11-23 14:23:08,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:23:08,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:23:08,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:23:08,328 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:23:08,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08" (1/1) ... [2018-11-23 14:23:08,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08" (1/1) ... [2018-11-23 14:23:08,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:23:08,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:23:08,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:23:08,340 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:23:08,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08" (1/1) ... [2018-11-23 14:23:08,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08" (1/1) ... [2018-11-23 14:23:08,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08" (1/1) ... [2018-11-23 14:23:08,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08" (1/1) ... [2018-11-23 14:23:08,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08" (1/1) ... [2018-11-23 14:23:08,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08" (1/1) ... [2018-11-23 14:23:08,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08" (1/1) ... [2018-11-23 14:23:08,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:23:08,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:23:08,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:23:08,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:23:08,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:23:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:23:08,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:23:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-23 14:23:08,428 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-23 14:23:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:23:08,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:23:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:23:08,428 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:23:08,581 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:23:08,581 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 14:23:08,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:23:08 BoogieIcfgContainer [2018-11-23 14:23:08,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:23:08,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:23:08,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:23:08,585 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:23:08,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:23:08" (1/3) ... [2018-11-23 14:23:08,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5409c23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:23:08, skipping insertion in model container [2018-11-23 14:23:08,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:08" (2/3) ... [2018-11-23 14:23:08,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5409c23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:23:08, skipping insertion in model container [2018-11-23 14:23:08,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:23:08" (3/3) ... [2018-11-23 14:23:08,588 INFO L112 eAbstractionObserver]: Analyzing ICFG HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c [2018-11-23 14:23:08,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:23:08,601 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-23 14:23:08,614 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-23 14:23:08,638 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:23:08,638 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:23:08,638 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:23:08,638 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:23:08,639 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:23:08,639 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:23:08,639 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:23:08,639 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:23:08,639 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:23:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-23 14:23:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 14:23:08,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:23:08,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:23:08,658 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 14:23:08,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:23:08,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1872952966, now seen corresponding path program 1 times [2018-11-23 14:23:08,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:23:08,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:23:08,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:08,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:23:08,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:23:08,751 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 14:23:08,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:23:08,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:23:08,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:23:08,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:23:08,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:23:08,768 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-11-23 14:23:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:23:08,811 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2018-11-23 14:23:08,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:23:08,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 14:23:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:23:08,818 INFO L225 Difference]: With dead ends: 58 [2018-11-23 14:23:08,818 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 14:23:08,821 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 14:23:08,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 14:23:08,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 14:23:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 14:23:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2018-11-23 14:23:08,851 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 7 [2018-11-23 14:23:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:23:08,851 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2018-11-23 14:23:08,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:23:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2018-11-23 14:23:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 14:23:08,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:23:08,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:23:08,852 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 14:23:08,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:23:08,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2068000115, now seen corresponding path program 1 times [2018-11-23 14:23:08,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:23:08,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:23:08,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:08,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:23:08,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:23:08,879 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 14:23:08,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:23:08,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:23:08,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:23:08,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:23:08,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:23:08,881 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand 3 states. [2018-11-23 14:23:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:23:08,923 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2018-11-23 14:23:08,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:23:08,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 14:23:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:23:08,925 INFO L225 Difference]: With dead ends: 72 [2018-11-23 14:23:08,925 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 14:23:08,926 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 14:23:08,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 14:23:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2018-11-23 14:23:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 14:23:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2018-11-23 14:23:08,932 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 8 [2018-11-23 14:23:08,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:23:08,932 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2018-11-23 14:23:08,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:23:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2018-11-23 14:23:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 14:23:08,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:23:08,933 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 14:23:08,934 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 14:23:08,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:23:08,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1576559192, now seen corresponding path program 1 times [2018-11-23 14:23:08,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:23:08,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:23:08,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:08,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:23:08,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:23:08,966 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 14:23:08,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:23:08,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:23:08,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:23:08,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:23:08,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:23:08,967 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand 3 states. [2018-11-23 14:23:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:23:09,005 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2018-11-23 14:23:09,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:23:09,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 14:23:09,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:23:09,008 INFO L225 Difference]: With dead ends: 69 [2018-11-23 14:23:09,008 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 14:23:09,008 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 14:23:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 14:23:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-11-23 14:23:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 14:23:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2018-11-23 14:23:09,016 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 18 [2018-11-23 14:23:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:23:09,016 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2018-11-23 14:23:09,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:23:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2018-11-23 14:23:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:23:09,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:23:09,018 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 14:23:09,018 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 14:23:09,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:23:09,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1628694841, now seen corresponding path program 1 times [2018-11-23 14:23:09,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:23:09,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:23:09,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:09,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:23:09,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:23:09,048 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 14:23:09,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:23:09,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:23:09,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:23:09,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:23:09,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:23:09,049 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand 4 states. [2018-11-23 14:23:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:23:09,092 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2018-11-23 14:23:09,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:23:09,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 14:23:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:23:09,094 INFO L225 Difference]: With dead ends: 67 [2018-11-23 14:23:09,094 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 14:23:09,094 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 14:23:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 14:23:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 14:23:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 14:23:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2018-11-23 14:23:09,100 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 19 [2018-11-23 14:23:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:23:09,101 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2018-11-23 14:23:09,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:23:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2018-11-23 14:23:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:23:09,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:23:09,102 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 14:23:09,102 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 14:23:09,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:23:09,103 INFO L82 PathProgramCache]: Analyzing trace with hash 975768462, now seen corresponding path program 1 times [2018-11-23 14:23:09,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:23:09,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:23:09,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:09,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:23:09,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:23:09,155 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 14:23:09,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:23:09,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:23:09,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:23:09,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:23:09,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:23:09,156 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 4 states. [2018-11-23 14:23:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:23:09,178 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2018-11-23 14:23:09,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:23:09,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 14:23:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:23:09,179 INFO L225 Difference]: With dead ends: 74 [2018-11-23 14:23:09,179 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 14:23:09,180 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 14:23:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 14:23:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2018-11-23 14:23:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 14:23:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2018-11-23 14:23:09,186 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 20 [2018-11-23 14:23:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:23:09,187 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2018-11-23 14:23:09,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:23:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2018-11-23 14:23:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:23:09,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:23:09,188 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 14:23:09,188 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 14:23:09,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:23:09,189 INFO L82 PathProgramCache]: Analyzing trace with hash 975774644, now seen corresponding path program 1 times [2018-11-23 14:23:09,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:23:09,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:23:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:09,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:23:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:23:09,213 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 14:23:09,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:23:09,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:23:09,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:23:09,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:23:09,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:23:09,214 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand 4 states. [2018-11-23 14:23:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:23:09,247 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2018-11-23 14:23:09,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:23:09,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 14:23:09,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:23:09,248 INFO L225 Difference]: With dead ends: 69 [2018-11-23 14:23:09,248 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 14:23:09,248 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 14:23:09,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 14:23:09,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2018-11-23 14:23:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 14:23:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2018-11-23 14:23:09,254 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 20 [2018-11-23 14:23:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:23:09,255 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2018-11-23 14:23:09,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:23:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2018-11-23 14:23:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 14:23:09,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:23:09,256 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 14:23:09,256 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 14:23:09,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:23:09,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1807650971, now seen corresponding path program 1 times [2018-11-23 14:23:09,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:23:09,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:23:09,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:09,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:23:09,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:23:09,297 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 14:23:09,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:23:09,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:23:09,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:23:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:23:09,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:23:09,367 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 14:23:09,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 14:23:09,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-23 14:23:09,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 14:23:09,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 14:23:09,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:23:09,383 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand 7 states. [2018-11-23 14:23:09,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:23:09,420 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2018-11-23 14:23:09,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:23:09,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 14:23:09,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:23:09,421 INFO L225 Difference]: With dead ends: 72 [2018-11-23 14:23:09,421 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 14:23:09,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:23:09,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 14:23:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 14:23:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 14:23:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2018-11-23 14:23:09,427 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 21 [2018-11-23 14:23:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:23:09,428 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2018-11-23 14:23:09,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 14:23:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2018-11-23 14:23:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 14:23:09,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:23:09,429 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 14:23:09,429 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 14:23:09,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:23:09,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1410625968, now seen corresponding path program 1 times [2018-11-23 14:23:09,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:23:09,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:23:09,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:09,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:23:09,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:23:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:23:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:23:09,453 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 14:23:09,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:23:09 BoogieIcfgContainer [2018-11-23 14:23:09,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:23:09,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:23:09,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:23:09,480 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:23:09,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:23:08" (3/4) ... [2018-11-23 14:23:09,483 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 14:23:09,521 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3e2047e8-a715-47a5-8e4e-36eb2f447633/bin-2019/uautomizer/witness.graphml [2018-11-23 14:23:09,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:23:09,521 INFO L168 Benchmark]: Toolchain (without parser) took 1347.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 961.9 MB in the beginning and 1.0 GB in the end (delta: -48.2 MB). Peak memory consumption was 89.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:23:09,522 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:23:09,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.82 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:23:09,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.14 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:23:09,523 INFO L168 Benchmark]: Boogie Preprocessor took 14.01 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:23:09,523 INFO L168 Benchmark]: RCFGBuilder took 227.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:23:09,523 INFO L168 Benchmark]: TraceAbstraction took 897.23 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: 107.6 MB). Peak memory consumption was 107.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:23:09,524 INFO L168 Benchmark]: Witness Printer took 41.00 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 14:23:09,526 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.82 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 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 12.14 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.01 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 227.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 897.23 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: 107.6 MB). Peak memory consumption was 107.6 MB. Max. memory is 11.5 GB. * Witness Printer took 41.00 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.8s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 400 SDtfs, 227 SDslu, 501 SDs, 0 SdLazy, 144 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 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.0s AbstIntTime, 0 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, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 8184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 47 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...