./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0497b69437c9ebb889888bdb31aaefcc8eaad029 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:32:26,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:32:26,811 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:32:26,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:32:26,817 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:32:26,818 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:32:26,818 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:32:26,819 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:32:26,820 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:32:26,821 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:32:26,821 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:32:26,821 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:32:26,822 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:32:26,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:32:26,823 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:32:26,823 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:32:26,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:32:26,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:32:26,826 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:32:26,826 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:32:26,827 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:32:26,827 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:32:26,829 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:32:26,829 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:32:26,829 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:32:26,829 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:32:26,830 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:32:26,831 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:32:26,831 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:32:26,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:32:26,832 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:32:26,832 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:32:26,832 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:32:26,832 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:32:26,833 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:32:26,833 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:32:26,833 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:32:26,841 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:32:26,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:32:26,842 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:32:26,842 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:32:26,842 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:32:26,842 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:32:26,842 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:32:26,842 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:32:26,843 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:32:26,843 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:32:26,843 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:32:26,843 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:32:26,843 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:32:26,844 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:32:26,844 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:32:26,844 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:32:26,844 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:32:26,844 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:32:26,844 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:32:26,844 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:32:26,844 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:32:26,844 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:32:26,844 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:32:26,845 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:32:26,845 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:32:26,845 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:32:26,845 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:32:26,845 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:32:26,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:32:26,845 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:32:26,845 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:32:26,845 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:32:26,845 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:32:26,846 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:32:26,846 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:32:26,846 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:32:26,846 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_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/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 ! call(__VERIFIER_error())) ) 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 -> 0497b69437c9ebb889888bdb31aaefcc8eaad029 [2018-12-09 19:32:26,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:32:26,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:32:26,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:32:26,873 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:32:26,874 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:32:26,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/bin-2019/utaipan/../../sv-benchmarks/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c [2018-12-09 19:32:26,908 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/bin-2019/utaipan/data/6a2d628a8/d78c8d0e348840ddb009e53ab751c6c0/FLAGf5d988ed9 [2018-12-09 19:32:27,355 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:32:27,356 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/sv-benchmarks/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c [2018-12-09 19:32:27,359 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/bin-2019/utaipan/data/6a2d628a8/d78c8d0e348840ddb009e53ab751c6c0/FLAGf5d988ed9 [2018-12-09 19:32:27,367 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/bin-2019/utaipan/data/6a2d628a8/d78c8d0e348840ddb009e53ab751c6c0 [2018-12-09 19:32:27,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:32:27,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:32:27,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:32:27,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:32:27,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:32:27,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:32:27" (1/1) ... [2018-12-09 19:32:27,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27, skipping insertion in model container [2018-12-09 19:32:27,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:32:27" (1/1) ... [2018-12-09 19:32:27,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:32:27,387 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:32:27,468 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:32:27,470 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:32:27,480 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:32:27,487 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:32:27,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27 WrapperNode [2018-12-09 19:32:27,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:32:27,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:32:27,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:32:27,488 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:32:27,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27" (1/1) ... [2018-12-09 19:32:27,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27" (1/1) ... [2018-12-09 19:32:27,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:32:27,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:32:27,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:32:27,500 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:32:27,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27" (1/1) ... [2018-12-09 19:32:27,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27" (1/1) ... [2018-12-09 19:32:27,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27" (1/1) ... [2018-12-09 19:32:27,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27" (1/1) ... [2018-12-09 19:32:27,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27" (1/1) ... [2018-12-09 19:32:27,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27" (1/1) ... [2018-12-09 19:32:27,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27" (1/1) ... [2018-12-09 19:32:27,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:32:27,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:32:27,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:32:27,511 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:32:27,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/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-12-09 19:32:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:32:27,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:32:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2018-12-09 19:32:27,571 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2018-12-09 19:32:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:32:27,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:32:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:32:27,572 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:32:27,662 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:32:27,662 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 19:32:27,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:32:27 BoogieIcfgContainer [2018-12-09 19:32:27,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:32:27,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:32:27,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:32:27,665 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:32:27,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:32:27" (1/3) ... [2018-12-09 19:32:27,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5e67f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:32:27, skipping insertion in model container [2018-12-09 19:32:27,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:32:27" (2/3) ... [2018-12-09 19:32:27,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5e67f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:32:27, skipping insertion in model container [2018-12-09 19:32:27,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:32:27" (3/3) ... [2018-12-09 19:32:27,667 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd01_true-unreach-call_true-no-overflow_true-termination.c [2018-12-09 19:32:27,673 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:32:27,677 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 19:32:27,687 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 19:32:27,706 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:32:27,706 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:32:27,706 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:32:27,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:32:27,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:32:27,707 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:32:27,707 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:32:27,707 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:32:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-12-09 19:32:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 19:32:27,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:32:27,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:32:27,723 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:32:27,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:32:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1001932622, now seen corresponding path program 1 times [2018-12-09 19:32:27,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:32:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:27,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:32:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:27,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:32:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:32:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:32:27,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:32:27,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:32:27,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:32:27,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:32:27,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:32:27,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:32:27,861 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 6 states. [2018-12-09 19:32:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:32:27,942 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-12-09 19:32:27,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:32:27,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-09 19:32:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:32:27,949 INFO L225 Difference]: With dead ends: 40 [2018-12-09 19:32:27,949 INFO L226 Difference]: Without dead ends: 24 [2018-12-09 19:32:27,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:32:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-09 19:32:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-09 19:32:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 19:32:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-12-09 19:32:27,977 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2018-12-09 19:32:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:32:27,977 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-09 19:32:27,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:32:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-12-09 19:32:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 19:32:27,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:32:27,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:32:27,979 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:32:27,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:32:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash -423841111, now seen corresponding path program 1 times [2018-12-09 19:32:27,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:32:27,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:27,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:32:27,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:27,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:32:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:32:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:32:28,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:32:28,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:32:28,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:32:28,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:32:28,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:32:28,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:32:28,023 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2018-12-09 19:32:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:32:28,051 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-12-09 19:32:28,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:32:28,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-09 19:32:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:32:28,051 INFO L225 Difference]: With dead ends: 30 [2018-12-09 19:32:28,051 INFO L226 Difference]: Without dead ends: 26 [2018-12-09 19:32:28,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:32:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-09 19:32:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-12-09 19:32:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 19:32:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-12-09 19:32:28,056 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2018-12-09 19:32:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:32:28,056 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-09 19:32:28,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:32:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-12-09 19:32:28,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:32:28,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:32:28,057 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:32:28,057 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:32:28,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:32:28,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1280495258, now seen corresponding path program 1 times [2018-12-09 19:32:28,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:32:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:28,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:32:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:28,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:32:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:32:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:32:28,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:32:28,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:32:28,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:32:28,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:32:28,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:32:28,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:32:28,094 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2018-12-09 19:32:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:32:28,149 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-12-09 19:32:28,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:32:28,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-09 19:32:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:32:28,150 INFO L225 Difference]: With dead ends: 36 [2018-12-09 19:32:28,150 INFO L226 Difference]: Without dead ends: 28 [2018-12-09 19:32:28,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:32:28,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-09 19:32:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-09 19:32:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-09 19:32:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-12-09 19:32:28,154 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 23 [2018-12-09 19:32:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:32:28,154 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-09 19:32:28,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:32:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-12-09 19:32:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:32:28,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:32:28,155 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:32:28,155 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:32:28,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:32:28,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1668712292, now seen corresponding path program 1 times [2018-12-09 19:32:28,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:32:28,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:28,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:32:28,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:28,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:32:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:32:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:32:28,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:32:28,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:32:28,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:32:28,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:32:28,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:32:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:32:28,202 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 7 states. [2018-12-09 19:32:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:32:28,261 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-09 19:32:28,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:32:28,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-09 19:32:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:32:28,262 INFO L225 Difference]: With dead ends: 36 [2018-12-09 19:32:28,262 INFO L226 Difference]: Without dead ends: 26 [2018-12-09 19:32:28,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:32:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-09 19:32:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-12-09 19:32:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 19:32:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-12-09 19:32:28,266 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 23 [2018-12-09 19:32:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:32:28,266 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-09 19:32:28,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:32:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-12-09 19:32:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 19:32:28,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:32:28,267 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:32:28,267 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:32:28,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:32:28,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1139697511, now seen corresponding path program 1 times [2018-12-09 19:32:28,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:32:28,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:28,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:32:28,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:28,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:32:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:32:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:32:28,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:32:28,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:32:28,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:32:28,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:32:28,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:32:28,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:32:28,305 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2018-12-09 19:32:28,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:32:28,329 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-12-09 19:32:28,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:32:28,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-09 19:32:28,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:32:28,330 INFO L225 Difference]: With dead ends: 31 [2018-12-09 19:32:28,331 INFO L226 Difference]: Without dead ends: 27 [2018-12-09 19:32:28,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-12-09 19:32:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-09 19:32:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-09 19:32:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-09 19:32:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-12-09 19:32:28,334 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 24 [2018-12-09 19:32:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:32:28,334 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-09 19:32:28,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:32:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-12-09 19:32:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 19:32:28,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:32:28,335 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:32:28,335 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:32:28,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:32:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash 99153721, now seen corresponding path program 1 times [2018-12-09 19:32:28,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:32:28,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:28,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:32:28,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:28,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:32:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:32:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:32:28,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:32:28,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:32:28,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:32:28,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:32:28,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:32:28,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:32:28,370 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 7 states. [2018-12-09 19:32:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:32:28,396 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-12-09 19:32:28,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:32:28,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-09 19:32:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:32:28,397 INFO L225 Difference]: With dead ends: 34 [2018-12-09 19:32:28,397 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 19:32:28,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-12-09 19:32:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 19:32:28,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 19:32:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 19:32:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-12-09 19:32:28,400 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2018-12-09 19:32:28,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:32:28,400 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-12-09 19:32:28,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:32:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-12-09 19:32:28,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:32:28,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:32:28,401 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:32:28,401 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:32:28,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:32:28,402 INFO L82 PathProgramCache]: Analyzing trace with hash 10057033, now seen corresponding path program 1 times [2018-12-09 19:32:28,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:32:28,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:28,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:32:28,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:32:28,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:32:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:32:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 19:32:28,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:32:28,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:32:28,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:32:28,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:32:28,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:32:28,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:32:28,439 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 8 states. [2018-12-09 19:32:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:32:28,476 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-12-09 19:32:28,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:32:28,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-12-09 19:32:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:32:28,477 INFO L225 Difference]: With dead ends: 30 [2018-12-09 19:32:28,477 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 19:32:28,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:32:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 19:32:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 19:32:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 19:32:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 19:32:28,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-12-09 19:32:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:32:28,478 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 19:32:28,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:32:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 19:32:28,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 19:32:28,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 19:32:28,524 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 19:32:28,525 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:32:28,525 INFO L448 ceAbstractionStarter]: For program point gcdFINAL(lines 15 26) no Hoare annotation was computed. [2018-12-09 19:32:28,525 INFO L448 ceAbstractionStarter]: For program point gcdEXIT(lines 15 26) no Hoare annotation was computed. [2018-12-09 19:32:28,525 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (and (<= |gcd_#in~y2| gcd_~y2) (<= 1 gcd_~y1) (<= |gcd_#in~y1| gcd_~y1) (< gcd_~y1 gcd_~y2)) [2018-12-09 19:32:28,525 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-12-09 19:32:28,525 INFO L451 ceAbstractionStarter]: At program point gcdENTRY(lines 15 26) the Hoare annotation is: true [2018-12-09 19:32:28,525 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (<= |gcd_#in~y2| gcd_~y2) (<= 1 gcd_~y2) (<= (+ gcd_~y2 1) gcd_~y1) (<= |gcd_#in~y1| gcd_~y1)) [2018-12-09 19:32:28,525 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-12-09 19:32:28,525 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-12-09 19:32:28,525 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. [2018-12-09 19:32:28,525 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 18) no Hoare annotation was computed. [2018-12-09 19:32:28,525 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:32:28,525 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 19:32:28,526 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 19:32:28,526 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 19:32:28,526 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 32) no Hoare annotation was computed. [2018-12-09 19:32:28,526 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 28 43) the Hoare annotation is: true [2018-12-09 19:32:28,526 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 28 43) no Hoare annotation was computed. [2018-12-09 19:32:28,526 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-12-09 19:32:28,526 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-09 19:32:28,526 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 42) no Hoare annotation was computed. [2018-12-09 19:32:28,526 INFO L444 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (<= 1 main_~m~0) (<= 1 main_~n~0)) [2018-12-09 19:32:28,526 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 28 43) no Hoare annotation was computed. [2018-12-09 19:32:28,526 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-12-09 19:32:28,526 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-12-09 19:32:28,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:32:28 BoogieIcfgContainer [2018-12-09 19:32:28,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:32:28,528 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:32:28,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:32:28,529 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:32:28,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:32:27" (3/4) ... [2018-12-09 19:32:28,531 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 19:32:28,535 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 19:32:28,535 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2018-12-09 19:32:28,535 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 19:32:28,538 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 19:32:28,538 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 19:32:28,538 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 19:32:28,566 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4a8ddee9-2bc7-4c21-a378-8c4f55f23476/bin-2019/utaipan/witness.graphml [2018-12-09 19:32:28,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:32:28,566 INFO L168 Benchmark]: Toolchain (without parser) took 1197.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 962.4 MB in the beginning and 942.3 MB in the end (delta: 20.2 MB). Peak memory consumption was 140.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:32:28,567 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:32:28,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 117.62 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:32:28,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.62 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:32:28,568 INFO L168 Benchmark]: Boogie Preprocessor took 10.94 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:32:28,568 INFO L168 Benchmark]: RCFGBuilder took 151.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:32:28,568 INFO L168 Benchmark]: TraceAbstraction took 865.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 942.3 MB in the end (delta: 158.1 MB). Peak memory consumption was 158.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:32:28,568 INFO L168 Benchmark]: Witness Printer took 37.38 ms. Allocated memory is still 1.1 GB. Free memory is still 942.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:32:28,570 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 117.62 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 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 11.62 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.94 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 151.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 865.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 942.3 MB in the end (delta: 158.1 MB). Peak memory consumption was 158.1 MB. Max. memory is 11.5 GB. * Witness Printer took 37.38 ms. Allocated memory is still 1.1 GB. Free memory is still 942.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 0.8s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 85 SDslu, 501 SDs, 0 SdLazy, 291 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 14 NumberOfFragments, 40 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 6726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 34/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...