./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9918b49e0d76e4ce36b6a6760021b33460a8ae9b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:11:32,523 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:11:32,525 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:11:32,541 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:11:32,541 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:11:32,542 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:11:32,544 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:11:32,546 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:11:32,547 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:11:32,548 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:11:32,549 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:11:32,549 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:11:32,550 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:11:32,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:11:32,552 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:11:32,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:11:32,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:11:32,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:11:32,558 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:11:32,560 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:11:32,561 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:11:32,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:11:32,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:11:32,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:11:32,566 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:11:32,569 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:11:32,570 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:11:32,571 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:11:32,573 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:11:32,579 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:11:32,579 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:11:32,580 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:11:32,580 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:11:32,580 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:11:32,581 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:11:32,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:11:32,582 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-11-28 23:11:32,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:11:32,614 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:11:32,615 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:11:32,615 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:11:32,619 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:11:32,620 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:11:32,620 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:11:32,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:11:32,620 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:11:32,620 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:11:32,621 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:11:32,621 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:11:32,621 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:11:32,621 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 23:11:32,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:11:32,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 23:11:32,622 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 23:11:32,622 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:11:32,622 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:11:32,622 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:11:32,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 23:11:32,623 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:11:32,623 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:11:32,623 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:11:32,623 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:11:32,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:11:32,624 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:11:32,624 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:11:32,624 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 23:11:32,624 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:11:32,624 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:11:32,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 23:11:32,625 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9918b49e0d76e4ce36b6a6760021b33460a8ae9b [2018-11-28 23:11:32,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:11:32,685 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:11:32,689 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:11:32,691 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:11:32,691 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:11:32,692 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-11-28 23:11:32,759 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b5d9d5a/2ed11f7515b04ea4bd783b393b1cfe3a/FLAG060323fe0 [2018-11-28 23:11:33,169 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:11:33,170 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-11-28 23:11:33,175 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b5d9d5a/2ed11f7515b04ea4bd783b393b1cfe3a/FLAG060323fe0 [2018-11-28 23:11:33,551 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b5d9d5a/2ed11f7515b04ea4bd783b393b1cfe3a [2018-11-28 23:11:33,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:11:33,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:11:33,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:11:33,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:11:33,564 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:11:33,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:11:33" (1/1) ... [2018-11-28 23:11:33,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b08a439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33, skipping insertion in model container [2018-11-28 23:11:33,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:11:33" (1/1) ... [2018-11-28 23:11:33,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:11:33,603 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:11:33,842 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:11:33,848 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:11:33,874 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:11:33,892 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:11:33,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33 WrapperNode [2018-11-28 23:11:33,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:11:33,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:11:33,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:11:33,894 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:11:33,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33" (1/1) ... [2018-11-28 23:11:33,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33" (1/1) ... [2018-11-28 23:11:33,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:11:33,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:11:33,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:11:33,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:11:33,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33" (1/1) ... [2018-11-28 23:11:33,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33" (1/1) ... [2018-11-28 23:11:33,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33" (1/1) ... [2018-11-28 23:11:33,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33" (1/1) ... [2018-11-28 23:11:33,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33" (1/1) ... [2018-11-28 23:11:33,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33" (1/1) ... [2018-11-28 23:11:33,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33" (1/1) ... [2018-11-28 23:11:33,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:11:33,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:11:33,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:11:33,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:11:33,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:11:34,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:11:34,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:11:34,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:11:34,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:11:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:11:34,100 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:11:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 23:11:34,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 23:11:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure gcd_test [2018-11-28 23:11:34,100 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd_test [2018-11-28 23:11:34,510 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:11:34,511 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 23:11:34,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:11:34 BoogieIcfgContainer [2018-11-28 23:11:34,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:11:34,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:11:34,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:11:34,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:11:34,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:11:33" (1/3) ... [2018-11-28 23:11:34,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ae92c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:11:34, skipping insertion in model container [2018-11-28 23:11:34,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:11:33" (2/3) ... [2018-11-28 23:11:34,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ae92c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:11:34, skipping insertion in model container [2018-11-28 23:11:34,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:11:34" (3/3) ... [2018-11-28 23:11:34,519 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-11-28 23:11:34,530 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:11:34,539 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-28 23:11:34,557 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-28 23:11:34,593 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:11:34,594 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:11:34,594 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 23:11:34,595 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:11:34,595 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:11:34,595 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:11:34,595 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:11:34,596 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:11:34,596 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:11:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-28 23:11:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 23:11:34,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:11:34,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:11:34,626 INFO L423 AbstractCegarLoop]: === Iteration 1 === [gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:11:34,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:11:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1670294891, now seen corresponding path program 1 times [2018-11-28 23:11:34,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:11:34,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:11:34,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:34,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:34,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:11:34,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:11:34,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:11:34,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:11:34,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:11:34,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:11:34,877 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2018-11-28 23:11:35,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:11:35,107 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2018-11-28 23:11:35,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:11:35,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 23:11:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:11:35,118 INFO L225 Difference]: With dead ends: 91 [2018-11-28 23:11:35,118 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 23:11:35,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:11:35,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 23:11:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2018-11-28 23:11:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:11:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-28 23:11:35,161 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 9 [2018-11-28 23:11:35,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:11:35,161 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-28 23:11:35,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:11:35,161 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-28 23:11:35,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 23:11:35,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:11:35,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:11:35,163 INFO L423 AbstractCegarLoop]: === Iteration 2 === [gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:11:35,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:11:35,163 INFO L82 PathProgramCache]: Analyzing trace with hash -239527988, now seen corresponding path program 1 times [2018-11-28 23:11:35,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:11:35,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:11:35,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:35,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:35,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:11:35,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:11:35,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:11:35,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:11:35,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:11:35,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:11:35,358 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2018-11-28 23:11:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:11:35,574 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-28 23:11:35,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:11:35,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-28 23:11:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:11:35,577 INFO L225 Difference]: With dead ends: 45 [2018-11-28 23:11:35,577 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 23:11:35,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:11:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 23:11:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-11-28 23:11:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:11:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-28 23:11:35,584 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 10 [2018-11-28 23:11:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:11:35,584 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-28 23:11:35,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:11:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-28 23:11:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 23:11:35,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:11:35,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:11:35,586 INFO L423 AbstractCegarLoop]: === Iteration 3 === [gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:11:35,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:11:35,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1831717912, now seen corresponding path program 1 times [2018-11-28 23:11:35,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:11:35,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:11:35,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:35,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:35,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:11:35,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:11:35,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:11:35,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:11:35,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:11:35,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:11:35,683 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-28 23:11:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:11:36,000 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-28 23:11:36,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:11:36,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-28 23:11:36,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:11:36,002 INFO L225 Difference]: With dead ends: 34 [2018-11-28 23:11:36,002 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 23:11:36,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:11:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 23:11:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2018-11-28 23:11:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:11:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-28 23:11:36,010 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2018-11-28 23:11:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:11:36,011 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-28 23:11:36,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:11:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-28 23:11:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 23:11:36,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:11:36,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:11:36,013 INFO L423 AbstractCegarLoop]: === Iteration 4 === [gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:11:36,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:11:36,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1831718104, now seen corresponding path program 1 times [2018-11-28 23:11:36,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:11:36,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:11:36,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:36,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:36,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:11:36,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:11:36,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:11:36,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:11:36,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:11:36,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:11:36,095 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2018-11-28 23:11:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:11:36,356 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-28 23:11:36,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:11:36,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-28 23:11:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:11:36,358 INFO L225 Difference]: With dead ends: 33 [2018-11-28 23:11:36,358 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 23:11:36,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:11:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 23:11:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-11-28 23:11:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:11:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-28 23:11:36,366 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2018-11-28 23:11:36,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:11:36,367 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-28 23:11:36,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:11:36,367 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-28 23:11:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 23:11:36,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:11:36,368 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:11:36,368 INFO L423 AbstractCegarLoop]: === Iteration 5 === [gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:11:36,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:11:36,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1250699491, now seen corresponding path program 1 times [2018-11-28 23:11:36,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:11:36,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:11:36,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:36,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:36,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:11:36,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:11:36,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:11:36,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:36,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:11:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:11:36,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:11:36,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-11-28 23:11:36,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:11:36,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:11:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:11:36,826 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 9 states. [2018-11-28 23:11:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:11:37,008 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-28 23:11:37,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:11:37,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-28 23:11:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:11:37,010 INFO L225 Difference]: With dead ends: 31 [2018-11-28 23:11:37,010 INFO L226 Difference]: Without dead ends: 22 [2018-11-28 23:11:37,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:11:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-28 23:11:37,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 23:11:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:11:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-28 23:11:37,026 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2018-11-28 23:11:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:11:37,026 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-28 23:11:37,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:11:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-28 23:11:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 23:11:37,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:11:37,029 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:11:37,030 INFO L423 AbstractCegarLoop]: === Iteration 6 === [gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:11:37,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:11:37,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1428194269, now seen corresponding path program 1 times [2018-11-28 23:11:37,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:11:37,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:11:37,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:37,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:37,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:11:37,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:11:37,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 23:11:37,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:37,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:11:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:11:37,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:11:37,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-11-28 23:11:37,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 23:11:37,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:11:37,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:11:37,320 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-11-28 23:11:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:11:37,850 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-28 23:11:37,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:11:37,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-28 23:11:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:11:37,858 INFO L225 Difference]: With dead ends: 51 [2018-11-28 23:11:37,858 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 23:11:37,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-11-28 23:11:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 23:11:37,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-11-28 23:11:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 23:11:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-28 23:11:37,870 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 17 [2018-11-28 23:11:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:11:37,871 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-28 23:11:37,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 23:11:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-28 23:11:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 23:11:37,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:11:37,874 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:11:37,874 INFO L423 AbstractCegarLoop]: === Iteration 7 === [gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:11:37,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:11:37,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1428194461, now seen corresponding path program 1 times [2018-11-28 23:11:37,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:11:37,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:11:37,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:37,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:37,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:11:38,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:11:38,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 23:11:38,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:38,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:11:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:11:38,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:11:38,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2018-11-28 23:11:38,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:11:38,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:11:38,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:11:38,142 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2018-11-28 23:11:38,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:11:38,569 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-28 23:11:38,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:11:38,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-28 23:11:38,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:11:38,572 INFO L225 Difference]: With dead ends: 49 [2018-11-28 23:11:38,572 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 23:11:38,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:11:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 23:11:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-11-28 23:11:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 23:11:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-28 23:11:38,582 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 17 [2018-11-28 23:11:38,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:11:38,583 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-28 23:11:38,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:11:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-28 23:11:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 23:11:38,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:11:38,584 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:11:38,584 INFO L423 AbstractCegarLoop]: === Iteration 8 === [gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:11:38,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:11:38,585 INFO L82 PathProgramCache]: Analyzing trace with hash 518481683, now seen corresponding path program 1 times [2018-11-28 23:11:38,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:11:38,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:11:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:38,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:11:38,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:11:38,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 23:11:38,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:38,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:11:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:11:39,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:11:39,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-11-28 23:11:39,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:11:39,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:11:39,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:11:39,027 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 13 states. [2018-11-28 23:11:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:11:39,444 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2018-11-28 23:11:39,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 23:11:39,445 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-28 23:11:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:11:39,447 INFO L225 Difference]: With dead ends: 101 [2018-11-28 23:11:39,447 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 23:11:39,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2018-11-28 23:11:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 23:11:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2018-11-28 23:11:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 23:11:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-28 23:11:39,462 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 25 [2018-11-28 23:11:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:11:39,462 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-28 23:11:39,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:11:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-28 23:11:39,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 23:11:39,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:11:39,464 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:11:39,464 INFO L423 AbstractCegarLoop]: === Iteration 9 === [gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:11:39,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:11:39,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1145508093, now seen corresponding path program 2 times [2018-11-28 23:11:39,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:11:39,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:11:39,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:39,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:39,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 23:11:39,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:11:39,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:11:39,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:11:39,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:11:39,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:11:39,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:11:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:11:39,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:11:39,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 14 [2018-11-28 23:11:39,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 23:11:39,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 23:11:39,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:11:39,966 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 14 states. [2018-11-28 23:11:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:11:40,555 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2018-11-28 23:11:40,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 23:11:40,556 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-28 23:11:40,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:11:40,559 INFO L225 Difference]: With dead ends: 106 [2018-11-28 23:11:40,560 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 23:11:40,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2018-11-28 23:11:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 23:11:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-11-28 23:11:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 23:11:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-11-28 23:11:40,592 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 33 [2018-11-28 23:11:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:11:40,592 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-11-28 23:11:40,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 23:11:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-11-28 23:11:40,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 23:11:40,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:11:40,598 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:11:40,599 INFO L423 AbstractCegarLoop]: === Iteration 10 === [gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:11:40,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:11:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1145508285, now seen corresponding path program 1 times [2018-11-28 23:11:40,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:11:40,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:11:40,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:40,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:11:40,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 23:11:40,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:11:40,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:11:40,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:40,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:11:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:11:41,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:11:41,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 12 [2018-11-28 23:11:41,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:11:41,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:11:41,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:11:41,095 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 13 states. [2018-11-28 23:11:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:11:41,505 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2018-11-28 23:11:41,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:11:41,506 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-28 23:11:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:11:41,507 INFO L225 Difference]: With dead ends: 99 [2018-11-28 23:11:41,507 INFO L226 Difference]: Without dead ends: 63 [2018-11-28 23:11:41,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-11-28 23:11:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-28 23:11:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-28 23:11:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 23:11:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-11-28 23:11:41,520 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 33 [2018-11-28 23:11:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:11:41,520 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-11-28 23:11:41,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:11:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-11-28 23:11:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 23:11:41,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:11:41,522 INFO L402 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:11:41,522 INFO L423 AbstractCegarLoop]: === Iteration 11 === [gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:11:41,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:11:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1903926841, now seen corresponding path program 2 times [2018-11-28 23:11:41,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:11:41,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:11:41,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:41,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:11:41,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 47 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-28 23:11:41,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:11:41,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:11:41,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:11:41,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:11:41,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:11:41,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:11:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:11:42,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:11:42,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-11-28 23:11:42,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 23:11:42,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 23:11:42,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-11-28 23:11:42,043 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 16 states. [2018-11-28 23:11:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:11:43,066 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-28 23:11:43,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 23:11:43,067 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-11-28 23:11:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:11:43,068 INFO L225 Difference]: With dead ends: 72 [2018-11-28 23:11:43,069 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 23:11:43,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2018-11-28 23:11:43,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 23:11:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2018-11-28 23:11:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 23:11:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-11-28 23:11:43,089 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 41 [2018-11-28 23:11:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:11:43,093 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-11-28 23:11:43,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 23:11:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-11-28 23:11:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 23:11:43,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:11:43,095 INFO L402 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:11:43,095 INFO L423 AbstractCegarLoop]: === Iteration 12 === [gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:11:43,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:11:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1770209325, now seen corresponding path program 3 times [2018-11-28 23:11:43,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:11:43,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:11:43,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:43,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:11:43,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:11:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:11:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 59 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-28 23:11:43,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:11:43,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:11:43,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:11:43,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 23:11:43,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:11:43,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:11:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 97 proven. 12 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-28 23:11:43,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:11:43,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-11-28 23:11:43,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 23:11:43,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:11:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:11:43,364 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 10 states. [2018-11-28 23:11:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:11:43,559 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-28 23:11:43,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:11:43,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2018-11-28 23:11:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:11:43,563 INFO L225 Difference]: With dead ends: 58 [2018-11-28 23:11:43,563 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:11:43,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2018-11-28 23:11:43,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:11:43,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:11:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:11:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:11:43,567 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-11-28 23:11:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:11:43,567 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:11:43,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 23:11:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:11:43,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:11:43,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 23:11:43,687 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 119 [2018-11-28 23:11:44,120 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 24 [2018-11-28 23:11:44,124 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 23:11:44,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:11:44,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:11:44,124 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 23:11:44,124 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 23:11:44,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 23:11:44,124 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 30 46) the Hoare annotation is: true [2018-11-28 23:11:44,126 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 30 46) no Hoare annotation was computed. [2018-11-28 23:11:44,126 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-28 23:11:44,126 INFO L444 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (<= 63 main_~x~0) [2018-11-28 23:11:44,126 INFO L444 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (<= 63 main_~x~0) [2018-11-28 23:11:44,126 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 30 46) no Hoare annotation was computed. [2018-11-28 23:11:44,126 INFO L444 ceAbstractionStarter]: At program point L41-1(line 41) the Hoare annotation is: (<= 63 main_~x~0) [2018-11-28 23:11:44,127 INFO L444 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (and (<= 63 main_~x~0) (<= 18 main_~y~0) (<= main_~x~0 63) (<= main_~y~0 18)) [2018-11-28 23:11:44,127 INFO L448 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2018-11-28 23:11:44,127 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-28 23:11:44,127 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-28 23:11:44,127 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-28 23:11:44,127 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-28 23:11:44,127 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-28 23:11:44,127 INFO L448 ceAbstractionStarter]: For program point gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2018-11-28 23:11:44,127 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-11-28 23:11:44,128 INFO L448 ceAbstractionStarter]: For program point gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2018-11-28 23:11:44,128 INFO L448 ceAbstractionStarter]: For program point gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2018-11-28 23:11:44,128 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-28 23:11:44,128 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-28 23:11:44,128 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2018-11-28 23:11:44,128 INFO L448 ceAbstractionStarter]: For program point gcd_testEXIT(lines 10 27) no Hoare annotation was computed. [2018-11-28 23:11:44,128 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 25) no Hoare annotation was computed. [2018-11-28 23:11:44,129 INFO L448 ceAbstractionStarter]: For program point gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-11-28 23:11:44,129 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-28 23:11:44,129 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-11-28 23:11:44,129 INFO L448 ceAbstractionStarter]: For program point L13-3(lines 11 27) no Hoare annotation was computed. [2018-11-28 23:11:44,129 INFO L451 ceAbstractionStarter]: At program point gcd_testENTRY(lines 10 27) the Hoare annotation is: true [2018-11-28 23:11:44,129 INFO L448 ceAbstractionStarter]: For program point gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2018-11-28 23:11:44,129 INFO L448 ceAbstractionStarter]: For program point gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2018-11-28 23:11:44,129 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2018-11-28 23:11:44,130 INFO L448 ceAbstractionStarter]: For program point gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2018-11-28 23:11:44,130 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 19 25) the Hoare annotation is: (or (< |gcd_test_#in~b| 18) (< 63 |gcd_test_#in~a|) (< |gcd_test_#in~a| 63) (< 18 |gcd_test_#in~b|) (and (<= 0 gcd_test_~b) (<= 1 gcd_test_~a) (<= gcd_test_~a 2147483647) (<= gcd_test_~b 2147483646))) [2018-11-28 23:11:44,130 INFO L448 ceAbstractionStarter]: For program point gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-11-28 23:11:44,130 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-11-28 23:11:44,130 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2018-11-28 23:11:44,130 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2018-11-28 23:11:44,130 INFO L448 ceAbstractionStarter]: For program point L12-4(lines 11 27) no Hoare annotation was computed. [2018-11-28 23:11:44,131 INFO L448 ceAbstractionStarter]: For program point gcd_testFINAL(lines 10 27) no Hoare annotation was computed. [2018-11-28 23:11:44,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:11:44 BoogieIcfgContainer [2018-11-28 23:11:44,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:11:44,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:11:44,146 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:11:44,147 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:11:44,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:11:34" (3/4) ... [2018-11-28 23:11:44,151 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:11:44,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:11:44,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:11:44,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 23:11:44,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd_test [2018-11-28 23:11:44,164 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-28 23:11:44,164 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 23:11:44,165 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:11:44,198 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(b) < 18 || 63 < \old(a)) || \old(a) < 63) || 18 < \old(b)) || (((0 <= b && 1 <= a) && a <= 2147483647) && b <= 2147483646) [2018-11-28 23:11:44,226 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:11:44,227 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:11:44,228 INFO L168 Benchmark]: Toolchain (without parser) took 10672.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 952.7 MB in the beginning and 856.1 MB in the end (delta: 96.6 MB). Peak memory consumption was 294.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:11:44,229 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:11:44,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.95 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:11:44,230 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.57 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:11:44,232 INFO L168 Benchmark]: Boogie Preprocessor took 44.64 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:11:44,232 INFO L168 Benchmark]: RCFGBuilder took 543.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:11:44,234 INFO L168 Benchmark]: TraceAbstraction took 9633.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 863.5 MB in the end (delta: 249.1 MB). Peak memory consumption was 311.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:11:44,234 INFO L168 Benchmark]: Witness Printer took 80.88 ms. Allocated memory is still 1.2 GB. Free memory was 863.5 MB in the beginning and 856.1 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:11:44,240 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.95 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 28.57 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.64 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 543.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9633.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 863.5 MB in the end (delta: 249.1 MB). Peak memory consumption was 311.5 MB. Max. memory is 11.5 GB. * Witness Printer took 80.88 ms. Allocated memory is still 1.2 GB. Free memory was 863.5 MB in the beginning and 856.1 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((\old(b) < 18 || 63 < \old(a)) || \old(a) < 63) || 18 < \old(b)) || (((0 <= b && 1 <= a) && a <= 2147483647) && b <= 2147483646) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 8 error locations. SAFE Result, 9.5s OverallTime, 12 OverallIterations, 12 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 113 SDtfs, 711 SDslu, 451 SDs, 0 SdLazy, 1114 SolverSat, 187 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 106 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 16 PreInvPairs, 31 NumberOfFragments, 58 HoareAnnotationTreeSize, 16 FomulaSimplifications, 4245 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 637 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 525 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 505 ConstructedInterpolants, 28 QuantifiedInterpolants, 72635 SizeOfPredicates, 21 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 562/748 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...