./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/Toulouse-BranchesToLoop_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_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/Toulouse-BranchesToLoop_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 46206f7a86b26e5772618ef155399955c07418b5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:31:12,985 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:31:12,987 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:31:12,993 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:31:12,993 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:31:12,994 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:31:12,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:31:12,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:31:12,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:31:12,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:31:12,998 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:31:12,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:31:12,998 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:31:12,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:31:13,000 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:31:13,000 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:31:13,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:31:13,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:31:13,003 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:31:13,005 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:31:13,006 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:31:13,006 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:31:13,008 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:31:13,008 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:31:13,008 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:31:13,009 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:31:13,010 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:31:13,010 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:31:13,011 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:31:13,012 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:31:13,012 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:31:13,012 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:31:13,012 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:31:13,012 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:31:13,013 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:31:13,013 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:31:13,014 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-23 07:31:13,023 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:31:13,024 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:31:13,024 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:31:13,024 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 07:31:13,025 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 07:31:13,025 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 07:31:13,025 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 07:31:13,025 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 07:31:13,025 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 07:31:13,025 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 07:31:13,025 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 07:31:13,025 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 07:31:13,025 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 07:31:13,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:31:13,026 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:31:13,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:31:13,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:31:13,026 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:31:13,026 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:31:13,026 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:31:13,027 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 07:31:13,027 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:31:13,027 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:31:13,027 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:31:13,027 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:31:13,029 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:31:13,029 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:31:13,029 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 07:31:13,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:31:13,029 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:31:13,029 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:31:13,030 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:31:13,030 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 07:31:13,030 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:31:13,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:31:13,030 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 07:31:13,030 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46206f7a86b26e5772618ef155399955c07418b5 [2018-11-23 07:31:13,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:31:13,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:31:13,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:31:13,062 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:31:13,062 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:31:13,063 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/Toulouse-BranchesToLoop_false-no-overflow.c [2018-11-23 07:31:13,097 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan/data/3366a9b79/8ad1ac81ea8045c78b80dc928e21d314/FLAGd614bb6a6 [2018-11-23 07:31:13,493 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:31:13,494 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/sv-benchmarks/c/termination-crafted/Toulouse-BranchesToLoop_false-no-overflow.c [2018-11-23 07:31:13,497 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan/data/3366a9b79/8ad1ac81ea8045c78b80dc928e21d314/FLAGd614bb6a6 [2018-11-23 07:31:13,506 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan/data/3366a9b79/8ad1ac81ea8045c78b80dc928e21d314 [2018-11-23 07:31:13,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:31:13,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:31:13,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:31:13,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:31:13,511 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:31:13,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:31:13" (1/1) ... [2018-11-23 07:31:13,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa4fa66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13, skipping insertion in model container [2018-11-23 07:31:13,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:31:13" (1/1) ... [2018-11-23 07:31:13,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:31:13,532 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:31:13,637 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:31:13,640 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:31:13,649 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:31:13,657 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:31:13,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13 WrapperNode [2018-11-23 07:31:13,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:31:13,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:31:13,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:31:13,659 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:31:13,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13" (1/1) ... [2018-11-23 07:31:13,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13" (1/1) ... [2018-11-23 07:31:13,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:31:13,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:31:13,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:31:13,672 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:31:13,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13" (1/1) ... [2018-11-23 07:31:13,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13" (1/1) ... [2018-11-23 07:31:13,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13" (1/1) ... [2018-11-23 07:31:13,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13" (1/1) ... [2018-11-23 07:31:13,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13" (1/1) ... [2018-11-23 07:31:13,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13" (1/1) ... [2018-11-23 07:31:13,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13" (1/1) ... [2018-11-23 07:31:13,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:31:13,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:31:13,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:31:13,685 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:31:13,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:31:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 07:31:13,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 07:31:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:31:13,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:31:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 07:31:13,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 07:31:13,882 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:31:13,882 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 07:31:13,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:31:13 BoogieIcfgContainer [2018-11-23 07:31:13,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:31:13,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 07:31:13,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 07:31:13,886 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 07:31:13,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:31:13" (1/3) ... [2018-11-23 07:31:13,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6d6f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:31:13, skipping insertion in model container [2018-11-23 07:31:13,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:31:13" (2/3) ... [2018-11-23 07:31:13,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6d6f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:31:13, skipping insertion in model container [2018-11-23 07:31:13,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:31:13" (3/3) ... [2018-11-23 07:31:13,888 INFO L112 eAbstractionObserver]: Analyzing ICFG Toulouse-BranchesToLoop_false-no-overflow.c [2018-11-23 07:31:13,894 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 07:31:13,898 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 07:31:13,910 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 07:31:13,936 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 07:31:13,936 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 07:31:13,936 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 07:31:13,936 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:31:13,936 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:31:13,937 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 07:31:13,937 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:31:13,937 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 07:31:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 07:31:13,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 07:31:13,952 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:31:13,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:31:13,954 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:31:13,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:31:13,958 INFO L82 PathProgramCache]: Analyzing trace with hash -895810426, now seen corresponding path program 1 times [2018-11-23 07:31:13,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:31:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:31:13,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:31:13,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:31:13,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:31:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:31:14,066 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 07:31:14,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:31:14,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:31:14,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:31:14,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 07:31:14,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 07:31:14,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 07:31:14,084 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2018-11-23 07:31:14,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:31:14,141 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 07:31:14,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 07:31:14,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-23 07:31:14,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:31:14,150 INFO L225 Difference]: With dead ends: 25 [2018-11-23 07:31:14,150 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 07:31:14,153 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 07:31:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 07:31:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 07:31:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 07:31:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 07:31:14,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 8 [2018-11-23 07:31:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:31:14,175 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 07:31:14,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 07:31:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 07:31:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 07:31:14,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:31:14,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:31:14,176 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:31:14,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:31:14,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2000319378, now seen corresponding path program 1 times [2018-11-23 07:31:14,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:31:14,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:31:14,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:31:14,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:31:14,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:31:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:31:14,225 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 07:31:14,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:31:14,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:31:14,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:31:14,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 07:31:14,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 07:31:14,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 07:31:14,227 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 4 states. [2018-11-23 07:31:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:31:14,274 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 07:31:14,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 07:31:14,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-23 07:31:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:31:14,275 INFO L225 Difference]: With dead ends: 18 [2018-11-23 07:31:14,275 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 07:31:14,276 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 07:31:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 07:31:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 07:31:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 07:31:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 07:31:14,278 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2018-11-23 07:31:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:31:14,278 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 07:31:14,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 07:31:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 07:31:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 07:31:14,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:31:14,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:31:14,279 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:31:14,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:31:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2000259796, now seen corresponding path program 1 times [2018-11-23 07:31:14,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:31:14,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:31:14,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:31:14,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:31:14,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:31:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:31:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:31:14,302 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #33#return; [?] CALL call #t~ret3 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~y~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~z~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~y~0=(- 2147483648), main_~z~0=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2;~x~0 := -1; VAL [main_~x~0=(- 1), main_~y~0=(- 2147483648), main_~z~0=0] [?] assume !!(~y~0 < 100 && ~z~0 < 100); VAL [main_~x~0=(- 1), main_~y~0=(- 2147483648), main_~z~0=0] [?] assume ~y~0 + ~x~0 <= 2147483647; VAL [main_~x~0=(- 1), main_~y~0=(- 2147483648), main_~z~0=0] [?] assume !(~y~0 + ~x~0 >= -2147483648); VAL [main_~x~0=(- 1), main_~y~0=(- 2147483648), main_~z~0=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483648, ~z~0=0] [L19-L23] assume !(0 != #t~nondet2); [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L24-L27] assume !!(~y~0 < 100 && ~z~0 < 100); VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483648, ~z~0=0] [L19-L23] assume !(0 != #t~nondet2); [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L24-L27] assume !!(~y~0 < 100 && ~z~0 < 100); VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483648, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L24-L27] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483648, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L24-L27] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483648, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L24-L27] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483648, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L24-L27] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L14] int x; [L15] int y; [L16] int z; [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L19] COND FALSE !(__VERIFIER_nondet_int() != 0) [L22] x = -1 VAL [x=-1, y=-2147483648, z=0] [L24] COND TRUE y<100 && z<100 VAL [x=-1, y=-2147483648, z=0] [L25] y+x VAL [x=-1, y=-2147483648, z=0] ----- [2018-11-23 07:31:14,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:31:14 BoogieIcfgContainer [2018-11-23 07:31:14,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 07:31:14,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:31:14,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:31:14,320 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:31:14,321 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:31:13" (3/4) ... [2018-11-23 07:31:14,322 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 #33#return; [?] CALL call #t~ret3 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~y~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~z~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~y~0=(- 2147483648), main_~z~0=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2;~x~0 := -1; VAL [main_~x~0=(- 1), main_~y~0=(- 2147483648), main_~z~0=0] [?] assume !!(~y~0 < 100 && ~z~0 < 100); VAL [main_~x~0=(- 1), main_~y~0=(- 2147483648), main_~z~0=0] [?] assume ~y~0 + ~x~0 <= 2147483647; VAL [main_~x~0=(- 1), main_~y~0=(- 2147483648), main_~z~0=0] [?] assume !(~y~0 + ~x~0 >= -2147483648); VAL [main_~x~0=(- 1), main_~y~0=(- 2147483648), main_~z~0=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483648, ~z~0=0] [L19-L23] assume !(0 != #t~nondet2); [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L24-L27] assume !!(~y~0 < 100 && ~z~0 < 100); VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483648, ~z~0=0] [L19-L23] assume !(0 != #t~nondet2); [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L24-L27] assume !!(~y~0 < 100 && ~z~0 < 100); VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483648, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L24-L27] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483648, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L24-L27] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483648, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L24-L27] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483648, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L24-L27] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L25] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-1, ~y~0=-2147483648, ~z~0=0] [L14] int x; [L15] int y; [L16] int z; [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L19] COND FALSE !(__VERIFIER_nondet_int() != 0) [L22] x = -1 VAL [x=-1, y=-2147483648, z=0] [L24] COND TRUE y<100 && z<100 VAL [x=-1, y=-2147483648, z=0] [L25] y+x VAL [x=-1, y=-2147483648, z=0] ----- [2018-11-23 07:31:14,354 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9e7fc06a-9490-4f23-ae9d-ea6df0919407/bin-2019/utaipan/witness.graphml [2018-11-23 07:31:14,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:31:14,355 INFO L168 Benchmark]: Toolchain (without parser) took 846.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -102.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-23 07:31:14,355 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:31:14,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.05 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:31:14,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.94 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:31:14,356 INFO L168 Benchmark]: Boogie Preprocessor took 12.85 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:31:14,357 INFO L168 Benchmark]: RCFGBuilder took 198.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:31:14,357 INFO L168 Benchmark]: TraceAbstraction took 436.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:31:14,358 INFO L168 Benchmark]: Witness Printer took 33.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:31:14,360 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.05 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.94 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.85 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 198.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 436.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Witness Printer took 33.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 25]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x; [L15] int y; [L16] int z; [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L19] COND FALSE !(__VERIFIER_nondet_int() != 0) [L22] x = -1 VAL [x=-1, y=-2147483648, z=0] [L24] COND TRUE y<100 && z<100 VAL [x=-1, y=-2147483648, z=0] [L25] y+x VAL [x=-1, y=-2147483648, z=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 4 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 23 SDslu, 22 SDs, 0 SdLazy, 31 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...