./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c --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/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c -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 4ba31a8852254650e4ff6b6614669c496c01110f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:10:37,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:10:37,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:10:37,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:10:37,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:10:37,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:10:37,315 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:10:37,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:10:37,319 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:10:37,320 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:10:37,321 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:10:37,321 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:10:37,322 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:10:37,324 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:10:37,325 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:10:37,325 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:10:37,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:10:37,329 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:10:37,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:10:37,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:10:37,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:10:37,336 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:10:37,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:10:37,344 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:10:37,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:10:37,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:10:37,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:10:37,351 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:10:37,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:10:37,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:10:37,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:10:37,358 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:10:37,358 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:10:37,359 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:10:37,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:10:37,361 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:10:37,361 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:10:37,390 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:10:37,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:10:37,391 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:10:37,391 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:10:37,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:10:37,393 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:10:37,394 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:10:37,394 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:10:37,394 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:10:37,394 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:10:37,394 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:10:37,394 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:10:37,396 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:10:37,396 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 23:10:37,396 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:10:37,396 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 23:10:37,396 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 23:10:37,396 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:10:37,397 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:10:37,397 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:10:37,397 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 23:10:37,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:10:37,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:10:37,398 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:10:37,399 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:10:37,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:10:37,399 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:10:37,399 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:10:37,400 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 23:10:37,400 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:10:37,400 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:10:37,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 23:10:37,400 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 -> 4ba31a8852254650e4ff6b6614669c496c01110f [2018-11-28 23:10:37,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:10:37,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:10:37,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:10:37,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:10:37,484 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:10:37,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-28 23:10:37,540 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72071d42c/3302fe015d644adc8d59012feeeb9da5/FLAG42b32a5db [2018-11-28 23:10:38,009 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:10:38,010 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-28 23:10:38,017 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72071d42c/3302fe015d644adc8d59012feeeb9da5/FLAG42b32a5db [2018-11-28 23:10:38,344 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72071d42c/3302fe015d644adc8d59012feeeb9da5 [2018-11-28 23:10:38,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:10:38,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:10:38,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:10:38,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:10:38,356 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:10:38,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:10:38" (1/1) ... [2018-11-28 23:10:38,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a828241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:38, skipping insertion in model container [2018-11-28 23:10:38,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:10:38" (1/1) ... [2018-11-28 23:10:38,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:10:38,397 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:10:38,622 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:10:38,628 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:10:38,652 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:10:38,668 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:10:38,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:38 WrapperNode [2018-11-28 23:10:38,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:10:38,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:10:38,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:10:38,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:10:38,681 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:10:38" (1/1) ... [2018-11-28 23:10:38,687 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:10:38" (1/1) ... [2018-11-28 23:10:38,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:10:38,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:10:38,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:10:38,696 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:10:38,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:38" (1/1) ... [2018-11-28 23:10:38,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:38" (1/1) ... [2018-11-28 23:10:38,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:38" (1/1) ... [2018-11-28 23:10:38,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:38" (1/1) ... [2018-11-28 23:10:38,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:38" (1/1) ... [2018-11-28 23:10:38,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:38" (1/1) ... [2018-11-28 23:10:38,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:38" (1/1) ... [2018-11-28 23:10:38,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:10:38,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:10:38,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:10:38,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:10:38,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:38" (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:10:38,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:10:38,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:10:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2018-11-28 23:10:38,861 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2018-11-28 23:10:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2018-11-28 23:10:38,861 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2018-11-28 23:10:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:10:38,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:10:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:10:38,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:10:39,323 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:10:39,325 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 23:10:39,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:10:39 BoogieIcfgContainer [2018-11-28 23:10:39,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:10:39,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:10:39,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:10:39,330 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:10:39,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:10:38" (1/3) ... [2018-11-28 23:10:39,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205c381f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:10:39, skipping insertion in model container [2018-11-28 23:10:39,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:38" (2/3) ... [2018-11-28 23:10:39,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205c381f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:10:39, skipping insertion in model container [2018-11-28 23:10:39,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:10:39" (3/3) ... [2018-11-28 23:10:39,334 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-28 23:10:39,344 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:10:39,353 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-28 23:10:39,371 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-28 23:10:39,405 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:10:39,406 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:10:39,406 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 23:10:39,407 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:10:39,407 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:10:39,407 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:10:39,407 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:10:39,408 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:10:39,408 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:10:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-28 23:10:39,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 23:10:39,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:39,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:39,439 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:39,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:39,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1091942582, now seen corresponding path program 1 times [2018-11-28 23:10:39,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:39,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:39,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:39,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:39,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:39,718 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:10:39,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:10:39,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:10:39,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:10:39,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:10:39,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:10:39,745 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-11-28 23:10:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:40,248 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2018-11-28 23:10:40,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:10:40,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-28 23:10:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:40,259 INFO L225 Difference]: With dead ends: 85 [2018-11-28 23:10:40,259 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 23:10:40,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:10:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 23:10:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-28 23:10:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 23:10:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-28 23:10:40,306 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2018-11-28 23:10:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:40,306 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-28 23:10:40,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:10:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-28 23:10:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 23:10:40,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:40,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:40,309 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:40,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:40,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1091942806, now seen corresponding path program 1 times [2018-11-28 23:10:40,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:40,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:40,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:40,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:40,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:40,413 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:10:40,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:10:40,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:10:40,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:10:40,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:10:40,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:10:40,417 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-11-28 23:10:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:40,678 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-28 23:10:40,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:10:40,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-28 23:10:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:40,682 INFO L225 Difference]: With dead ends: 35 [2018-11-28 23:10:40,682 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 23:10:40,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:10:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 23:10:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-28 23:10:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:10:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-28 23:10:40,692 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2018-11-28 23:10:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:40,692 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-28 23:10:40,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:10:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-28 23:10:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 23:10:40,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:40,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:40,694 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:40,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:40,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1535417245, now seen corresponding path program 1 times [2018-11-28 23:10:40,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:40,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:40,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:40,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:40,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:40,866 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:10:40,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:10:40,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:10:40,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:10:40,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:10:40,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:10:40,868 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-28 23:10:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:41,454 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-28 23:10:41,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:10:41,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-28 23:10:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:41,459 INFO L225 Difference]: With dead ends: 45 [2018-11-28 23:10:41,459 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 23:10:41,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:10:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 23:10:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-28 23:10:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 23:10:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-28 23:10:41,472 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-11-28 23:10:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:41,473 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-28 23:10:41,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:10:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-28 23:10:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 23:10:41,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:41,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:41,475 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:41,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:41,475 INFO L82 PathProgramCache]: Analyzing trace with hash 353294382, now seen corresponding path program 1 times [2018-11-28 23:10:41,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:41,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:41,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:41,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:41,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:41,530 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:10:41,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:10:41,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:10:41,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:10:41,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:10:41,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:10:41,532 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-11-28 23:10:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:41,549 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-28 23:10:41,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:10:41,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 23:10:41,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:41,553 INFO L225 Difference]: With dead ends: 41 [2018-11-28 23:10:41,553 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 23:10:41,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:10:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 23:10:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 23:10:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 23:10:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-28 23:10:41,563 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 21 [2018-11-28 23:10:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:41,563 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-28 23:10:41,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:10:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-28 23:10:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 23:10:41,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:41,565 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:41,566 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:41,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:41,566 INFO L82 PathProgramCache]: Analyzing trace with hash -823556285, now seen corresponding path program 1 times [2018-11-28 23:10:41,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:41,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:41,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:41,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:41,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:10:41,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:41,753 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:10:41,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:41,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:10:42,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:10:42,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2018-11-28 23:10:42,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 23:10:42,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 23:10:42,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-11-28 23:10:42,219 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 20 states. [2018-11-28 23:10:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:43,004 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-28 23:10:43,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:10:43,007 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-28 23:10:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:43,009 INFO L225 Difference]: With dead ends: 52 [2018-11-28 23:10:43,009 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 23:10:43,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2018-11-28 23:10:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 23:10:43,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-28 23:10:43,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 23:10:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-28 23:10:43,017 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 26 [2018-11-28 23:10:43,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:43,018 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-28 23:10:43,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 23:10:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-28 23:10:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 23:10:43,019 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:43,019 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:43,020 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:43,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:43,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1123279450, now seen corresponding path program 1 times [2018-11-28 23:10:43,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:43,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:43,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:43,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:43,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:10:43,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:10:43,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 23:10:43,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 23:10:43,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:10:43,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:10:43,211 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 10 states. [2018-11-28 23:10:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:43,645 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-28 23:10:43,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:10:43,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-28 23:10:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:43,648 INFO L225 Difference]: With dead ends: 46 [2018-11-28 23:10:43,649 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 23:10:43,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:10:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 23:10:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-28 23:10:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 23:10:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-28 23:10:43,660 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 30 [2018-11-28 23:10:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:43,660 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-28 23:10:43,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 23:10:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-28 23:10:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 23:10:43,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:43,663 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:43,664 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:43,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:43,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1396968422, now seen corresponding path program 1 times [2018-11-28 23:10:43,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:43,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:43,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:43,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:43,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 23:10:43,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:10:43,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 23:10:43,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:10:43,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:10:43,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:10:43,876 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 9 states. [2018-11-28 23:10:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:44,078 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-28 23:10:44,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:10:44,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-28 23:10:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:44,083 INFO L225 Difference]: With dead ends: 55 [2018-11-28 23:10:44,083 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 23:10:44,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:10:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 23:10:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-11-28 23:10:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 23:10:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2018-11-28 23:10:44,095 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 30 [2018-11-28 23:10:44,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:44,095 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-11-28 23:10:44,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:10:44,096 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-11-28 23:10:44,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 23:10:44,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:44,097 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:44,098 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:44,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:44,098 INFO L82 PathProgramCache]: Analyzing trace with hash 692456512, now seen corresponding path program 1 times [2018-11-28 23:10:44,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:44,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:44,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:44,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:44,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:10:44,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:44,262 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:10:44,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:44,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:10:44,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:10:44,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 18 [2018-11-28 23:10:44,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 23:10:44,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 23:10:44,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-28 23:10:44,543 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 19 states. [2018-11-28 23:10:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:44,904 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-28 23:10:44,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:10:44,904 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-11-28 23:10:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:44,906 INFO L225 Difference]: With dead ends: 61 [2018-11-28 23:10:44,906 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 23:10:44,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-11-28 23:10:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 23:10:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-28 23:10:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 23:10:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-28 23:10:44,921 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 36 [2018-11-28 23:10:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:44,921 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-28 23:10:44,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 23:10:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-28 23:10:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 23:10:44,925 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:44,925 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:44,926 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:44,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1785186173, now seen corresponding path program 1 times [2018-11-28 23:10:44,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:44,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:44,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:44,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:44,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 23:10:45,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:10:45,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 23:10:45,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 23:10:45,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:10:45,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:10:45,090 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 11 states. [2018-11-28 23:10:45,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:45,473 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-28 23:10:45,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:10:45,474 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-11-28 23:10:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:45,475 INFO L225 Difference]: With dead ends: 53 [2018-11-28 23:10:45,477 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 23:10:45,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-28 23:10:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 23:10:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2018-11-28 23:10:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 23:10:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-28 23:10:45,485 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 40 [2018-11-28 23:10:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:45,486 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-28 23:10:45,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 23:10:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-28 23:10:45,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 23:10:45,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:45,487 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:45,488 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:45,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:45,488 INFO L82 PathProgramCache]: Analyzing trace with hash 329895424, now seen corresponding path program 1 times [2018-11-28 23:10:45,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:45,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:45,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:45,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:45,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 23:10:45,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:45,740 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:10:45,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:45,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:10:46,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:10:46,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2018-11-28 23:10:46,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 23:10:46,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 23:10:46,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-11-28 23:10:46,025 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 22 states. [2018-11-28 23:10:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:46,724 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-28 23:10:46,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 23:10:46,725 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-11-28 23:10:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:46,726 INFO L225 Difference]: With dead ends: 62 [2018-11-28 23:10:46,726 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 23:10:46,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-11-28 23:10:46,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 23:10:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 23:10:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 23:10:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-28 23:10:46,734 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 36 [2018-11-28 23:10:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:46,734 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-28 23:10:46,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 23:10:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-28 23:10:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 23:10:46,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:10:46,736 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:10:46,736 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:10:46,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:10:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash -587969757, now seen corresponding path program 1 times [2018-11-28 23:10:46,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:10:46,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:10:46,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:46,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:46,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:10:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 23:10:46,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:10:46,958 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:10:46,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:10:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:10:47,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:10:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 23:10:47,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:10:47,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 18 [2018-11-28 23:10:47,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 23:10:47,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 23:10:47,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-11-28 23:10:47,350 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 19 states. [2018-11-28 23:10:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:10:47,953 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-28 23:10:47,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:10:47,954 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-11-28 23:10:47,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:10:47,954 INFO L225 Difference]: With dead ends: 46 [2018-11-28 23:10:47,955 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:10:47,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-11-28 23:10:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:10:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:10:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:10:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:10:47,957 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-11-28 23:10:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:10:47,957 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:10:47,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 23:10:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:10:47,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:10:47,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 23:10:48,872 WARN L180 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2018-11-28 23:10:49,093 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 23:10:49,094 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:10:49,094 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2018-11-28 23:10:49,094 INFO L448 ceAbstractionStarter]: For program point dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2018-11-28 23:10:49,094 INFO L448 ceAbstractionStarter]: For program point dividesFINAL(lines 30 38) no Hoare annotation was computed. [2018-11-28 23:10:49,094 INFO L448 ceAbstractionStarter]: For program point dividesEXIT(lines 30 38) no Hoare annotation was computed. [2018-11-28 23:10:49,094 INFO L448 ceAbstractionStarter]: For program point dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2018-11-28 23:10:49,094 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-28 23:10:49,095 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-11-28 23:10:49,095 INFO L451 ceAbstractionStarter]: At program point dividesENTRY(lines 30 38) the Hoare annotation is: true [2018-11-28 23:10:49,095 INFO L444 ceAbstractionStarter]: At program point L37-2(line 37) the Hoare annotation is: (let ((.cse0 (< 2147483646 |divides_#in~m|)) (.cse1 (< |divides_#in~n| 1)) (.cse2 (+ |divides_#in~m| 1)) (.cse3 (< 2147483647 |divides_#in~m|))) (and (or .cse0 .cse1 (< |divides_#in~n| .cse2)) (or .cse1 (and (<= divides_~m 2147483647) (<= divides_~n divides_~m) (<= 1 divides_~n)) .cse3) (or .cse0 (<= divides_~m 2147483646) .cse1) (or .cse1 (<= (+ divides_~m 1) (* 2 divides_~n)) (< (* 2 |divides_#in~n|) .cse2) .cse3))) [2018-11-28 23:10:49,095 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-11-28 23:10:49,095 INFO L448 ceAbstractionStarter]: For program point L37-3(line 37) no Hoare annotation was computed. [2018-11-28 23:10:49,095 INFO L448 ceAbstractionStarter]: For program point gcdEXIT(lines 15 27) no Hoare annotation was computed. [2018-11-28 23:10:49,096 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-28 23:10:49,096 INFO L448 ceAbstractionStarter]: For program point gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-28 23:10:49,096 INFO L448 ceAbstractionStarter]: For program point gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-11-28 23:10:49,096 INFO L448 ceAbstractionStarter]: For program point gcdFINAL(lines 15 27) no Hoare annotation was computed. [2018-11-28 23:10:49,096 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-11-28 23:10:49,096 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-28 23:10:49,096 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-28 23:10:49,097 INFO L444 ceAbstractionStarter]: At program point L26-2(line 26) the Hoare annotation is: (or (< 2147483647 |gcd_#in~y1|) (and (<= gcd_~y2 2147483647) (= |gcd_#in~y1| gcd_~y1) (<= 1 gcd_~y1) (<= gcd_~y1 (+ gcd_~y2 2147483646))) (< 2147483647 |gcd_#in~y2|)) [2018-11-28 23:10:49,099 INFO L451 ceAbstractionStarter]: At program point gcdENTRY(lines 15 27) the Hoare annotation is: true [2018-11-28 23:10:49,099 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-11-28 23:10:49,099 INFO L448 ceAbstractionStarter]: For program point L26-3(line 26) no Hoare annotation was computed. [2018-11-28 23:10:49,099 INFO L444 ceAbstractionStarter]: At program point L24-2(line 24) the Hoare annotation is: (or (< 2147483647 |gcd_#in~y1|) (and (<= gcd_~y2 2147483647) (= |gcd_#in~y1| gcd_~y1) (<= 1 gcd_~y1) (<= gcd_~y1 (+ gcd_~y2 2147483646))) (< 2147483647 |gcd_#in~y2|)) [2018-11-28 23:10:49,099 INFO L448 ceAbstractionStarter]: For program point L24-3(line 24) no Hoare annotation was computed. [2018-11-28 23:10:49,099 INFO L448 ceAbstractionStarter]: For program point gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-28 23:10:49,101 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-28 23:10:49,101 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 19) no Hoare annotation was computed. [2018-11-28 23:10:49,101 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 15 27) no Hoare annotation was computed. [2018-11-28 23:10:49,101 INFO L448 ceAbstractionStarter]: For program point gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-11-28 23:10:49,101 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:10:49,101 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 23:10:49,101 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 23:10:49,102 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 23:10:49,102 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 40 57) the Hoare annotation is: true [2018-11-28 23:10:49,102 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 40 57) no Hoare annotation was computed. [2018-11-28 23:10:49,102 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-28 23:10:49,102 INFO L444 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: (and (<= main_~n~0 2147483647) (<= 1 main_~m~0) (<= 1 main_~z~0) (<= main_~m~0 2147483647)) [2018-11-28 23:10:49,102 INFO L444 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (and (<= main_~n~0 2147483647) (<= 1 main_~m~0) (<= main_~m~0 2147483647)) [2018-11-28 23:10:49,102 INFO L448 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-11-28 23:10:49,103 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 56) no Hoare annotation was computed. [2018-11-28 23:10:49,103 INFO L448 ceAbstractionStarter]: For program point L50-1(line 50) no Hoare annotation was computed. [2018-11-28 23:10:49,103 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 51 55) no Hoare annotation was computed. [2018-11-28 23:10:49,103 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 40 57) no Hoare annotation was computed. [2018-11-28 23:10:49,104 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-28 23:10:49,104 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 44) no Hoare annotation was computed. [2018-11-28 23:10:49,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:10:49 BoogieIcfgContainer [2018-11-28 23:10:49,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:10:49,107 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:10:49,108 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:10:49,109 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:10:49,109 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:10:39" (3/4) ... [2018-11-28 23:10:49,112 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:10:49,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:10:49,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure divides [2018-11-28 23:10:49,119 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2018-11-28 23:10:49,119 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:10:49,124 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-28 23:10:49,124 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-28 23:10:49,125 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:10:49,203 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:10:49,204 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:10:49,205 INFO L168 Benchmark]: Toolchain (without parser) took 10855.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 951.4 MB in the beginning and 811.9 MB in the end (delta: 139.5 MB). Peak memory consumption was 345.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:10:49,206 INFO L168 Benchmark]: CDTParser took 0.13 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:10:49,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.90 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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:10:49,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.78 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:10:49,207 INFO L168 Benchmark]: Boogie Preprocessor took 31.42 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:10:49,208 INFO L168 Benchmark]: RCFGBuilder took 598.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:10:49,208 INFO L168 Benchmark]: TraceAbstraction took 9780.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 819.5 MB in the end (delta: 298.3 MB). Peak memory consumption was 363.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:10:49,209 INFO L168 Benchmark]: Witness Printer took 96.35 ms. Allocated memory is still 1.2 GB. Free memory was 819.5 MB in the beginning and 811.9 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:10:49,213 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.13 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 317.90 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.78 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.42 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 598.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9780.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 819.5 MB in the end (delta: 298.3 MB). Peak memory consumption was 363.3 MB. Max. memory is 11.5 GB. * Witness Printer took 96.35 ms. Allocated memory is still 1.2 GB. Free memory was 819.5 MB in the beginning and 811.9 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 6 error locations. SAFE Result, 9.7s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 239 SDtfs, 299 SDslu, 1456 SDs, 0 SdLazy, 2135 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 49 PreInvPairs, 59 NumberOfFragments, 149 HoareAnnotationTreeSize, 49 FomulaSimplifications, 626 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 385 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 457 NumberOfCodeBlocks, 457 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 442 ConstructedInterpolants, 0 QuantifiedInterpolants, 43790 SizeOfPredicates, 20 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 94/110 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...