./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/recursive/EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/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 32bit --witnessprinter.graph.data.programhash bec5669c6fe02e51518958076fea4487ada345cf ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:49:26,940 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:49:26,941 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:49:26,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:49:26,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:49:26,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:49:26,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:49:26,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:49:26,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:49:26,955 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:49:26,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:49:26,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:49:26,957 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:49:26,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:49:26,958 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:49:26,959 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:49:26,959 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:49:26,961 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:49:26,963 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:49:26,964 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:49:26,965 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:49:26,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:49:26,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:49:26,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:49:26,968 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:49:26,971 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:49:26,971 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:49:26,972 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:49:26,972 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:49:26,973 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:49:26,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:49:26,974 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:49:26,974 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:49:26,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:49:26,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:49:26,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:49:26,975 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-10 04:49:26,986 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:49:26,986 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:49:26,987 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:49:26,987 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 04:49:26,987 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 04:49:26,987 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 04:49:26,987 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 04:49:26,987 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 04:49:26,988 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 04:49:26,988 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 04:49:26,988 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 04:49:26,988 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:49:26,989 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:49:26,989 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:49:26,989 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:49:26,989 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:49:26,989 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:49:26,989 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:49:26,989 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:49:26,989 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:49:26,990 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 04:49:26,990 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:49:26,990 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:49:26,990 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:49:26,990 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:49:26,990 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:49:26,990 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:49:26,990 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:49:26,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:49:26,991 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:49:26,991 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:49:26,991 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:49:26,991 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 04:49:26,991 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:49:26,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:49:26,991 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 04:49:26,992 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_0391649f-27d7-45ed-b30b-286acf739df6/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bec5669c6fe02e51518958076fea4487ada345cf [2018-11-10 04:49:27,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:49:27,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:49:27,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:49:27,029 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:49:27,030 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:49:27,030 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/bin-2019/utaipan/../../sv-benchmarks/c/recursive/EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 04:49:27,079 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/bin-2019/utaipan/data/8dc0953ff/865f8a5b831d422e863dddea347a486b/FLAGb73081c45 [2018-11-10 04:49:27,419 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:49:27,420 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/sv-benchmarks/c/recursive/EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 04:49:27,425 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/bin-2019/utaipan/data/8dc0953ff/865f8a5b831d422e863dddea347a486b/FLAGb73081c45 [2018-11-10 04:49:27,438 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/bin-2019/utaipan/data/8dc0953ff/865f8a5b831d422e863dddea347a486b [2018-11-10 04:49:27,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:49:27,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:49:27,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:49:27,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:49:27,446 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:49:27,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:49:27" (1/1) ... [2018-11-10 04:49:27,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61258a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27, skipping insertion in model container [2018-11-10 04:49:27,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:49:27" (1/1) ... [2018-11-10 04:49:27,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:49:27,473 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:49:27,606 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:49:27,609 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:49:27,619 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:49:27,630 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:49:27,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27 WrapperNode [2018-11-10 04:49:27,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:49:27,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:49:27,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:49:27,632 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:49:27,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27" (1/1) ... [2018-11-10 04:49:27,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27" (1/1) ... [2018-11-10 04:49:27,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:49:27,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:49:27,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:49:27,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:49:27,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27" (1/1) ... [2018-11-10 04:49:27,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27" (1/1) ... [2018-11-10 04:49:27,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27" (1/1) ... [2018-11-10 04:49:27,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27" (1/1) ... [2018-11-10 04:49:27,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27" (1/1) ... [2018-11-10 04:49:27,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27" (1/1) ... [2018-11-10 04:49:27,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27" (1/1) ... [2018-11-10 04:49:27,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:49:27,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:49:27,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:49:27,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:49:27,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/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-10 04:49:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:49:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:49:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2018-11-10 04:49:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2018-11-10 04:49:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2018-11-10 04:49:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2018-11-10 04:49:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:49:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:49:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:49:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:49:27,848 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:49:27,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:49:27 BoogieIcfgContainer [2018-11-10 04:49:27,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:49:27,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:49:27,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:49:27,851 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:49:27,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:49:27" (1/3) ... [2018-11-10 04:49:27,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1685595f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:49:27, skipping insertion in model container [2018-11-10 04:49:27,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:27" (2/3) ... [2018-11-10 04:49:27,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1685595f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:49:27, skipping insertion in model container [2018-11-10 04:49:27,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:49:27" (3/3) ... [2018-11-10 04:49:27,853 INFO L112 eAbstractionObserver]: Analyzing ICFG EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 04:49:27,859 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:49:27,863 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-10 04:49:27,872 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-10 04:49:27,893 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:49:27,893 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:49:27,893 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:49:27,893 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:49:27,893 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:49:27,893 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:49:27,893 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:49:27,893 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:49:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-10 04:49:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 04:49:27,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:49:27,911 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:49:27,913 INFO L424 AbstractCegarLoop]: === Iteration 1 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:49:27,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:49:27,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1145007729, now seen corresponding path program 1 times [2018-11-10 04:49:27,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:49:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:49:27,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:49:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:49:27,951 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:49:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:49:28,041 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-10 04:49:28,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:49:28,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:49:28,042 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:49:28,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:49:28,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:49:28,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:49:28,054 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 5 states. [2018-11-10 04:49:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:49:28,136 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-10 04:49:28,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:49:28,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-10 04:49:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:49:28,143 INFO L225 Difference]: With dead ends: 53 [2018-11-10 04:49:28,143 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 04:49:28,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:49:28,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 04:49:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-10 04:49:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 04:49:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-10 04:49:28,170 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 11 [2018-11-10 04:49:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:49:28,170 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-10 04:49:28,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:49:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-10 04:49:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 04:49:28,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:49:28,171 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:49:28,172 INFO L424 AbstractCegarLoop]: === Iteration 2 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:49:28,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:49:28,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1135501172, now seen corresponding path program 1 times [2018-11-10 04:49:28,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:49:28,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:49:28,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:49:28,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:49:28,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:49:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:49:28,236 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-10 04:49:28,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:49:28,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:49:28,237 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:49:28,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:49:28,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:49:28,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:49:28,238 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 5 states. [2018-11-10 04:49:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:49:28,269 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-10 04:49:28,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:49:28,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-10 04:49:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:49:28,271 INFO L225 Difference]: With dead ends: 30 [2018-11-10 04:49:28,271 INFO L226 Difference]: Without dead ends: 29 [2018-11-10 04:49:28,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:49:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-10 04:49:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-10 04:49:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 04:49:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-10 04:49:28,275 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 12 [2018-11-10 04:49:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:49:28,276 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-10 04:49:28,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:49:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-10 04:49:28,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 04:49:28,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:49:28,277 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:49:28,278 INFO L424 AbstractCegarLoop]: === Iteration 3 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:49:28,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:49:28,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1227554316, now seen corresponding path program 1 times [2018-11-10 04:49:28,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:49:28,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:49:28,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:49:28,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:49:28,279 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:49:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:49:28,316 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-10 04:49:28,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:49:28,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:49:28,316 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:49:28,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:49:28,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:49:28,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:49:28,317 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 5 states. [2018-11-10 04:49:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:49:28,337 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-10 04:49:28,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:49:28,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-10 04:49:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:49:28,338 INFO L225 Difference]: With dead ends: 28 [2018-11-10 04:49:28,338 INFO L226 Difference]: Without dead ends: 27 [2018-11-10 04:49:28,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:49:28,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-10 04:49:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-10 04:49:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 04:49:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-10 04:49:28,341 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2018-11-10 04:49:28,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:49:28,341 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-10 04:49:28,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:49:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-10 04:49:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 04:49:28,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:49:28,342 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:49:28,342 INFO L424 AbstractCegarLoop]: === Iteration 4 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:49:28,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:49:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash -600521825, now seen corresponding path program 1 times [2018-11-10 04:49:28,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:49:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:49:28,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:49:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:49:28,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:49:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:49:28,393 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-10 04:49:28,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:49:28,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:49:28,394 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:49:28,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:49:28,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:49:28,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:49:28,395 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2018-11-10 04:49:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:49:28,460 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-10 04:49:28,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 04:49:28,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-10 04:49:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:49:28,462 INFO L225 Difference]: With dead ends: 35 [2018-11-10 04:49:28,462 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 04:49:28,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:49:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 04:49:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-10 04:49:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 04:49:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-10 04:49:28,467 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 18 [2018-11-10 04:49:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:49:28,467 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-10 04:49:28,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:49:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-10 04:49:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 04:49:28,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:49:28,468 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:49:28,469 INFO L424 AbstractCegarLoop]: === Iteration 5 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:49:28,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:49:28,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2031952855, now seen corresponding path program 1 times [2018-11-10 04:49:28,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:49:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:49:28,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:49:28,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:49:28,471 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:49:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:49:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:49:28,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:49:28,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:49:28,495 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:49:28,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:49:28,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:49:28,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:49:28,496 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 5 states. [2018-11-10 04:49:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:49:28,537 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-10 04:49:28,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:49:28,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-10 04:49:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:49:28,538 INFO L225 Difference]: With dead ends: 33 [2018-11-10 04:49:28,538 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 04:49:28,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:49:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 04:49:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-10 04:49:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 04:49:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-10 04:49:28,542 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2018-11-10 04:49:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:49:28,542 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-10 04:49:28,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:49:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-10 04:49:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 04:49:28,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:49:28,543 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:49:28,544 INFO L424 AbstractCegarLoop]: === Iteration 6 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:49:28,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:49:28,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1433970876, now seen corresponding path program 1 times [2018-11-10 04:49:28,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:49:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:49:28,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:49:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:49:28,545 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:49:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:49:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:49:28,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:49:28,603 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:49:28,604 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-10 04:49:28,605 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [13], [17], [21], [25], [27], [28], [29], [36], [40], [50], [52], [54], [55], [56], [58] [2018-11-10 04:49:28,636 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:49:28,636 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:49:28,735 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 04:49:28,736 INFO L272 AbstractInterpreter]: Visited 20 different actions 40 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-10 04:49:28,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:49:28,748 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 04:49:28,806 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 04:49:28,807 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 04:49:28,926 INFO L415 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-11-10 04:49:28,927 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 04:49:28,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:49:28,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 20 [2018-11-10 04:49:28,927 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:49:28,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 04:49:28,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 04:49:28,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:49:28,928 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 14 states. [2018-11-10 04:49:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:49:29,141 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-10 04:49:29,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 04:49:29,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-10 04:49:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:49:29,142 INFO L225 Difference]: With dead ends: 32 [2018-11-10 04:49:29,142 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 04:49:29,142 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-11-10 04:49:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 04:49:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 04:49:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 04:49:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 04:49:29,143 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-10 04:49:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:49:29,143 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:49:29,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 04:49:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:49:29,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 04:49:29,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 04:49:29,286 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 04:49:29,286 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:49:29,286 INFO L425 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-11-10 04:49:29,286 INFO L425 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-11-10 04:49:29,286 INFO L421 ceAbstractionStarter]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse0 (* 2 |isEven_#in~n|))) (or (< 4294967292 .cse0) (let ((.cse1 (* 2 isEven_~n))) (and (<= 4 .cse1) (<= .cse1 4294967292))) (< .cse0 2))) [2018-11-10 04:49:29,286 INFO L425 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-11-10 04:49:29,286 INFO L425 ceAbstractionStarter]: For program point L32-3(line 32) no Hoare annotation was computed. [2018-11-10 04:49:29,286 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 33) no Hoare annotation was computed. [2018-11-10 04:49:29,286 INFO L428 ceAbstractionStarter]: At program point isEvenENTRY(lines 26 34) the Hoare annotation is: true [2018-11-10 04:49:29,286 INFO L425 ceAbstractionStarter]: For program point isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2018-11-10 04:49:29,287 INFO L425 ceAbstractionStarter]: For program point isEvenEXIT(lines 26 34) no Hoare annotation was computed. [2018-11-10 04:49:29,287 INFO L425 ceAbstractionStarter]: For program point isEvenFINAL(lines 26 34) no Hoare annotation was computed. [2018-11-10 04:49:29,287 INFO L425 ceAbstractionStarter]: For program point isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2018-11-10 04:49:29,287 INFO L425 ceAbstractionStarter]: For program point isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 04:49:29,287 INFO L425 ceAbstractionStarter]: For program point isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 04:49:29,287 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 04:49:29,287 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-11-10 04:49:29,287 INFO L421 ceAbstractionStarter]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (* 2 isOdd_~n))) (and (or (and (<= 4 .cse0) (<= .cse0 4294967294)) (< 2147483647 |isOdd_#in~n|) (< |isOdd_#in~n| 0)) (let ((.cse1 (* 2 |isOdd_#in~n|))) (or (< 4294967290 .cse1) (< .cse1 2) (<= .cse0 4294967290))))) [2018-11-10 04:49:29,287 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2018-11-10 04:49:29,287 INFO L425 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. [2018-11-10 04:49:29,288 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 23) no Hoare annotation was computed. [2018-11-10 04:49:29,288 INFO L425 ceAbstractionStarter]: For program point isOddFINAL(lines 16 24) no Hoare annotation was computed. [2018-11-10 04:49:29,288 INFO L428 ceAbstractionStarter]: At program point isOddENTRY(lines 16 24) the Hoare annotation is: true [2018-11-10 04:49:29,288 INFO L425 ceAbstractionStarter]: For program point isOddEXIT(lines 16 24) no Hoare annotation was computed. [2018-11-10 04:49:29,288 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:49:29,288 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 04:49:29,288 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 04:49:29,288 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 04:49:29,288 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 37 49) the Hoare annotation is: true [2018-11-10 04:49:29,288 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 37 49) no Hoare annotation was computed. [2018-11-10 04:49:29,288 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-11-10 04:49:29,288 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 37 49) no Hoare annotation was computed. [2018-11-10 04:49:29,289 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 48) no Hoare annotation was computed. [2018-11-10 04:49:29,289 INFO L421 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= .cse0 4294967294) (<= 0 .cse0))) [2018-11-10 04:49:29,289 INFO L425 ceAbstractionStarter]: For program point L42-1(line 42) no Hoare annotation was computed. [2018-11-10 04:49:29,289 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 41) no Hoare annotation was computed. [2018-11-10 04:49:29,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:49:29 BoogieIcfgContainer [2018-11-10 04:49:29,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:49:29,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:49:29,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:49:29,292 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:49:29,292 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:49:27" (3/4) ... [2018-11-10 04:49:29,294 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 04:49:29,298 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 04:49:29,298 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isEven [2018-11-10 04:49:29,298 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isOdd [2018-11-10 04:49:29,298 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 04:49:29,301 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 04:49:29,302 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 04:49:29,302 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 04:49:29,331 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0391649f-27d7-45ed-b30b-286acf739df6/bin-2019/utaipan/witness.graphml [2018-11-10 04:49:29,332 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:49:29,332 INFO L168 Benchmark]: Toolchain (without parser) took 1891.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 960.2 MB in the beginning and 971.5 MB in the end (delta: -11.2 MB). Peak memory consumption was 161.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:49:29,334 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:49:29,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.97 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:49:29,334 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.59 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:49:29,334 INFO L168 Benchmark]: Boogie Preprocessor took 11.47 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:49:29,335 INFO L168 Benchmark]: RCFGBuilder took 193.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -213.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 04:49:29,335 INFO L168 Benchmark]: TraceAbstraction took 1442.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 974.7 MB in the end (delta: 184.4 MB). Peak memory consumption was 184.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:49:29,336 INFO L168 Benchmark]: Witness Printer took 40.24 ms. Allocated memory is still 1.2 GB. Free memory was 974.7 MB in the beginning and 971.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:49:29,337 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.97 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.59 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.47 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 193.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -213.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1442.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 974.7 MB in the end (delta: 184.4 MB). Peak memory consumption was 184.4 MB. Max. memory is 11.5 GB. * Witness Printer took 40.24 ms. Allocated memory is still 1.2 GB. Free memory was 974.7 MB in the beginning and 971.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 4 error locations. SAFE Result, 1.4s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 90 SDslu, 321 SDs, 0 SdLazy, 169 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.8695652173913043 AbsIntWeakeningRatio, 0.30434782608695654 AbsIntAvgWeakeningVarsNumRemoved, 3.652173913043478 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 13 PreInvPairs, 13 NumberOfFragments, 80 HoareAnnotationTreeSize, 13 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 159 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 4399 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 4/9 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...