./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/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 4ba31a8852254650e4ff6b6614669c496c01110f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:35:02,629 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:35:02,630 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:35:02,636 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:35:02,636 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:35:02,637 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:35:02,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:35:02,638 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:35:02,639 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:35:02,639 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:35:02,640 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:35:02,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:35:02,641 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:35:02,641 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:35:02,642 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:35:02,642 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:35:02,642 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:35:02,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:35:02,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:35:02,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:35:02,646 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:35:02,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:35:02,647 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:35:02,647 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:35:02,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:35:02,648 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:35:02,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:35:02,649 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:35:02,650 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:35:02,650 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:35:02,650 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:35:02,651 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:35:02,651 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:35:02,651 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:35:02,651 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:35:02,652 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:35:02,652 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-12-02 21:35:02,659 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:35:02,659 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:35:02,660 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:35:02,660 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:35:02,660 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:35:02,660 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:35:02,660 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:35:02,660 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 21:35:02,660 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:35:02,660 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:35:02,661 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 21:35:02,661 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 21:35:02,661 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:35:02,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:35:02,661 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:35:02,661 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:35:02,662 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:35:02,662 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:35:02,662 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:35:02,662 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:35:02,662 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:35:02,662 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:35:02,662 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-02 21:35:02,662 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:35:02,663 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:35:02,663 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:35:02,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:35:02,663 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:35:02,663 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:35:02,663 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:35:02,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:35:02,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:35:02,663 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:35:02,664 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:35:02,664 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 21:35:02,664 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:35:02,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:35:02,664 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 21:35:02,664 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_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/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 -> 4ba31a8852254650e4ff6b6614669c496c01110f [2018-12-02 21:35:02,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:35:02,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:35:02,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:35:02,694 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:35:02,695 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:35:02,695 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/../../sv-benchmarks/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-02 21:35:02,739 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/data/ecf5011c3/154c47159ad947fc8bd01418b067f704/FLAG9e448253a [2018-12-02 21:35:03,069 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:35:03,070 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/sv-benchmarks/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-02 21:35:03,073 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/data/ecf5011c3/154c47159ad947fc8bd01418b067f704/FLAG9e448253a [2018-12-02 21:35:03,468 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/data/ecf5011c3/154c47159ad947fc8bd01418b067f704 [2018-12-02 21:35:03,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:35:03,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:35:03,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:35:03,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:35:03,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:35:03,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:35:03" (1/1) ... [2018-12-02 21:35:03,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d1abfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03, skipping insertion in model container [2018-12-02 21:35:03,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:35:03" (1/1) ... [2018-12-02 21:35:03,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:35:03,494 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:35:03,579 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:35:03,581 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:35:03,592 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:35:03,599 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:35:03,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03 WrapperNode [2018-12-02 21:35:03,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:35:03,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:35:03,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:35:03,600 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:35:03,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03" (1/1) ... [2018-12-02 21:35:03,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03" (1/1) ... [2018-12-02 21:35:03,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:35:03,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:35:03,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:35:03,612 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:35:03,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03" (1/1) ... [2018-12-02 21:35:03,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03" (1/1) ... [2018-12-02 21:35:03,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03" (1/1) ... [2018-12-02 21:35:03,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03" (1/1) ... [2018-12-02 21:35:03,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03" (1/1) ... [2018-12-02 21:35:03,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03" (1/1) ... [2018-12-02 21:35:03,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03" (1/1) ... [2018-12-02 21:35:03,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:35:03,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:35:03,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:35:03,625 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:35:03,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/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-02 21:35:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:35:03,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:35:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2018-12-02 21:35:03,689 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2018-12-02 21:35:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2018-12-02 21:35:03,689 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2018-12-02 21:35:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:35:03,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:35:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:35:03,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:35:03,825 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:35:03,825 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 21:35:03,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:35:03 BoogieIcfgContainer [2018-12-02 21:35:03,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:35:03,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:35:03,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:35:03,829 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:35:03,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:35:03" (1/3) ... [2018-12-02 21:35:03,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1235a7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:35:03, skipping insertion in model container [2018-12-02 21:35:03,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:35:03" (2/3) ... [2018-12-02 21:35:03,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1235a7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:35:03, skipping insertion in model container [2018-12-02 21:35:03,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:35:03" (3/3) ... [2018-12-02 21:35:03,832 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-02 21:35:03,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:35:03,848 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-12-02 21:35:03,862 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-12-02 21:35:03,888 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:35:03,889 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:35:03,889 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:35:03,889 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:35:03,889 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:35:03,889 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:35:03,889 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:35:03,889 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:35:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-12-02 21:35:03,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 21:35:03,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:35:03,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:35:03,914 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:35:03,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:03,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1091942582, now seen corresponding path program 1 times [2018-12-02 21:35:03,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:35:03,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:03,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:03,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:03,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:35:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:04,040 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-02 21:35:04,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:35:04,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:35:04,042 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:35:04,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:35:04,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:35:04,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:35:04,054 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-12-02 21:35:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:35:04,147 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2018-12-02 21:35:04,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:35:04,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-02 21:35:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:35:04,157 INFO L225 Difference]: With dead ends: 85 [2018-12-02 21:35:04,157 INFO L226 Difference]: Without dead ends: 35 [2018-12-02 21:35:04,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:35:04,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-02 21:35:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-02 21:35:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 21:35:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-02 21:35:04,184 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2018-12-02 21:35:04,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:35:04,184 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-02 21:35:04,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:35:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-02 21:35:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 21:35:04,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:35:04,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:35:04,186 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:35:04,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:04,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1091942806, now seen corresponding path program 1 times [2018-12-02 21:35:04,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:35:04,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:04,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:04,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:04,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:35:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:04,223 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-02 21:35:04,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:35:04,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:35:04,224 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:35:04,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:35:04,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:35:04,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:35:04,226 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-12-02 21:35:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:35:04,272 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-12-02 21:35:04,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:35:04,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-02 21:35:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:35:04,273 INFO L225 Difference]: With dead ends: 35 [2018-12-02 21:35:04,273 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 21:35:04,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:35:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 21:35:04,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 21:35:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 21:35:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 21:35:04,277 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2018-12-02 21:35:04,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:35:04,278 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 21:35:04,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:35:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-02 21:35:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 21:35:04,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:35:04,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:35:04,279 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:35:04,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1535417245, now seen corresponding path program 1 times [2018-12-02 21:35:04,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:35:04,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:04,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:04,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:04,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:35:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:04,338 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-02 21:35:04,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:35:04,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:35:04,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:35:04,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:35:04,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:35:04,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:35:04,340 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-12-02 21:35:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:35:04,418 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-12-02 21:35:04,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:35:04,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-12-02 21:35:04,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:35:04,420 INFO L225 Difference]: With dead ends: 45 [2018-12-02 21:35:04,420 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 21:35:04,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:35:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 21:35:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-12-02 21:35:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 21:35:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-02 21:35:04,427 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-12-02 21:35:04,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:35:04,427 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-02 21:35:04,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:35:04,427 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-02 21:35:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 21:35:04,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:35:04,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:35:04,428 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:35:04,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:04,428 INFO L82 PathProgramCache]: Analyzing trace with hash 353294382, now seen corresponding path program 1 times [2018-12-02 21:35:04,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:35:04,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:04,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:04,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:04,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:35:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:04,442 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-02 21:35:04,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:35:04,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:35:04,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:35:04,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:35:04,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:35:04,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:35:04,443 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-12-02 21:35:04,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:35:04,450 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-12-02 21:35:04,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:35:04,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 21:35:04,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:35:04,450 INFO L225 Difference]: With dead ends: 41 [2018-12-02 21:35:04,451 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 21:35:04,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:35:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 21:35:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-02 21:35:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 21:35:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-02 21:35:04,455 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 21 [2018-12-02 21:35:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:35:04,455 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-02 21:35:04,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:35:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-02 21:35:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 21:35:04,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:35:04,456 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, 1, 1] [2018-12-02 21:35:04,456 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:35:04,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash -823556285, now seen corresponding path program 1 times [2018-12-02 21:35:04,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:35:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:04,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:04,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:35:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:04,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:35:04,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:35:04,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:35:04,527 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-02 21:35:04,528 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [13], [17], [24], [28], [46], [50], [54], [58], [61], [63], [77], [83], [84], [85], [87], [88], [89] [2018-12-02 21:35:04,547 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:35:04,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:35:04,635 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:35:04,635 INFO L272 AbstractInterpreter]: Visited 23 different actions 44 times. Never merged. Never widened. Performed 124 root evaluator evaluations with a maximum evaluation depth of 3. Performed 124 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-12-02 21:35:04,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:04,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:35:04,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:35:04,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:35:04,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:04,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:35:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:04,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:35:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:35:04,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:35:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:35:04,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:35:04,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 10] total 26 [2018-12-02 21:35:04,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:35:04,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:35:04,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:35:04,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2018-12-02 21:35:04,997 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 11 states. [2018-12-02 21:35:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:35:05,103 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-12-02 21:35:05,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:35:05,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-12-02 21:35:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:35:05,104 INFO L225 Difference]: With dead ends: 49 [2018-12-02 21:35:05,104 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 21:35:05,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2018-12-02 21:35:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 21:35:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-02 21:35:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 21:35:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-02 21:35:05,107 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 26 [2018-12-02 21:35:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:35:05,108 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-02 21:35:05,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:35:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-02 21:35:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:35:05,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:35:05,108 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, 1, 1, 1, 1, 1, 1] [2018-12-02 21:35:05,109 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:35:05,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:05,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1123279450, now seen corresponding path program 1 times [2018-12-02 21:35:05,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:35:05,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:05,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:05,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:35:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:05,169 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-02 21:35:05,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:35:05,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 21:35:05,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:35:05,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:35:05,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:35:05,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:35:05,170 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 10 states. [2018-12-02 21:35:05,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:35:05,268 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-12-02 21:35:05,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:35:05,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-12-02 21:35:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:35:05,269 INFO L225 Difference]: With dead ends: 46 [2018-12-02 21:35:05,269 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 21:35:05,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:35:05,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 21:35:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-12-02 21:35:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 21:35:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-12-02 21:35:05,273 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 30 [2018-12-02 21:35:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:35:05,273 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-12-02 21:35:05,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:35:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-12-02 21:35:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:35:05,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:35:05,274 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, 1, 1, 1, 1, 1, 1] [2018-12-02 21:35:05,274 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:35:05,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1396968422, now seen corresponding path program 1 times [2018-12-02 21:35:05,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:35:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:05,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:05,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:05,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:35:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 21:35:05,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:35:05,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:35:05,328 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:35:05,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:35:05,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:35:05,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:35:05,328 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 9 states. [2018-12-02 21:35:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:35:05,405 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-12-02 21:35:05,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:35:05,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-12-02 21:35:05,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:35:05,406 INFO L225 Difference]: With dead ends: 55 [2018-12-02 21:35:05,406 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 21:35:05,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:35:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 21:35:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-12-02 21:35:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 21:35:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2018-12-02 21:35:05,410 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 30 [2018-12-02 21:35:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:35:05,411 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-12-02 21:35:05,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:35:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-12-02 21:35:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 21:35:05,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:35:05,412 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:35:05,412 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:35:05,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:05,412 INFO L82 PathProgramCache]: Analyzing trace with hash 692456512, now seen corresponding path program 1 times [2018-12-02 21:35:05,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:35:05,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:05,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:05,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:05,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:35:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:35:05,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:35:05,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:35:05,472 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-02 21:35:05,472 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [13], [17], [24], [28], [29], [32], [34], [36], [38], [46], [50], [54], [58], [61], [63], [77], [79], [80], [83], [84], [85], [87], [88], [89] [2018-12-02 21:35:05,473 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:35:05,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:35:05,511 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:35:05,511 INFO L272 AbstractInterpreter]: Visited 30 different actions 82 times. Never merged. Never widened. Performed 232 root evaluator evaluations with a maximum evaluation depth of 3. Performed 232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 3 different actions. Largest state had 6 variables. [2018-12-02 21:35:05,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:05,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:35:05,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:35:05,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:35:05,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:05,518 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:35:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:05,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:35:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:35:05,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:35:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:35:05,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:35:05,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 11] total 25 [2018-12-02 21:35:05,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:35:05,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:35:05,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:35:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-12-02 21:35:05,800 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 12 states. [2018-12-02 21:35:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:35:05,921 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-12-02 21:35:05,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:35:05,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-12-02 21:35:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:35:05,921 INFO L225 Difference]: With dead ends: 61 [2018-12-02 21:35:05,921 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 21:35:05,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2018-12-02 21:35:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 21:35:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-02 21:35:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 21:35:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-02 21:35:05,925 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 36 [2018-12-02 21:35:05,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:35:05,925 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-02 21:35:05,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:35:05,925 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-02 21:35:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 21:35:05,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:35:05,926 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:35:05,926 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:35:05,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:05,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1785186173, now seen corresponding path program 1 times [2018-12-02 21:35:05,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:35:05,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:05,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:05,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:05,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:35:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:05,982 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-02 21:35:05,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:35:05,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 21:35:05,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:35:05,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:35:05,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:35:05,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:35:05,984 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 11 states. [2018-12-02 21:35:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:35:06,072 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-12-02 21:35:06,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:35:06,072 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-12-02 21:35:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:35:06,073 INFO L225 Difference]: With dead ends: 53 [2018-12-02 21:35:06,073 INFO L226 Difference]: Without dead ends: 52 [2018-12-02 21:35:06,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:35:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-02 21:35:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2018-12-02 21:35:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 21:35:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-02 21:35:06,078 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 40 [2018-12-02 21:35:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:35:06,078 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-02 21:35:06,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:35:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-12-02 21:35:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 21:35:06,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:35:06,079 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:35:06,080 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:35:06,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:06,080 INFO L82 PathProgramCache]: Analyzing trace with hash 329895424, now seen corresponding path program 1 times [2018-12-02 21:35:06,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:35:06,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:06,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:06,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:06,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:35:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 21:35:06,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:35:06,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:35:06,155 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-02 21:35:06,155 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [13], [17], [24], [28], [29], [39], [41], [43], [45], [46], [50], [54], [58], [61], [63], [77], [81], [82], [83], [84], [85], [87], [88], [89] [2018-12-02 21:35:06,156 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:35:06,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:35:06,190 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:35:06,190 INFO L272 AbstractInterpreter]: Visited 30 different actions 82 times. Never merged. Never widened. Performed 232 root evaluator evaluations with a maximum evaluation depth of 3. Performed 232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 3 different actions. Largest state had 6 variables. [2018-12-02 21:35:06,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:06,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:35:06,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:35:06,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:35:06,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:06,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:35:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:06,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:35:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:35:06,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:35:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:35:06,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:35:06,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 11] total 28 [2018-12-02 21:35:06,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:35:06,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:35:06,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:35:06,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-12-02 21:35:06,539 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 12 states. [2018-12-02 21:35:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:35:06,642 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-12-02 21:35:06,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:35:06,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-12-02 21:35:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:35:06,642 INFO L225 Difference]: With dead ends: 59 [2018-12-02 21:35:06,642 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 21:35:06,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 21:35:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 21:35:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 21:35:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 21:35:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-12-02 21:35:06,646 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 36 [2018-12-02 21:35:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:35:06,646 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-12-02 21:35:06,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:35:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-12-02 21:35:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 21:35:06,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:35:06,647 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:35:06,647 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 21:35:06,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash -587969757, now seen corresponding path program 1 times [2018-12-02 21:35:06,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:35:06,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:06,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:06,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:35:06,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:35:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 21:35:06,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:35:06,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:35:06,721 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-12-02 21:35:06,721 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [13], [17], [24], [28], [29], [32], [34], [36], [38], [39], [41], [43], [45], [46], [50], [54], [58], [61], [63], [77], [79], [80], [81], [82], [83], [84], [85], [87], [88], [89] [2018-12-02 21:35:06,722 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:35:06,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:35:06,847 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:35:06,847 INFO L272 AbstractInterpreter]: Visited 36 different actions 593 times. Never merged. Never widened. Performed 1658 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1658 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 75 fixpoints after 5 different actions. Largest state had 7 variables. [2018-12-02 21:35:06,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:35:06,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:35:06,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:35:06,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:35:06,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:35:06,861 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:35:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:35:06,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:35:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 21:35:06,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:35:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 21:35:07,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:35:07,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [12, 12] total 25 [2018-12-02 21:35:07,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:35:07,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:35:07,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:35:07,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-12-02 21:35:07,165 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 13 states. [2018-12-02 21:35:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:35:07,283 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-12-02 21:35:07,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:35:07,284 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-12-02 21:35:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:35:07,284 INFO L225 Difference]: With dead ends: 46 [2018-12-02 21:35:07,284 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 21:35:07,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2018-12-02 21:35:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 21:35:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 21:35:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 21:35:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 21:35:07,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-12-02 21:35:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:35:07,285 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:35:07,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:35:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:35:07,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 21:35:07,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 21:35:07,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:35:07,451 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 21:35:07,451 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 21:35:07,451 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point dividesFINAL(lines 30 38) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point dividesEXIT(lines 30 38) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L451 ceAbstractionStarter]: At program point dividesENTRY(lines 30 38) the Hoare annotation is: true [2018-12-02 21:35:07,452 INFO L444 ceAbstractionStarter]: At program point L37-2(line 37) the Hoare annotation is: (let ((.cse0 (< |divides_#in~n| 1))) (and (or .cse0 (and (<= divides_~m 2147483647) (<= divides_~n divides_~m) (<= 1 divides_~n)) (< 2147483647 |divides_#in~m|)) (or (< 2147483646 |divides_#in~m|) (<= divides_~m 2147483646) .cse0))) [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point L37-3(line 37) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point gcdEXIT(lines 15 27) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point gcdFINAL(lines 15 27) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-12-02 21:35:07,452 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L444 ceAbstractionStarter]: At program point L26-2(line 26) the Hoare annotation is: (or (< 2147483647 |gcd_#in~y1|) (and (<= gcd_~y2 2147483647) (= |gcd_#in~y1| gcd_~y1) (<= 1 gcd_~y1) (<= gcd_~y1 (+ gcd_~y2 2147483646))) (< 2147483647 |gcd_#in~y2|)) [2018-12-02 21:35:07,453 INFO L451 ceAbstractionStarter]: At program point gcdENTRY(lines 15 27) the Hoare annotation is: true [2018-12-02 21:35:07,453 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L448 ceAbstractionStarter]: For program point L26-3(line 26) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L444 ceAbstractionStarter]: At program point L24-2(line 24) the Hoare annotation is: (or (< 2147483647 |gcd_#in~y1|) (and (<= gcd_~y2 2147483647) (= |gcd_#in~y1| gcd_~y1) (<= 1 gcd_~y1) (<= gcd_~y1 (+ gcd_~y2 2147483646))) (< 2147483647 |gcd_#in~y2|)) [2018-12-02 21:35:07,453 INFO L448 ceAbstractionStarter]: For program point L24-3(line 24) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 19) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 15 27) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L448 ceAbstractionStarter]: For program point gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L448 ceAbstractionStarter]: For program point gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 21:35:07,453 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 21:35:07,453 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 40 57) the Hoare annotation is: true [2018-12-02 21:35:07,453 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 40 57) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-02 21:35:07,453 INFO L444 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: (and (<= main_~n~0 2147483647) (<= 1 main_~z~0) (<= main_~m~0 2147483647)) [2018-12-02 21:35:07,454 INFO L444 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (and (<= main_~n~0 2147483647) (<= main_~m~0 2147483647)) [2018-12-02 21:35:07,454 INFO L448 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-12-02 21:35:07,454 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 56) no Hoare annotation was computed. [2018-12-02 21:35:07,454 INFO L448 ceAbstractionStarter]: For program point L50-1(line 50) no Hoare annotation was computed. [2018-12-02 21:35:07,454 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 51 55) no Hoare annotation was computed. [2018-12-02 21:35:07,454 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 40 57) no Hoare annotation was computed. [2018-12-02 21:35:07,454 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-12-02 21:35:07,454 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 44) no Hoare annotation was computed. [2018-12-02 21:35:07,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:35:07 BoogieIcfgContainer [2018-12-02 21:35:07,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:35:07,456 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:35:07,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:35:07,456 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:35:07,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:35:03" (3/4) ... [2018-12-02 21:35:07,458 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 21:35:07,462 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 21:35:07,462 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure divides [2018-12-02 21:35:07,462 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2018-12-02 21:35:07,462 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 21:35:07,465 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-02 21:35:07,465 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-02 21:35:07,465 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 21:35:07,495 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_543ec3f5-af5c-415a-bfbb-eaf55ae9910a/bin-2019/utaipan/witness.graphml [2018-12-02 21:35:07,495 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:35:07,496 INFO L168 Benchmark]: Toolchain (without parser) took 4024.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:35:07,497 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:35:07,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 127.56 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:35:07,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.85 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:35:07,497 INFO L168 Benchmark]: Boogie Preprocessor took 12.28 ms. Allocated memory is still 1.0 GB. Free memory was 941.6 MB in the beginning and 936.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:35:07,497 INFO L168 Benchmark]: RCFGBuilder took 200.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-02 21:35:07,498 INFO L168 Benchmark]: TraceAbstraction took 3629.70 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -71.5 MB). Peak memory consumption was 297.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:35:07,498 INFO L168 Benchmark]: Witness Printer took 39.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-02 21:35:07,499 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 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 127.56 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 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.85 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.28 ms. Allocated memory is still 1.0 GB. Free memory was 941.6 MB in the beginning and 936.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 200.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3629.70 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -71.5 MB). Peak memory consumption was 297.4 MB. Max. memory is 11.5 GB. * Witness Printer took 39.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 6 error locations. SAFE Result, 3.5s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 258 SDtfs, 255 SDslu, 1229 SDs, 0 SdLazy, 1511 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 229 SyntacticMatches, 16 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 49 PreInvPairs, 58 NumberOfFragments, 104 HoareAnnotationTreeSize, 49 FomulaSimplifications, 785 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 204 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 457 NumberOfCodeBlocks, 457 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 582 ConstructedInterpolants, 28 QuantifiedInterpolants, 67910 SizeOfPredicates, 28 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 120/152 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...